Publication Search Results

Title	Author	Bibliographic	Date	Group	Links
Randomized parallel algorithms for backtrack search and branch-and-bound computation	R. M. Karp and Y. Zhang	Journal of the Association for Computing Machinery, Vol. 40, No.3, pp. 765-89	July 1993	Algorithms
On parallel evaluation of game trees	R. M. Karp and Y. Zhang	Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89), Santa Fe, New Mexico, pp. 409-20	June 1989	Algorithms
A randomized parallel branch-and-bound procedure	R. M. Karp and Y. Zhang	Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, pp. 290-300	May 1988	Algorithms
Two Special Cases of the Assignment Problem	R. M. Karp and S. Li	Discrete Mathematics (Netherlands), Vol. 13, No. 2, pp. 129-42	October 1975	Algorithms
Noisy Binary Search	R. M. Karp and R. Kleinberg	Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, pp. 881-890	January 2007	Algorithms
Efficient randomized pattern-matching algorithms	R. M. Karp and M.O. Rabin	IBM Journal of Research and Development, Vol. 31, No. 2, pp. 249-60	March 1987	Algorithms
Maximum matchings in sparse random graphs	R. M. Karp and M. Sipser	Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, pp. 364-75	October 1981	Algorithms
Monte-Carlo algorithms for the planar multiterminal network reliability problem	R. M. Karp and M. Luby	Journal of Complexity, Vol. 1, No. 1. Also in the Proceedings of the Symposium on the Complexity of Approximately Solved Problems, New York, New York, pp. 45-64, April 1985	October 1985	Algorithms
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs	R. M. Karp and J.E. Hopcroft	SIAM Journal on Computing, Vol. 2, No. 4, pp. 225-31	December 1973	Algorithms
Parametric Shortest Path Algorithms with an Application to Cyclic Staffing	R. M. Karp and J.B. Orlin	Discrete Applied Mathematics (Netherlands), Vol. 3, No. 1, pp. 37-45	February 1981	Algorithms
Searching for an optimal path in a tree with random costs	R. M. Karp and J. Pearl	Artificial Intelligence, Vol. 21, No.1-2, pp. 99-116	March 1983	Algorithms
Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs	R. M. Karp and D.W. Matula	Bulletin of the Operations Research Society of America, Vol. 23, supplement 2. Also in the proceedings of the ORSA/TIMS National Meeting (Abstracts only), Las Vegas, Nevada, pp. B264	1975	Algorithms
On the Optimality of Huffman Trees	R. M. Karp and C.R. Glassey	SIAM Journal on Applied Mathematics, Vol. 31, No. 2, pp. 368-78	September 1976	Algorithms
On the Optimality of Huffman Trees	R. M. Karp and C.R. Glassey	Report number ORC-74-21, University of California, Berkeley, California	June 1974	Algorithms
On Linear Characterizations of Combinatorial Optimization Problems	R. M. Karp and C.H. Papadimitriou	Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, Syracuse, New York, pp. 1-9	October 1980	Algorithms
A fast parallel algorithm for the maximal independent set problem	R. M. Karp and A. Wigderson	Journal of the Association for Computing Machinery, Vol. 32, No. 4, pp. 762-73	October 1985	Algorithms
Mathematical Challenges from Genomics and Molecular Biology	R. M. Karp	Notices of the American Mathematical Society, Vol. 49, No. 5, pp. 544-553	2002	Algorithms
Modeling parallel communication	R. M. Karp	Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95), Santa Barbara, California, p. 2	April 1995	Algorithms
Probabilistic recurrence relations	R. M. Karp	Journal of the Association for Computing Machinery, Vol. 41, No. 6, pp. 1136-50	November 1994	Algorithms
Mapping the Genome: some combinatorial problems arising in molecular biology	R. M. Karp	Proceedings of 25th Annual Symposium on the Theory of Computing, San Diego, California, pp. 278-85	May 1993	Algorithms
On-line algorithms versus off-line algorithms: how much is it worth to know the future?	R. M. Karp	Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Madrid, Spain, pp. 416-29	1992	Algorithms
An introduction to randomized algorithms	R. M. Karp	Discrete Applied Mathematics, Vol. 34, No. 1-3. Also in the proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, D.C., pp. 165-201	November 21 1991	Algorithms
Combinatorics, Complexity and Stochastic Algorithms	R. M. Karp	Informatie, Vol. 28, No. 9, pp. 722-33	September 1986	Algorithms
Combinatorics, Complexity, and Randomness	R. M. Karp	Communications of the ACM, Vol. 29, No. 2, pp. 98-109	February 1986	Algorithms
The complexity of parallel computation	R. M. Karp	Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, p. 1	October 1985	Algorithms
Dynamic programming meets the principle of inclusion and exclusion	R. M. Karp	Operations Research Letters, Vol. 1, No. 2, pp. 49-51	April 1982	Algorithms
An Algorithm to Solve the mn Assignment Problem in Expected Time O(mn log n)	R. M. Karp	Networks, Vol. 10, No. 2, pp. 143-52	1980	Algorithms
A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem	R. M. Karp	SIAM Journal on Computing, Vol. 8, No. 4, pp. 561-73	November 1979	Algorithms
Probabilistic Analysis of Graph-theoretic Algorithms	R. M. Karp	Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, pp. 173	May 1979	Algorithms
A Characterization of the Minimum Cycle Mean in a Digraph	R. M. Karp	Discrete Mathematics (Netherlands), Vol. 23, No. 3, pp. 309-11	September 1978	Algorithms
Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane	R. M. Karp	Mathematics of Operations Research, Vol. 2, No. 3, pp. 209-24	August 1977	Algorithms
On the Computational Complexity of Combinatorial Problems	R. M. Karp	Networks, Vol. 5, No.1. Also in the Proceedings of the Symposium on Large-Scale Networks, Evanston, Illinois, pp. 45-68, April 1974	January 1975	Algorithms
Fair Bandwidth Allocation Without Per-Flow State	R. M. Karp	In Essays in Theoretical Computer Science in Memory of Shimon Even, O. Goldreich, A. L. Rosenberg, and A. L. Selman, eds., pp. 88-110, Springer	2006	Algorithms
Optimization Problems Related to Internet Congestion Control	R. M. Karp	Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications, M.C. Golumbic and I.B.-A. Hartman, eds., Springer-Verlag, New York	2005	Algorithms
George Dantzig's Impact on the Theory of Computation	R. M. Karp	Discrete Optimization, Vol. 5, Issue 2, pp. 174-185	May 2006	Algorithms
Report of the SIGACT Committee on funding for Theoretical Computer Science	R. M. Karp	SIGACT (Special Interest Group on Algorithms and Computation Theory) News	December 2005	Algorithms
Implicit Hitting Set Problems and Multi-Genome Alignment	R. M. Karp	Keynote speech at the 21st Annual Symposium on Combinatorial Pattern Matching (CPM2010), New York, New York	June 2010	Algorithms
Streaming Algorithms for Selection and Approximate Sorting	R. M. Karp	Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, pp. 9-20	December 2007	Algorithms
Heuristic Algorithms in Computations Molecular Biology	R. M. Karp	Journal of Computer and System Sciences, Special Issue: Celebrating Karp's Kyoto Prize, Vol. 77, No. 1, pp. 122-128	January 2011	Algorithms
Effective Heuristics for NP-Hard Problems	R. M. Karp	Presented at the Michael Rabin Celebration, Cambridge, Massachusetts	August 2011	Algorithms
Advances in Neural Information Processing Systems 3	R. Lippmann, J. Moody, and D. Touretzky, eds.	Morgan Kaufmann, Palo Alto	1991	Algorithms
The Intrinsic Dimensionality of Graphs	R. Krauthgamer and J.R. Lee	Manuscript, 2002.	2002	Algorithms
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities	R. Karp, T. Nierhoff, and T. Tantau	Proceedings of the Second Brazilian Symposium of Graphs, Algorithms, and Combinatorics (GRACO 2005), Angra dos Reis, Brazil, pp. 225-231	July 2005	Algorithms	[PDF]
Understanding Science Through the Lens of Computation	R. Karp	Presented at the Symposium on Transformational Information Engineering and Science, Singapore	January 2010	Algorithms
Three Combinatorial Problems in Computational and Genomic Biology	R. Karp	IFORS Distinguished Lecture at the Joint International Meeting of the Canadian Operational Research Society and the Institute for Operations Research and the Management Sciences (CORS-INFORMS International), Toronto, Canada	June 2009	Algorithms
Theory of Computation as an Enabling Tool for the Sciences	R. Karp	Presented at the Turing Centennial Celebration, Princeton, New Jersey. Also presented at the 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012), Turing Centenary Meeting, Beijing, China	May 2012	Algorithms
Tight Bounds for the Cover Time of Multiple Random Walks	R. Elsässer and T. Sauerwald	Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 415-426	July 2009	Algorithms	[PDF]
On the Runtime and Robustness of Randomized Broadcasting	R. Elsässer and T. Sauerwald	Theoretical Computer Science, Vol. 410, Issue 36, pp. 3414-3427	August 2009	Algorithms	[PDF]
Genome-Wide In-silico Determination of Transcriptional Regulation Modules Controlling Cell Cycle in Human Cells	R. Elkon, C. Linhart, R. Sharan, R. Shamir, and Y. Shiloh	Genome Research, 13, pp. 773-780	2003	Algorithms
Competitive analysis of financial games	R. El-Yaniv, A. Fiat, R. M. Karp, and G. Turpin	Proceedings 33rd Annual Symposium on Foundations of Computer Science (Cat. No. 92CH3188-0), Pittsburgh, Pennsylvania, pp. 327-33	October 1992	Algorithms

Pages