| Discovery of Regulatory Interactions Through Perturbation: Inference and Experimental Design | T.E. Ideker, V. Thorsson, and R.M. Karp | Proceedings of Pacific Symposium on Biocomputing (PSB 2000), Oahu, Hawaii, pp. 302-313 | January 2000 | Algorithms | [PDF]
|
| Predicting the U.S. Index of Industrial Production | J. Moody, A. Levin, and S. Rehfuss | Proceedings of Parallel Applications in Statistics and Economics '93, M. Novak (ed), special issue of Neural Network World, Vol. 3, No. 6, pp. 791-794 | 1993 | Algorithms | |
| Multiplexing Schemes for Generic SNP Genotyping Assays | R. Sharan, A. Ben-Dor, and Z. Yakhini | Proceedings of PSB'04, pp. 140-151 | January 05 2004 | Algorithms | |
| Universal DNA Tag Systems: A Combinatorial Design Scheme | A. Ben-Dor, R. Karp, B. Schwikowski, and Z. Yakhini | Proceedings of RECOMB 2000. | 2000 | Algorithms | |
| A Discriminative Model for Identifying Spatial Cis-Regulatory Modules | E. Segal and R. Sharan | Proceedings of RECOMB 2004, pp. 141-149; also submitted to Journal of Computational Biology | January 05 2004 | Algorithms | |
| Avoiding Forbidden Submatrices by Row Deletions | S. Wernicke, J. Alber, J. Gramm, J. Guo, and R. Niedermeier | Proceedings of SOFSEM 04, LNCS, Vol. 2832, pp. 349-360, Springer | January 05 2004 | Algorithms | |
| A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number | T. Tantau | Proceedings of STACS 2004, Lecture Notes on Computer Science, Springer-Verlag | January 05 2004 | Algorithms | |
| Don’t Be Greedy When Calculating Hypervolume Contributions. | K. Bringmann and T. Friedrich. | Proceedings of the 10th Foundations of Genetic Algorithms Workshop (FOGA X), Orlando, Florida, pp. 103-112 | January 2009 | Algorithms | [PDF]
|
| Computing Single Source Shortest Paths Using Single-Objective Fitness Functions | S. Baswana, S. Biswas, DB. Doerr, T. Friedrich, P. Kurur, and F. Neumann | Proceedings of the 10th Foundations of Genetic Algorithms Workshop (FOGA X), Orlando, Florida, pp. 59-66 | January 2009 | Algorithms | [PDF]
|
| Haplotypes versus Genotypes on Pedigrees | B. Kirkpatrick | Proceedings of the 10th Workshop on Algorithms in Bioinformatics (WABI 2010), Liverpool, United Kingdom, pp. 136-147 | September 2010 | Algorithms | [PDF]
|
| An Efficient and Accurate Graph-based Approach to Detect Population Substructure | S. Sridhar, S. Rao, and E. Halperin | Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2007), Oakland, California, pp. 503-517 | April 2007 | Algorithms | [PDF]
|
| Using Markov-Chain Mixing Time Estimates for the Analysis of Ant Colony Optimization | D. Sudholt | Proceedings of the 11th Foundations of Genetic Algorithms Workshop (FOGA XI), pp. 139-150, Schwarzenberg, Austria | January 2011 | Algorithms | [PDF]
|
| Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms | J. Laessig and D. Sudholt | Proceedings of the 11th Foundations of Genetic Algorithms Workshop (FOGA XI), pp. 181-192, Schwarzenberg, Austria | January 2011 | Algorithms | [PDF]
|
| Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions | T. Koetzing, F. Neumann, D. Sudholt, and M. Wagner | Proceedings of the 11th Foundations of Genetic Algorithms Workshop (FOGA XI), pp. 209-218, Schwarzenberg, Austria | January 2011 | Algorithms | [PDF]
|
| Detecting Protein Sequences via Metric Embeddings | E. Halperin, J. Buhler, R. M. Karp, R. Krauthgamer, and B. Westover | Proceedings of the 11th International Conference on Intelligent Systems for Molecular Biology (ISMB), pp. 122-129 | 2003 | Algorithms | |
| General Lower Bounds for the Running Time of Evolutionary Algorithms | D. Sudholt | Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), Krakow, Poland, pp. 124-133 | September 2010 | Algorithms | [PDF]
|
| Experimental Supplements to the Theoretical Analysis of Migration in the Island Model | J. Laessig and D. Sudholt | Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), Krakow, Poland, pp. 224-233 | September 2010 | Algorithms | |
| General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms | J. Laessig and D. Sudholt | Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), Krakow, Poland, pp. 234-243 | September 2010 | Algorithms | |
| Optimizing Monotone Functions Can Be DifficultOptimizing Monotone Functions Can Be Difficult | B. Doerr, T. Jansen, D. Sudholt, C. Winzen, and C. Zarges | Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), Krakow, Poland, pp. 42-51 | September 2010 | Algorithms | |
| Efficiently Solvable Perfect Phylogeny Problems on Binary and k-State Data with Missing Values | K. Stephens and B. Kirkpatrick | Proceedings of the 11th Workshop on Algorithms in Bioinformatics (WABI 2011), Saarbrücken, Germany | September 2011 | Algorithms | |
| New Approaches to Enterprise Cooperation Generation and Management | J. Laessig and U. Trommler | Proceedings of the 12th International Conference on Enterprise Information Systems (ICEIS 2010), Funchal, Portugal | June 2010 | Algorithms | |
| Tag SNP Selection in Genotype Data for Maximizing SNP Prediction Accuracy | E. Halperin, G. Kimmel, and R. Shamir | Proceedings of the 13th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 2005), Detroit, Michigan, pp. 195-203 | June 2005 | Algorithms | [PDF]
|
| Torque: Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Hüffner, R. M. Karp, R. Shamir, and R. Sharan | Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2009), Tucson, Arizona, pp. 74-89 | May 2009 | Algorithms | |
| Haplotype Inference in Complex Pedigrees | B. Kirkpatrick, J. Rosa, E. Halperin, and R. M. Karp | Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology (RECOMB2009), Tucson, Arizona, pp. 108-120 | May 2009 | Algorithms | [PDF]
|
| A Computational Model of Tractable Reasoning -- Taking Inspiration from Cognition | L. Shastri | Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 93), France, pp. 202-207 | 1993 | Algorithms | |
| Pedigree Reconstruction Using Identity by Descent | B. Kirkpatrick, S. C. Li, R. M. Karp, and E. Halperin | Proceedings of the 15th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2011),Vancouver, British Columbia, Canada, pp. 136-152. Also appeared in Journal of Computational Biology, Vol. 18, No. 11, pp. 1481-1493, November 2011. | March 2011 | 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 | |
| Reconstructing Boolean Models of Signaling | R. Sharan and R. M. Karp | Proceedings of the 16th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2012), Barcelona, Spain, pp. 261-271 | April 2012 | Algorithms | |
| CNVeM: Copy Number Variation Detection Using Uncertainty of Read Mapping | Z. Wang, F. Hormozdiari, W.-Y. Yang, E. Halperin, and E. Eskin | Proceedings of the 16th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2012), Barcelona, Spain, pp. 326-340 | April 2012 | 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]
|
| Inference of Locus-Specific Ancestry in Closely Related Populations | B. Pasaniuc, S. Sankararaman, G. Kimmel, and E. Halperin | Proceedings of the 17th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB) and the 8th European Conference on Computational Biology (ECCB), Stockholm, Sweden. In Bioinformatics, Vol. 25, No. 12, pp. 213-221 | June 2009 | Algorithms | [PDF]
|
| 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 | |
| Feature Selection for High-Dimensional Genomic Microarray Data | E. P. Xing, M. I. Jordan, and R. M. Karp | Proceedings of the 18th International Conference on Machine Learning (ICML 2001), Williamstown, Massachusetts, pp. 601-608 | June 2001 | Algorithms | [PDF]
|
| Learning with Localized Receptive Fields | J. Moody and C. Darken | Proceedings of the 1988 Connectionist Models Summer School, Hinton, Sejnowski, and Touretzsky, eds. Morgan Kaufmann, pp. 133-143 | 1988 | 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 | |
| Variations on the Theme of "Twenty Questions" | R.M. Karp | Proceedings of the 1998 IEEE International Symposium on Information Theory, Aug. 1998. New York, NY, USA: IEEE, 1998. p. 3. | August 1998 | Algorithms | |
| Stochastic Direct Reinforcement: Application to Simple Games with Recurrence | J. Moody, Y. Liu, M. Saffell, and K. Youn | Proceedings of the 2004 AAAI Fall Symposium on Artificial Multiagent Learning, Arlington, Virginia, pp. 23-34 | October 2004 | Algorithms | [PDF]
|
| Adaptive Heuristic Estimates for Automated Planning Using Regression | B. Satzger, O. Kramer, and J. Laessig | Proceedings of the 2010 International Conference on Artificial Intelligence, p. 576-581, Las Vegas, Nevada | July 2010 | Algorithms | |
| 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]
|
| 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 | |
| Sorting and Selection in Posets | C. Daskalakis, R. M. Karp, E. Mossel, S. Riesenfeld, and E. Verbin | Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, New York, pp. 392-401 | January 2009 | Algorithms | [PDF]
|
| 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 | |
| Scheduling parallel communication: the h-relation problem | M. Adler, J.W. Byers, and R. M. Karp | Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). Edited by: Wiedermann, J.; Hajek, P. Berlin, Germany: Springer-Verlag, pp. 1-20 | August 1995 | 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]
|
| 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 | |
| Analysis of an Iterated Local Search Algorithm for Vertex Coloring | D. Sudholt and C. Zarges | Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), Jeju Island, Korea | December 2010 | Algorithms | |
| An optimal algorithm for on-line bipartite matching | R. M. Karp, U.V. Vazirani, and V.V. Vazirani | Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland | May 1990 | Algorithms | |
| On the power of randomization in online algorithms | S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson | Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pp. 379-86 | May 1990 | 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 | |
| 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 | |
