| 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]
|
| Adiabatic Effective Lagrangian | J. Moody, A. Shapere, and F. Wilczek | Geometric Phases in Physics, edited by A. Shapere and F. Wilczek, World Scientific Publishing Co. | 1989 | Algorithms | |
| Advances in Neural Information Processing Systems 3 | R. Lippmann, J. Moody, and D. Touretzky, eds. | Morgan Kaufmann, Palo Alto | 1991 | Algorithms | |
| Advances in Neural Information Processing Systems 4 | J. Moody, S. Hanson, and R. Lippmann, eds. | Morgan Kaufmann, Palo Alto | 1992 | Algorithms | |
| Algorithms for Comparing Pedigree Graphs | B. Kirkpatrick, H. Finucane, Y. Reshef, and R. Karp | Presented at the 10th Workshop on Algorithms in Bioinformatics (WABI 2010), Liverpool, United Kingdom | September 2010 | Algorithms | [PDF]
|
| Algorithms for Graph Partitioning on the Planted Partition Model. (Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques.) | A. Condon and R.M. Karp | Edited by: Hochbaum, D., Jansen, K., Rolim, J.D.P., Sinclair, A. Berlin, Germany: Springer-Verlag, 1999. pp. 221-32, ix+287 pp. 14 | 1999 | Algorithms | |
| Algorithms for Implicit Hitting Set Problems | K. Chandrasekaran, R. Karp, E. Moreno-Centeno, and S. Vempala | Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 614-629, San Francisco, California | January 2011 | Algorithms | [PDF]
|
| 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 | |
| Algorithms to Detect Multi-Protein Modularity Conserved During Evolution | L. Hodgkinson and R. M. Karp | EECS Department, UC Berkeley Technical Report No. UCB/EECS-2011-7, Berkeley, California | January 2011 | Algorithms | |
| Algorithms to Detect Multiprotein Modularity Conserved During Evolution | L. Hodgkinson and R. M. Karp | Proceedings of the 7th International Symposium on Bioinformatics Research
and Applications (ISBRA 2011), Changsha, China. Also in IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2011. | May 2011 | Algorithms | [PDF]
|
| Algorithms to Detect Multiprotein Modularity Conserved During Evolution | L. Hodgkinson and R. M. Karp | IEEE/ACM Transactions on Computational Biology and Bioinformatics, PMID: 21968956 | September 2011 | Algorithms | [PDF]
|
| AltAnalyze and DomainGraph: Analyzing and Visualizing Exon Expression Data | D. Emig, N. Salomonis, J. Baumbach, T. Lengauer, B. R. Conklin, and M. Albrecht | Nucleic Acids Research, Vol. 38, Web Server Issue, pp. W755-W762 | July 2010 | Algorithms | [PDF]
|
| An Algorithm to Solve the m*n Assignment Problem in Expected Time O(mn log n)* | R. M. Karp | Networks, Vol. 10, No. 2, pp. 143-52 | 1980 | Algorithms | |
| 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]
|
| 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 | |
| An information entropy approach to the small-lot concept | B. Ronen and R. M. Karp | IEEE Transactions on Engineering Management, Vol. 41, No. 1, p. 89-92 | February 1994 | Algorithms | |
| An introduction to randomized algorithms | R. M. Karp | Discrete Applied Mathematics, Vol. 34, No. 1-3. Also in the proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science, Washington, D.C., pp. 165-201 | November 21 1991 | 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 | |
| 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 | |
| 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 | |
| Analysis of an Asymmetric Mutation Operator | T. Jansen and D. Sudholt | Evolutionary Computation, Vol. 18, No. 1, pp. 1-26 | January 2010 | 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 | |
| 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]
|
| Ant Colony Optimization for Stochastic Shortest Path Problems | C. Horoba and D. Sudholt | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), Portland, Oregon, pp. 1465-1472 | July 2010 | Algorithms | |
| 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]
|
| Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in Practice | K. Bringmann and T. Friedrich | Proceedings of the Fifth International Conference on Evolutionary Multi-Criterion Optimization (EMO 2009), Nantes, France, pp. 6-20 | April 2009 | Algorithms | [PDF]
|
| Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects | K. Bringmann and T. Friedrich | Proceedings of International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, pp. 436-447 | December 2008 | Algorithms | [PDF]
|
| Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects | K. Bringmann and T. Friedrich | Computational Geometry, Vol. 43, Issues 6-7, pp. 601-610 | August 2010 | Algorithms | [PDF]
|
| 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 | |
| Approximation Algorithms for Data Management in Networks | C. Krick, H. Racke, and M. Westermann | Theory of Computing Systems, 2001. | 2001 | Algorithms | |
| Architecture Selection Strategies for Neural Networks: Application to Corporate Bond Rating Prediction | J. Moody and J. Utans | Neural Networks in the Capital Markets, Refenes A. N. (ed), John Wiley & Sons, New York | 1994 | Algorithms | |
| Association Mapping and Significance Estimation via the Coalescent | G. Kimmel, R. M. Karp, M. A. Jordan, and E. Halperin | Journal of Human Genetics, Vol. 83, Issue 6, pp. 675-683 | December 2008 | Algorithms | [PDF]
|
| Associative Memories | J. Moody | Chapter II 5, DARPA Neural Network Study Final Report, Richard Lippmann, ed. | 1988 | Algorithms | |
| Asymmetric Cost Sharing Mechanisms | E. Friedman | Games and Economic Behavior, available at http://dx.doi.org/10.1016/j.geb.2011.09.009 | October 2011 | Algorithms | |
| Asymmetric K-Center Is Log* N-Hard to Approximate | J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz, R. Krauthgamer, and J. Naor | Journal of the ACM, Vol. 52, Issue 4, pp. 538-551 | July 2005 | Algorithms | |
| Aufträge, Partner, Kosten - Kooperation statt Konkurrenz | J. Lässig, S. Heinrich, and U. Trommler | IT&Production, Issue 10, pp. 74-76 | November 2009 | Algorithms | |
| Automated Generation of Search Tree Algorithms for Hard Graph-Modification Problems | J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier | Algorithmica, 39(4):321-347 | January 05 2004 | Algorithms | |
| Autonomous and Scalable Failure Detection in Distributed Systems | B. Satzger, A. Pietzowski, and T. Ungerer | International Journal of Autonomous and Adaptive Communications Systems, Vol. 4, No.1, pp. 61-77 | January 2011 | Algorithms | |
| Average case analysis of a heuristic for the assignment problem | R.M. Karp, A.H.G. Rinnooy Kan, and R.V. Vohra | Mathematics of Operations Research, Vol. 19, No. 3, pp. 513-22 | August 1994 | Algorithms | |
| 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]
|
| Average-Case Analysis of Incremental Topological Ordering | D. Ajwani and T. Friedrich | Discrete Applied Mathematics, Vol. 158, Issue 4, pp. 240-250 | February 2010 | Algorithms | [PDF]
|
| 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 | |
| Balancing the Traffic Load in Wireless Networks with Curveball Routing | L. Popa, A. Rostami, R. M. Karp, C. Papadimitriou, and I. Stoica | Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2007), Montreal, Canada | September 2007 | Algorithms | |
| Bayesian Haplotype Inference via the Dirichlet Process | E.P. Xing, R. Sharan, and M.I. Jordan | Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNP and Haplotypes, pp. 99-112; Also In Proceedings of ICML 2004 | January 05 2004 | 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 | |
| Branch and Infer: A Unifying Framework for Integer and Nite Domain Constraint Programming | A. Bockmayr and T. Kasper | INFORMS Journal on Computing, 10(3): 287-300, 1998. | 1998 | Algorithms | |
| Calculations for Cosmic Axion Detection | L. Krauss, J. Moody, F. Wilczek, and D. Morris | Physical Review Letters, Vol. 55, Issue 17, pp. 1797-1800 | 1985 | 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]
|
| 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 | |
