Publications

Found 1144 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Last Name is K  [Clear All Filters]
1986
Floyd, S., & Karp R. M. (1986).  FED bin packing for item sizes with distributions on (0,1/2). Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 322-330.
Karp, R. M., Saks M., & Wigderson A. (1986).  On a Search Problem Related to Branch-and-Bound Procedures. Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 19-28.
1987
Karp, R. M., & Rabin M.. O. (1987).  Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development. 31(2), 249-260.
Karp, R. M., F. Leighton T., Rivest R. L., Thomborson C. David, Vazirani U. V., & Vazirani V. V. (1987).  Global wire routing in two-dimensional arrays. 2(1), 113-129.
Adler, I., Karp R. M., & Shamir R. (1987).  A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps. Journal of Complexity. 3(4), 372-387.
1988
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing. 225-253.
Karp, R. M., Upfal E., & Wigderson A. (1988).  The Complexity of Parallel Search. Journal of Computer and System Sciences. 36,
Karp, R. M., Motwani R., & Raghaven P.. (1988).  Deferred Data Structuring. SIAM Journal on Computing. 17(5), 883-902.
Blum, M. E., & Kannan S. (1988).  Program Correctness Checking and the Design of Programs That Check Their Work.
Karp, R. M., & Zhang Y. (1988).  A randomized parallel branch-and-bound procedure. Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 290-300.
Fillmore, C. J., Kay P., & O'Connor M. Catherine (1988).  Regularity and Idiomaticity in Grammatical Constructions: The Case of Let Alone. Language. 64(3), 501-538.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1988).  Subtree isomorphism is in random NC. Proceedings of the Third Aegean Workshop on Computing, VLSI Algorithms and Architectures (AWOC 88). 43-52.
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.

Pages