| A 1.5-Approximation Algorithm for Sorting by Transpositions and Transversals | T. Hartman and R. Sharan | Proceedings of WABI | September 05 2004 | 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 | |
| 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 | |
| A Combinatorial Approach to Protein Docking with Flexible Side-Chains | E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller | Proceedings of the Fourth Annual International conference on Computational Molecular Biology (RECOMB-00), Tokyo, Japan, 2000. | 2000 | Algorithms | |
| A Comparison of Phasing Algorithms for Trios and Unrelated Individuals | J. Marchini, D. Cutler, N. Patterson, M. Stephens, E. Eskin, E. Halperin, S. Lin, S. Qin, G. Abecassis, H. Munro, and P. Donnelly | American Journal of Human Genetics, Vol. 78, Issue 3, pp. 437-450 | March 2006 | 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 | |
| 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 | |
| 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 | |
| A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only | I. Adler, R. M. Karp, and R. Shamir | Mathematics of Operations Research, Vol. 11, No. 4, pp. 570-90 | November 1986 | 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 | |
| A Few Ants Are Enough: ACO with Iteration-Best Update | F. Neumann, D. Sudholt, and C. Witt | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), Portland, Oregon, pp. 63-70 | July 2010 | 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 | |
| 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 | |
| A Generic Coalescent-Based Framework for the Selection of a Reference Panel for Imputation | B. Pasanuic, R. Avinery, T. Gur, C. F. Skibola, P. M. Bracci, and E. Halperin | Genetic Epidemiology, Vol. 34, Issue 8, pp. 773-782 | December 2010 | Algorithms | [PDF]
|
| 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 | |
| A Heuristic for the Stacker Crane Problem on Trees Which is Almost Surely Exact | A. Coja-Oghlan, S.O. Krumke, and T. Nierhoff | Algorithms and Computation, 14th International Sympsium, ISAAC 2003, LNCS 2906, pp. 605-614, Springer | 2003 | Algorithms | |
| A Hierarchical Bayesian Markovian Model for Motifs in Biopolymer Sequences | E.P. Xing, M.I. Jordan, R.M. Karp, and S. Russell | Neural Information Processing Systems, 2002. | 2002 | 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 | |
| A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors | G.B. Horn and R.M. Karp | Proceedings of International Symposium on Information Theory | 2001 | Algorithms | |
| A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | H. Alt, L. Guibas, K. Mehlhorn, R. M. Karp, et al. | Algorithmica, Vol. 16, No. 4-5, pp. 543-547 | October 1996 | Algorithms | |
| A Model-Based Approach for Analysis of Spatial Structure in Genetic Data | W.-Y. Yang, J. Novembre, E. Eskin, and E. Halperin | Nature Genetics, Vol. 44, pp. 725-731 | May 2012 | Algorithms | [PDF]
|
| A Model-Based Approach for Analysis of Spatial Structure in Genetic Data | W. Yang, J. Novembre, E. Eskin, and E. Halperin | Presented at the Annual Meeting of the American Society of Human Genetics, San Francisco, California | November 2012 | 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 Neural Network Visualization and Sensitivity Analysis Toolkit | Y. Liao and J. Moody | Proceedings of the International Conference on Neural Information Processing, Hong Kong, Sun-ichi Amari, Lei Xu, Laiwan Chan, Irwin King, and Kwong-Sak Leung, eds. Springer Verlag Singapore Pte. Ltd. pp. 1069-74, Sept. 1996. | September 1996 | 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]
|
| A Note on Optimally Phasing Long Genomic Regions Using Local Haplotype Predictions | E. Eskin, E. Halperin, and R. Sharan | Journal of Bioinformatics and Computational Biology, Vol. 4, No. 3, pp. 639-647 | June 2006 | Algorithms | |
| A Novel Constraint Satisfaction Problem Solver for Self-Configuring Distributed Systems with Highly Dynamic Behavior | B. Satzger, F. Bagci, and T. Ungerer | Proceedings of the IEEE World Congress on Computational Intelligence (WCCI 2010), Barcelona, Spain | July 2010 | Algorithms | [PDF]
|
| A Novel Constraint Satisfaction Problem Solver for Self-Configuring Distributed Systems with Highly Dynamic Behavior | B. Satzger, F. Bagci, and T. Ungerer | Proceedings of the IEEE World Congress on Computational Intelligence (WCCI 2010), Barcelona, Spain, pp. 1-6 | June 2010 | Algorithms | [PDF]
|
| 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 | |
| A Phenomenon in the Theory of Sorting | D. Gale and R. M. Karp | Journal of Computer and System Sciences, Vol. 6, No. 2, p. 103-15 | April 1972 | Algorithms | |
| A Polyhedral Approach to Surface Reconstruction from Planar Contours | E. Althaus and C. Fink | Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 2002. | 2002 | Algorithms | |
| A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns | J. Gramm | Proceedings of the Fourth International Workshop on Algorithms in Bioinformatics (WABI 2004), Bergen, Norway | September 05 2004 | Algorithms | |
| A Practical Computer Immunology Approach for Self-Protection Enhanced by Optimization Techniques | A. Pietzowski, B. Satzger, W. Trumler, and T. Ungerer | Journal of Autonomic and Trusted Computing | 2010 | Algorithms | |
| A Probabilistic Model for the Survivability of Cells | I. Adler, H-S Ahn, R. M. Karp, and S.M. Ross | Journal of Applied Probability, Vol. 42, No. 4, pp. 919-931 | December 2005 | Algorithms | |
| A Randomization Test for Controlling Population Stratification in Whole-Genome Association Studies | G. Kimmel, M. I. Jordan, E. Halperin, R. Shamir, and R. M. Karp | American Journal of Human Genetics, Vol. 81, Issue 5, pp. 895-905 | November 2007 | 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 | |
| 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]
|
| A Rigorous Analysis of Population Stratification with Limited Data | K. Chaudhuri, E. Halperin, S. Rao, and S. Zhou | Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, Louisiana, pp. 1046-1055 | January 2007 | Algorithms | [PDF]
|
| A Search for Overlapping Genetic Susceptibility Loci Between Non-Hodgkin Lymphoma and Autoimmune Diseases | L. Conde, P. M. Bracci, E. Halperin, and C. F. Skibola | Genomics, Vol. 98, No. 1, pp. 9-14 | July 2011 | 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 | |
| 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 | |
| A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps | I. Adler, R. M. Karp, and R. Shamir | Journal of Complexity, Vol. 3, No. 4, pp. 372-87 | December 1987 | Algorithms | |
| A Smoothing Regularizer for Feedforward and Recurrent Neural Networks | L. Wu and J. Moody | Neural Computation, Vol. 8, Issue 3 | 1996 | Algorithms | |
| A Stellar Energy Loss Mechanism Involving Axions | L.M. Krauss, J. Moody, and F. Wilczek | Physics Letters, Vol. 144B, pp. 391 | 1984 | Algorithms | |
| A Stochastic Process on the Hypercube with Applications to Peer to Peer Networks | M. Adler, E. Halperin, R.M. Karp, and V. Vazirani | Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 575-584 | 2003 | Algorithms | |
| Acceleration of DBSCAN-Based Clustering with Reduced Neighborhood Evaluations | A. Thom and O. Kramer | Proceedings of the 33rd Annual German Conference on AI: Advances in Artificial Intelligence (KI 2010), Kralsruhe, Germany, pp. 195-202 | September 2010 | Algorithms | |
| Accurate Estimation of Expression Levels of Homologous Genes in RNA-Seq Experiments | B. Pasaniuc, N. Zaitlen, and E. Halperin | Proceedings of the Fourteenth International Conference on Research in Computational Biology (RECOMB 2010), Lisbon, Portugal, pp. 397-409. Also appears in Journal of Computational Biology (a special issue of RECOMB), Vol. 18, Issue 3, pp. 489-468, March 2011. | April 2010 | Algorithms | [PDF]
|
| Active Learning Under Arbitrary Distributions | C. Monteleoni and M. Kaariainen | Poster at the Value of Information in Inference, Learning, and Decision-Making Workshop at the 19th Annual Conference on Neural Information Processing Systems (NIPS), Vancouver, Canada | December 2005 | Algorithms | |
| Adaptive Concept Drift Detection | A. Dries and U. Rueckert | Best paper, proceedings of the 9th SIAM International Conference on Data Mining, Sparks, Nevada, pp. 235-246 | April 2009 | 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 | |
