| Efficient PRAM Simulation on a Distributed Memory Machine | R.M. Karp, M. Luby, and F. Meyer auf der Heide | Algorithmica, Vol. 16, No. 4-5, pp. 517-42 | October 1996 | Algorithms | |
| A Simple Algorithm for Finding Frequent Elements in Streams and Bags | R.M. Karp, S. Shenker, and C.H. Papadimitriou | Transactions on Database Systems | 2003 | Algorithms | |
| 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]
|
| On the power of randomization in on-line algorithms | S. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. Wigderson | Algorithmica, Vol. 11, No. 1, pp. 2-14 | January 1994 | 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 | |
| Torque: Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Hueffner, R. M. Karp, R. Shamir, and R. Sharan | Nucleic Acids Research, Vol. 37, pp. 106-108 | July 2009 | Algorithms | [PDF]
|
| Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Huffner, R. M. Karp, R. Shamir, and R. Sharan | Journal of Computational Biology, Vol. 17, Issue 3, pp. 237-252 | March 2010 | 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 | |
| Torque: Topology-Free Querying of Protein Interaction Networks | S. Bruckner, F. Hüffner, R. M. Karp, R. Shamir, and R. Sharan | Journal of Computational Biology, Vol. 17, Issue 3, pp. 237-252 | March 2010 | Algorithms | |
| FFD bin packing for item sizes with uniform distributions on (0, 1/2) | S. Floyd and R. M. Karp | Algorithmica, Vol. 6, No. 2, pp. 222-40 | 1991 | Algorithms | |
| FED bin packing for item sizes with distributions on (0,1/2) | S. Floyd and R. M. Karp | Proceedings of the 27th Annual Symposium on Foundations of Computer Science (Cat. No. 86CH2354-9), Toronto, Ontario, Canada, pp. 322-30 | October 1986 | Algorithms | |
| Common Variation at 6p21.31 (BAK1) Influences the Risk of Chronic Lymphocytic Leukemia | S. L. Slager, C. F. Skibola,..., E. Halperin, et al. | Blood, Vol. 120, No. 4, pp. 843-846 | July 2012 | Algorithms | |
| Trading with Committees: A Comparative Study | S. Rehfuss, L. Wu, and J. Moody | Proceedings of the Third International Conference on Neural Networks in the Capital Markets, London, United Kingdom | October 1996 | Algorithms | |
| On the Inference of Ancestries in Admixed Populations | S. Sankararaman, G. Kimmel, E. Halperin and M. I. Jordan | Genome Research, Vol 18, Issue 4, pp. 668-675 | April 2008 | Algorithms | [PDF]
|
| Genomic Privacy and Limits of Individual Detection in a Pool | S. Sankararaman, G. Obozinski, M. I. Jordan, and E. Halperin | Nature Genetics, Vol. 41, No. 9, pp. 965-967 | September 2009 | Algorithms | [PDF]
|
| Genomic Privacy and Limits of Individual Detection in a Pool | S. Sankararaman, G. Obozinski, M. I. Jordan, and E. Halperin | Presented at the 18th Annual International Conference on Intelligent Systems for Molecular Biology (ISMB 2010), Boston, Massachusetts | July 2010 | Algorithms | |
| LAMP: Local Ancestry in adMixed Populations | S. Sankararaman, S. Sridhar, G. Kimmel, and E. Halperin | American Journal of Human Genetics, Vol. 82, Issue 2, American Society of Human Genetics, pp. 290-303 | February 2008 | 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]
|
| 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]
|
| E-QED: An Efficient Method for Interpreting eQTL Associations Using Protein Networks | S. Suthram, A. Beyer, R. M. Karp, Y. Eldar, and T. Ideker | Molecular Systems Biology, Vol. 4 | March 2008 | Algorithms | |
| Comparative Study of Different Approaches to Particle Swarm Optimization in Theory and Practice | S. Thiem and J. Laessig | In Particle Swarm Optimization: Theory, Techniques and Applications, A. E. Olsson, ed., Nova Science Publishers, ISBN: 978-1-61668-527-0 | 2010 | 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 | |
| When to Use Bit-Wise Neutrality | T. Friedrich and F. Neumann | Natural Computing, Vol. 9, No. 1, pp. 283-294 | March 2010 | Algorithms | [PDF]
|
| Average Update Times for Fully-Dynamic All-Pairs Shortest Paths | T. Friedrich and N. Hebbinghaus | Proceedings of International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, pp. 693-704 | December 2008 | Algorithms | [PDF]
|
| Near-Perfect Load Balancing by Randomized Rounding | T. Friedrich and T. Sauerwald | Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, pp. 121-130 | May 2009 | Algorithms | [PDF]
|
| Multiplicative Approximations and the Hypervolume Indicator | T. Friedrich, C. Horoba, and F. Neumann | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2009), Montreal, Canada, pp. 571-578 | July 2009 | Algorithms | [PDF]
|
| Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models | T. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C. Witt | Evolutionary Computation, Vol. 18, No. 4, pp. 617-633, Winter 2010 | December 2010 | Algorithms | [PDF]
|
| Quasirandom Load Balancing | T. Friedrich, M. Gairing, and T. Sauerwald | Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, pp. 1620-1629 | January 2010 | 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]
|
| Analysis of Diversity-Preserving Mechanisms for Global Exploration | T. Friedrich, P. S. Oliveto, D. Sudholt, and C. Witt | Evolutionary Computation, Vol. 17, Issue 4, pp. 455-476, Winter 2009 | December 2009 | Algorithms | [PDF]
|
| Smoothed Analysis of Balancing Networks | T. Friedrich, T. Sauerwald, and D. Vilenchik | Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 472-483 | July 2009 | Algorithms | [PDF]
|
| Smoothed Analysis of Balancing Networks | T. Friedrich, T. Sauerwald, and D. Vilenchik | In Random Structures and Algorithms, Vol. 39, No. 1, pp. 115-138, DOI: 10.1002/rsa.20341 | August 2010 | Algorithms | |
| A 1.5-Approximation Algorithm for Sorting by Transpositions and Transversals | T. Hartman and R. Sharan | Proceedings of WABI | September 05 2004 | Algorithms | |
| Recognition and Visualization of Music Sequences Using Self-Organizing Feature Maps | T. Hein and O. Kramer | Proceedings of the 33rd Annual German Conference on AI: Advances in Artificial Intelligence (KI 2010), Kralsruhe, Germany, pp. 160-167 | September 2010 | Algorithms | |
| Analysis of an Asymmetric Mutation Operator | T. Jansen and D. Sudholt | Evolutionary Computation, Vol. 18, No. 1, pp. 1-26 | January 2010 | Algorithms | |
| Mapping Clones with a Given Ordering or Interleaving | T. Jiang and R.M. Karp | Algorithmica, July 1998, vol.21, (no.3):262-84. | 1998 | Algorithms | |
| Mapping Clones with a Given Ordering or Interleaving | T. Jiang and R.M. Karp | Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Jan. 1997. New York, NY, USA: ACM, 1997. p. 400-9. | January 1997 | Algorithms | |
| 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]
|
| Stochastic Manhattan Learning: Time-Evolution Operator for the Ensemble Dynamics | T. Leen and J. Moody | Physical Review E, 1997. | 1997 | Algorithms | |
| Detecting Excess Radical Replacements in Phylogenetic Trees | T. Pupko, R. Sharan, M. Hasegawa, R. Shamir, and D. Graur | Gene, 319, pp. 127-135 | 2003 | Algorithms | |
| On Mixing and Edge Expansion Properties in Randomized Broadcasting | T. Sauerwald | Algorithmica, Vol. 56, No. 1, pp. 51-88 | January 2010 | Algorithms | |
| A Self-Stabilizing Algorithm for Cut Problems in Synchronous Networks | T. Sauerwald and D. Sudholt | Theoretical Computer Science, Vol. 411, Issues 14-15, pp. 1599-1612 | March 2010 | Algorithms | |
| Comparing Verboseness for Finite Automata and Turing Machines | T. Tantau | Theory of Computing Systems, Vol. 31, No. 1, pp. 95-109 | 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 | |
| Partitioning Biological Data with Transitivity Clustering | T. Wittkop, D. Emig, S. J. Lange, S. Rahmann, M. Albrecht, J. H. Morris, S. Boecker, J. Stoye, and J. Baumbach | Nature Methods, Vol. 7, Issue 6, pp. 419-420 | June 2010 | Algorithms | |
| 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]
|
| Weight-Space Probability Densities and Equilibria in Stochastic Learning | T.K. Leen and J. Moody | Advances in Neural Information Processing Systems 5, Hanson, Cowan, and Giles (eds), Morgan Kaufmann Publishers, San Mateo, California | 1993 | Algorithms | |
| Large-scale Association Analysis Identifies 13 New Susceptibility Loci for Coronary Artery Disease | The CARDIoGRAM Consortium | Nature Genetics, Vol. 43, No. 4, pp. 333-338 | March 2011 | Algorithms | |
| Capacity Control for Partially Ordered Feature Sets | U. Rueckert | Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2009), Part II, Bled, Slovenia, pp. 318-333 | September 2009 | Algorithms | [PDF]
|
| Neural Network Modeling of Physiological Processes | V. Tresp, J. Moody, and W.R. Delong | Computational Learning Theory and Natural Learning Systems, Vol. 2, T. Petsche, M. Kearns, S. Hanson, R. Rivest (eds), MIT Press, pp. 363-378 | 1993 | Algorithms | |