| Nearly Optimal Competitive Online Replacement Policies | R. El-Yaniv and R.M. Karp | Mathematics of Operations Research, Nov. 1997, vol.22, (no.4):814-39. | 1997 | Algorithms | |
| The mortgage problem | R. El-Yaniv and R. M. Karp | Proceedings of the Second Israel Symposium on Theory and Computing Systems (Cat. No. 93TH0520-7), Natanya, Israel, pp. 304-12 | June 1993 | Algorithms | |
| Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems | R. Aleliunas, R. M. Karp, R.J. Lipton, L. Lovasz, and C. Rackoff | Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science, San Juan, Puerto Rico, pp. 218-23 | October 1979 | Algorithms | |
| Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems | R. Aleliunas, R. M. Karp, R.J. Lipton, and L. Lovasz | Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, Canada, pp. 174-6 | May 1979 | Algorithms | |
| Subtree isomorphism is in random NC | P.B. Gibbons, R. M. Karp, G.L. Miller, and D. Soroker. Edited by J.H. Reif | Proceedings of the Third Aegean Workshop on Computing, VLSI Algorithms and Architectures (AWOC 88), Corfu, Greece, pp. 43-52 | July 1988 | Algorithms | |
| Subtree isomorphism is in random NC | P.B. Gibbons, R. M. Karp, G.L. Miller, and D. Soroker | Discrete Applied Mathematics, Vol. 29, No. 1, pp. 35-62 | November 1990 | Algorithms | |
| Dynamic Network Topology Changes in Functional Modules Predict Responses to Oxidative Stress in Yeast | P. V. Gopalacharyulu, V. R. Velagapudi, E. Lindfors, E. Halperin, and M. Orešič | Molecular BioSystems, Vol. 5, Issue 3, pp. 276-287 | March 2009 | Algorithms | |
| Chemokine Polymorphisms and Lymphoma: A Pooled Analysis | P. M. Bracci, C. F. Skibola, L. Conde, E. Halperin, T. Lightfoot, A. Smith, R. A. Paynter, D. R. Skibola, L. Agana, E. Roman, E. Kane, and J. K. Wiencke | Leukemia and Lymphoma, Vol. 51, No. 3, pp. 497-506 | March 2010 | Algorithms | |
| Transitive Compaction in Parallel via Branchings | P. Gibbons, R. M. Karp, V. Ramachandran, D. Soroker, and R. Tarjan | Journal of Algorithms, Vol. 12, No. 1, pp. 110-25 | March 1991 | 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 | |
| An optimal algorithm for Monte Carlo estimation | P. Dagum, R. M. Karp, M. Luby, and S. Ross | Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, Wisconsin, pp. 142-9 | October 1995 | Algorithms | |
| On the Price of Heterogeneity in Parallel Systems | P. Brighten Godfrey and R. M. Karp | Theory of Computing Systems, Vol. 45, No. 2, pp. 280-301 | August 2009 | Algorithms | [PDF]
|
| Speeding Up Random Walks with Neighborhood Exploration | P. Berenbrink, C. Cooper, R. Elsaesser, T. Radzik, and T. Sauerwald | Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, pp. 1422-1435 | January 2010 | Algorithms | [PDF]
|
| The Weighted Coupon Collector's Problem and Applications | P. Berenbrink and T. Sauerwald | Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009), Niagra Falls, New York, pp. 449-458 | July 2009 | 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 | |
| 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 | |
| Fast and Intuitive Clustering of Web Documents | O. Zamir, O. Etzioni, O. Madani, and R.M. Karp | Proceedings of the Third International Conference on Knowledge Discovery and Data Mining. 14-17 Aug. 1997. Edited by: Heckerman, D.; Mannila, H.; Pregibon, D.; Uthurusamy, R. Menlo Park, CA, USA: AAAI Press, 1997. p. 287-90. | August 1997 | Algorithms | |
| Probabilistic Inference of Viral Quasispecies Subject to Recombination | O. Zagordi, A. Topfer, S. Prabhakaran, V. Roth, E. Halperin, and N. Beerenwinkel | Proceedings of the 16th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2012), Barcelona, Spain, pp.342-354 | April 2012 | Algorithms | [PDF]
|
| Power Prediction in Smart Grids with Evolutionary Local Kernel Regression | O. Kramer, B. Satzger, and J. Laessig | Proceedings of the Fifth International Conference on Hybrid Artificial Intelligence Systems (HAIS 2010), San Sebastian, Spain, pp. 262-269 | June 2010 | Algorithms | [PDF]
|
| Managing Energy in a Virtual Power Plant Using Learning Classifier Systems | O. Kramer, B. Satzger, and J. Laessig | Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods (GEM 2010), Las Vegas, Nevada | July 2010 | Algorithms | [PDF]
|
| DBSCAN-Based Multi-Objective Niching to Approximate Equivalent Pareto-Subsets | O. Kramer and H. Danielsiek | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), Portland, Oregon, pp. 503-510 | July 2010 | Algorithms | [PDF]
|
| Short-Term Wind Energy Forecasting Using Support Vector Regression | O. Kramer and F. Gieseke | Proceedings of the International Conference on Soft Computing Models in Industrial and Environmental Applications (SoCo), Salamanca, Spain | April 2011 | Algorithms | [PDF]
|
| Machine Symbol Grounding and Optimization | O. Kramer | Proceedings of the Third International Conference on Agents and Artificial Intelligence (ICAART 2011), Rome, Italy | January 2011 | Algorithms | [PDF]
|
| 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 | |
| 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 | |
| Increasing the Power of Association Studies by Imputation-Based Sparse Tag SNP Selection | O. Davidovich, G. Kimmel, E. Halperin, and R. M. Shamir | Communications in information and Systems, Vol. 9, No. 3, pp. 269-282 | September 2009 | Algorithms | [PDF]
|
| 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]
|
| Inference and Analysis of Haplotypes from Combined Genotyping Studies Deposited in dbSNP | N.A. Zaitlen, H.M. Kang, M.L. Feolo, S.T. Sherry, E. Halperin, and E. Eskin | Genome Research, Vol. 15, No. 11, pp.1594-1600 | October 2005 | Algorithms | |
| Leveraging the HapMap Correlation Structure in Association Studies | N. Zaitlen, H. M. Kang, E. Eskin, and E. Halperin | American Journal of Human Genetics, Vol. 80, Issue 4, pp. 683-691 | April 2007 | 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 | |
| Prediction of Phenotype Information from Genotype Data | N. Yosef, J. Gramm, Q.-F. Wang, W. S. Noble, R. M. Karp, and R. Sharan | Communications in Information and Systems, Vol. 10, No. 2, pp. 99-114 | May 2010 | 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 | |
| An efficient approximation scheme for the one-dimensional bin-packing problem | N. Karmarkar and R.M. Karp | Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, pp. 312-20 | November 1982 | 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 | |
| R. M. Karp and M. Luby | Monte-Carlo algorithms for enumeration and reliability problems | Proceedings of the 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona. Also in IEEE Computer Society Press, Silver Spring, Maryland, pp. 56-64 | November 1983 | Algorithms | |
| Reinforcement Learning for Trading, Advances in Neural Information Processing Systems 11 | M.S. Kearns, S.A. Solla, and D.A. Cohn, eds. | MIT Press, Cambridge, Massachusetts 1999. | 1999 | Algorithms | |
| Faster and More Accurate Sequence Alignment with SNAP | M. Zaharia, W. J. Bolosky, K. Curtis, A. Fox, D. Patterson, S. Shenker, I. Stoica, R. M. Karp, and T. Sittler | arXiv.org under arXiv:1111.5572v1 | November 2011 | Algorithms | [PDF]
|
| Distributed Caching Independent of the Network Size | M. Westermann | Symposium on Parallel Algorithms and Archiectures, 31-40, 2002. | 2002 | Algorithms | |
| Knowledge Discovery for Time Series | M. Saffell | Ph.D. Thesis, OGI School of Science and Engineering, Oregon Health and Science University | September 2005 | Algorithms | |
| Design of the Coronary Artery Disease Genome-Wide Replication and Meta-Analysis (CARDIoGRAM) Study--A Genome-Wide Association Meta-Analysis Involving More than 22,000 Cases and 60,000 Controls | M. Preuss, I. R. Koenig, J. R. Thompson, J. Erdmann, D. Absher, T. L. Assimes, S. Blankenberg, E. Boerwinkle, L. Chen, L. A. Cupples, A. S. Hall, E. Halperin, et al. | Circulation: Cardiovascular Genetics, Vol. 3, pp. 475-483 | October 2010 | Algorithms | |
| On the Reducibility of Sets Inside with Low Information Content | M. Ogihara and T. Tantau | In JCSS | January 05 2004 | Algorithms | |
| Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm | M. Narayanan and R. M. Karp | Journal of Computational Biology, Vol. 14, Issue 7, pp. 892-907 | September 2007 | Algorithms | [PDF]
|
| Review of F. V. Fomin and D. Kratsch, "Exact Exponential Algorithms" | M. Mnich | Operations Research Letters, Vol. 39, No. 3, pp. 229-230 | May 2011 | Algorithms | |
| A Randomized, O(log w)-Depth 2-Smoothing Network | M. Mavronicolas and T. Sauerwald | Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2009), Calgary, Canada, pp. 178-187 | August 2009 | Algorithms | [PDF]
|
| Recognition of Manual Motions with Dimension Reduction and Dynamic Time Warping | M. Martin, J. Maycock, F. Schmidt, and O. Kramer | Proceedings of the Fifth International Conference on Hybrid Artificial Intelligence Systems (HAIS 2010), San Sebastian, Spain, Vol. 1, pp. 221-228 | June 2010 | Algorithms | |
| A Comparison of Tight Generalization Error Bounds | M. Kaariainen and J. Langford | Proceedings of the 22nd International Conference on Machine Learning (ICML 2005), Bonn, Germany, pp. 409-416 | August 2005 | Algorithms | |
| Lower Bounds for Reductions | M. Kaariainen and J. Langford | Presented at the Atomic Learning Workshop, Chicago, Illinois | March 2006 | Algorithms | |
| Generalization Error Bounds Using Unlabeled Data | M. Kaariainen | Proceedings of the 18th Annual Conference on Learning Theory (COLT 2005), Bertinoro, Italy, pp. 127-142 | June 2005 | Algorithms | |
| On Active Learning in the Non-Realizable Case | M. Kaariainen | Proceedings of the Foundations of Active Learning Workshop at the 19th Annual Conference on Neural Information Processing Systems (NIPS), Vancouver, Canada | December 2005 | Algorithms | |
| Topologically-Aware Overlay Construction and Server Selection | M. Handley, R.M. Karp, S. Ratnasamy, and S. Shenker | Proceedings, INFOCOM 2000. | 2000 | Algorithms | |
