Publication Search Results

Title	Author	Bibliographic	Date	Group	Links
Total Latency in Singleton Congestion Games	M. Gairing and F. Schoppmann	Proceedings of the Third International Workshop on Internet and Network Economics (WINE 2007), San Diego, California, pp. 381-387	December 2007	Algorithms
A generalization of binary search	R. M. Karp. Edited by: F. Dehne, J.R. Sack, N. Santoro, and S. Whitesides	Proceedings of the Third Workshop on Algorithms and Data Structures (WADS'93), Montreal, Quebec, Canada, pp. 27-34	August 1993	Algorithms
Idetifying Blocks and Sub-Populations in Noisy SNP Data	G. Kimmel, R. Sharan, and R. Shamir	Proceedings of the Third Workshop on Algorithms in Bioinformatics (WABI'03), pp. 303-319	2003	Algorithms
Approximation Algorithms for Data Management in Networks	C. Krick, H. Racke, and M. Westermann	Proceedings of the Thirteenth ACM Symposium on Parallel Algorithms and Architectures (SPAA) pp. 237-246, 2001.	2001	Algorithms
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas	P. Beame, R.M. Karp, T. Pitassi, and M. Saks	Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, New York, USA: ACM, 1998. p. 561-71.	May 1998	Algorithms
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees	E. Halperin, G. Kortsarz, R. Krauthgamer, A. Srinivasan, and N. Wang	Proceedings of the Twelfth Symposium on Discrete Algorithms (SODA), 275-284	2003	Algorithms
Quasirandom Rumor Spreading: An Experimental Analysis	B. Doerr, T. Friedrich, M. Künneman, and T. Sauerwald	Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX09), New York, New York, pp. 145-153	January 2009	Algorithms	[PDF]
A 1.5-Approximation Algorithm for Sorting by Transpositions and Transversals	T. Hartman and R. Sharan	Proceedings of WABI	September 05 2004	Algorithms
Topologically-Aware Overlay Construction and Server Selection	M. Handley, R.M. Karp, S. Ratnasamy, and S. Shenker	Proceedings, INFOCOM 2000.	2000	Algorithms
Efficient Information Gathering on the Internet	O. Etzioni, S. Hanks, T. Jiang, R.M. Karp, and others	Proceedings. Thirty-Seventh Annual Symposium Foundations of Computer Science, 14-16 Oct. 1996. Los Alamitos, California, USA: IEEE Comput. Soc. Press, 1996. p. 234-43.	October 1996	Algorithms
The Rank of Sparse Random Matrices Over Finite Fields	J. Blomer, R.M. Karp, and E. Welzl	Random Structures & Algorithms, July 1997, vol.10, (no.4):407-19.	July 1997	Algorithms
Bounded branching process and AND/OR tree evaluation	R. M. Karp and Y. Zhang	Random Structures & Algorithms, Vol. 7, No. 2, pp. 97-116	September 1995	Algorithms
Coalescing Times for IID Random Variables	I. Adler, H.S. Ahn, R.M. Karp, and S.M. Ross	Random Structures and Algorithms	2003	Algorithms
Computable Functions and Complexity in Neural Networks	O. Egecioglu, T.R. Smith, and J. Moody	Real Brains, Artificial Minds, J. L. Casti and A. Karlqvist, eds., Elsevier Science Publishing Co	1987	Algorithms
Algorithms for Optical Mapping	R.M. Karp and R. Shamir	RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 22-25 March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 117-24.	1998	Algorithms
Constructing Maps Using the Span and Inclusion Relations	D. Fasulo, T. Jiang, R.M. Karp, and N. Sharma	RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 64-73.	1998	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
A New Biology for the 21st Century	National Research Council of the National Academies	Report of Committee on a New Biology for the 21st Century: Ensuring the United States Leads the Coming Biology Revolution	2010	Algorithms	[PDF]
Whole-Genome Patterns of Common DNA Variation in Three Human Populations	D. A. Hinds, L. L. Stuve, G. B. Nilsen, E. Halperin, E. Eskin, D. G. Ballinger, K. A. Frazer, and D. R. Cox	Science, Vol. 307, No. 5712, pp. 1072-1079. DOI:10.1126/science.1105436	February 2005	Algorithms	[PDF]
Identifying Personal Genomes by Surname Inference	M. Gymrek, A. L. McGuire, D. Golan, E. Halperin, and Y. Erlich	Science, Vol. 339, No. 6117, pp. 321-324	January 2013	Algorithms
Load Balancing in Structured P2P Systems	A. Rao, K. Lakshminarayanan, S. Surana, R.M. Karp, and I. Stoica	Second International Workshop on Peer-to-Peer Systems	2003	Algorithms
TSP-Based Curve Reconstruction in Polynomial Time	E. Althaus and K. Melhorn	SIAM Journal of Computing 31(1), 2001.	2001	Algorithms
The Efficiency of Resolution and Davis-Putnamn Procedures	P. Beame, R. M. Karp, T. Pitassi, and M. Saks	SIAM Journal of Computing, Vol. 31, No. 4, pp. 1048-1075	2002	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
Incomplete Directed Perfect Phylogeny	I. Pe'er, T. Pupko, R. Shamir, and R. Sharan	SIAM Journal on Computing 33(3), pp. 590-607	January 05 2004	Algorithms
An Optimal Algorithm for Monte Carlo Estimation	P. Dagum, R.M. Karp, M. Luby, and S. Ross	SIAM Journal on Computing, SIAM J. Comput. (USA), vol.29, (no.5), SIAM, 2000. p.1484-96.	2000	Algorithms
On linear characterizations of combinatorial optimization problems	R. M. Karp, C.H. Papadimitriou	SIAM Journal on Computing, Vol. 11, No. 4, pp. 620-32	November 1982	Algorithms
Deferred Data Structuring	R. M. Karp, R. Motwani, and P. Raghaven	SIAM Journal on Computing, Vol. 17, No. 5, pp. 883-902	October 1988	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
A Monte-Carlo algorithm for estimating the permanent	N. Karmarkar, R. M. Karp, R. Lipton, L. Lovasz, and M. Luby	SIAM Journal on Computing, Vol. 22, No. 2, pp. 284-93	April 1993	Algorithms
A graph-theoretic game and its application to the k-server problem	N. Alon, R. M. Karp, D Peleg, and D. West	SIAM Journal on Computing, Vol. 24, No. 1, pp. 78-100	February 1995	Algorithms
When is the assignment bound tight for the asymmetric traveling-salesman problem?	A. Frieze, R. M. Karp, and B. Reed	SIAM Journal on Computing, Vol. 24, No. 3, pp. 484-93	June 1995	Algorithms
Near-optimal Solutions to a 2-dimensional Placement Problem	R. M. Karp, A.C. McKellar, and C.K. Wong	SIAM Journal on Computing, Vol. 4, No. 3, pp. 271-86	September 1975	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
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
Challenges for Theory of Computing	A. Condon, H. Edelsbrunner, E.A. Emerson, L. Fortnow, et.al.	SIGACT News, June 1999, vol.30, (no.2):62-76.	June 1999	Algorithms
Emerging Opportunities for Theoretical Computer Science	A.V. Aho, D.S. Johnson, R.M. Karp, S.R. Kosaraju, and others	SIGACT News, Sept. 1997, vol.28, (no.3):65-74.	1997	Algorithms
LogP: towards a realistic model of parallel computation	D. Culler, R.M. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken.	SIGPLAN Notices, Vol. 28, No. 7. Also in the proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, California, USA, May 1993, pp. 1-12	July 1993	Algorithms
A Gambling Game and its Application to the Analysis of Adaptive Randomized Rounding	R.M. Karp and C. Kenyon	Springer-Verlag Lecture Notes in Computer Science, Volume 2764 (RANDOM 03), 329-340	2003	Algorithms
Regularizers and Priors for Feed-Forward Networks	J. Moody and T. Rognvaldsson	Submitted for publication 2003	2003	Algorithms
Distributed Caching Independent of the Network Size	M. Westermann	Symposium on Parallel Algorithms and Archiectures, 31-40, 2002.	2002	Algorithms
A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem	E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller	Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000.	2000	Algorithms
Estimating Local Ancestry in Admixed Populations	S. Sankararaman, S. Sridhar, G. Kimmel, and E. Halperin	The American Journal of Human Genetics, Vol. 82, Issue 2, pp. 290-303	February 2008	Algorithms	[PDF]
Leveraging Genetic Variability Across Populations for the Identification of Causal Variants	N. Zaitlen, B. Pasaniuc, T. Gur, E. Zic, and E. Halperin	The American Journal of Human Genetics, Vol. 86, Issue 1, pp. 23-33	January 2010	Algorithms
On Approximating Optimal Auctions	A. Ronen	The Third ACM Conference on Electronic Commerce (EC01), 11-17, 2001.	2001	Algorithms
Computing the Similarity of Two Sequences with Nested Arc Annotations	J. Alber, J. Gramm, J. Guo, and R. Niedermeier	Theoretical Computer Science, Vol. 312, Issues 2-3, pp. 337-358	January 2004	Algorithms
Performance Aspects of Distributed Caches Using TTL-Based Consistency	E. Cohen, E. Halperin, and H. Kaplan	Theoretical Computer Science, Vol. 331, Issue 1, pp. 73-96	February 2005	Algorithms
The Minimum-Entropy Set Cover Problem	E. Halperin and R. M. Karp	Theoretical Computer Science, Vol. 348, Issue 2, pp. 240-250	December 2005	Algorithms
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]
Plateaus Can Be Harder in Multi-Objective Optimization	T. Friedrich, N. Hebbinghaus, and F. Neumann	Theoretical Computer Science, Vol. 411, Issue 6, pp. 854-864	February 2010	Algorithms	[PDF]

Pages