Publications

Found 1144 results
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is K  [Clear All Filters]
1990
Karp, R. M. (1990).  An Introduction to Randomized Algorithms.
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1990).  A Monte-Carlo Algorithm for Estimating the Permanent.
Karmarkar, N., Karp R. M., Lipton R. J., Lovász L., & Luby M. (1990).  A Monte-Carlo Algorithm for Estimating the Permanent.
Karp, R. M., Vazirani U. V., & Vazirani V. V. (1990).  An optimal algorithm for on-line bipartite matching. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the Power of Randomization in Online Algorithms.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the power of randomization in online algorithms. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
Bilmes, J. A., & Kohn P. (1990).  Ring Array Processor (RAP): Software Architecture.
Kohn, P., & Bilmes J. A. (1990).  Ring Array Processor (RAP): Software User's Manual Version 1.0.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1990).  Subtree isomorphism is in random NC. Discrete Applied Mathematics. 29(1), 35-62.
1989
Demers, A. J., Keshav S., & Shenker S. J. (1989).  Analysis and Simulation of a Fair Queuing Algorithm. Proceedings of the 1989 SIGCOMM Symposium on Communications Architectures & Protocols. 1-12.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Kobsa, A. (1989).  Conceptual Hierarchies in Classical and Connectionist Architecture.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the 3MIS Problem.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO).
Kay, R. (1989).  The Establishment of the International Computer Science Institute in Berkeley, California: Venturing with Norbert.
Gibson, G. A., Hellerstein L., Karp R. M., Katz R. H., & Patterson D. (1989).  Failure correction techniques for large disk arrays. Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III). 123-132.
Gibson, G. A., Hellerstein L., Karp R. M., Katz R. H., & Patterson D. (1989).  Failure correction techniques for large disk arrays. Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III). 123-132.
Dahlhaus, E., Karpinski M., & Novick M. B. (1989).  Fast Parallel Algorithms for the Clique Separator Decomposition.
Hellerstein, L., & Karpinski M. (1989).  Learning Read-Once Formulas Using Membership Queries.
Angluin, D., Hellerstein L., & Karpinski M. (1989).  Learning Read-Once Formulas with Queries.
Karp, R. M., Luby M., & Madras N.. (1989).  Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms. 10(3), 429-448.
Dahlhaus, E., Hajnal P., & Karpinski M. (1989).  Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs.
Karpinski, M., Dahlhaus E., & Lingas A. (1989).  A Parallel Algorithm for Maximum Matching in Planar Graphs.
Karp, R. M., & Zhang Y. (1989).  On Parallel Evaluation of Game Trees.
Karp, R. M., & Zhang Y. (1989).  On parallel evaluation of game trees. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.

Pages