| 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 | |
| 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]
|
| 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 | |
| The Benefit of Migration in Parallel Evolutionary Algorithms | J. Laessig and D. Sudholt | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), Portland, Oregon, pp. 1105-1112 | July 2010 | Algorithms | |
| 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]
|
| The complexity of parallel computation | R. M. Karp, Edited by: C.E. Leiserson | Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI, Cambridge, Massachusetts, pp.197 | April 1986 | 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 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 | |
| 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]
|
| 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 | |
| Perfect Path Phylogeny Haplotyping with Missing Data is Fixed-Parameter Tractable | J. Gramm, T. Nierhoff, and T. Tantau | Proceedings of the First International Workshop on Parameterized and Exact Computation (IWPEC 2004), Bergen, Norway | September 05 2004 | Algorithms | |
| Selecting Neural Network Architecture via the Prediction Risk: Application to Corporate Bond Rating Prediction | J. Utans and J. Moody | Proceedings of the First International Conference on Artificial Intelligence Applications on Wall Street, New York, New York | October 1991 | Algorithms | |
| Note on Generalization, Regularization, and Architecture Selection in Nonlinear Learning Systems | J. Moody | Proceedings of the First IEEE-SP Workshop on Neural Networks for Signal Processing, pp. 1-10 | 1991 | Algorithms | |
| Covering Games: Approximation Through Non-Cooperation | M. Gairing | Proceedings of the Fifth Workshop on Internet and Network Economics (WINE '09), Rome, Italy, pp. 184-195 | December 2009 | Algorithms | [PDF]
|
| Imputation-Based Local Ancestry Inference in Admixed Populations | B. Pasaniuc, J. Kennedy, and I. I. Mandoiu | Proceedings of the Fifth International Symposium on Bioinformatics Research and Applications (ISBRA 2009), Fort Lauderdale, Florida, pp. 221-233 | May 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 | |
| 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]
|
| 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]
|
| 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]
|
| TSP-Based Curve Reconstruction in Polynomial Time | E. Althaus and K. Melhorn | Proceedings of the Eleventh Symposium on Discrete Algorithms, pp. 686-695, 2000. | 2000 | Algorithms | |
| CRÈME: A Framework for Identifying Cis-Regulatory Modules in Human-Mouse Conserved Segments | R. Sharan, I. Ovcharenko, A. Ben-Hur, and R. M. Karp | Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology (ISMB'03), Bioinformatics 19, Supplement 1, pp. 1283-1291 | 2003 | 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 | |
| Probabilistic Analysis of Graph-theoretic Algorithms | R. M. Karp | Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, pp. 173 | May 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 | |
| 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]
|
| 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]
|
| 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]
|
| Efficient Broadcast on Random Geometric Graphs | M. Bradonjić, R. Elsässer, T. Friedrich, T. Sauerwald, and A. Stauffer | Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, Texas, pp. 1412-1421 | January 2010 | Algorithms | [PDF]
|
| Noisy Binary Search | R. M. Karp and R. Kleinberg | Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), New Orleans, Louisiana, pp. 881-890 | January 2007 | Algorithms | |
| Modeling parallel communication | R. M. Karp | Proceedings of the 9th International Parallel Processing Symposium (IPDPS '95), Santa Barbara, California, p. 2 | April 1995 | Algorithms | |
| Estimating Haplotype Frequencies Efficiently | E. Halperin and E. Hazan | Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05), Cambridge, Massachusetts, pp. 553-568 | May 2005 | Algorithms | |
| Haplofreq - Estimating Haplotype Frequencies Efficiently | E. Halperin and E. Hazan | Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05), Cambridge, Massachusetts, pp. 553-568 | May 2005 | Algorithms | |
| Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks | J. Scott, T. Ideker, R. M. Karp, and R. Sharan | Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB'05), Cambridge, Massachusetts, pp. 133-144 | May 2005 | Algorithms | |
| Self-Stabilization in Hierarchically Structured Energy Markets | J. Laessig, B. Satzger, and O. Kramer | Proceedings of the 8th International Conference on Information Technology: New Generations (ITNG 2011), pp. 803-809, Las Vegas, Nevada | April 2011 | 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 | |
| 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]
|
| Parallel sorting with limited bandwidth | M. Adler, J.W. Byers, and R. M. Karp | Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95), New York, New York, pp. 129-36 | July 1995 | Algorithms | |
| Malicious Bayesian Congestion Games | M. Gairing | Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA'08), Universität Karlsruhe, Germany, pp. 119-132 | September 2008 | Algorithms | [PDF]
|
| Combinatorial Games with a Pass: A Dynamical Systems Approach | R. Morrison, E. Friedman, and A. Landsberg | Proceedings of the 4th International Conference on Chaotic Modeling, Simulation, and Applications (CHAOS2011), Agios Nikolaos, Greece | May 2011 | Algorithms | [PDF]
|
| Using Contiguous Bi-Clustering for Data Driven Temporal Analysis of fMRI Based Functional Connectivity | A. Maron-Katz, E. B. Simon, Y. Jacob, K. Rosenberg, R. M. Karp, T. Hendler, and R. Shamir | Proceedings of the 4th Annual INCF Neuroinformatics Congress, Boston, Massachusetts | September 2011 | 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]
|
| Domination When the Stars Are Out | D. Hermelin, M. Mnich, E. J. van Leeuwen, and G. J. Woeginger | Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), pp. 432-473, Zurich, Switzerland | July 2011 | Algorithms | |
| Planar k-Path in Subexponential Time and Polynomial Space | D. Lokshtanov, M. Mnich, and S. Saurabh | Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '11), Teplá-Klášter, Czech Republic | June 2011 | Algorithms | |
| 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]
|
| Tight Bounds for the Cover Time of Multiple Random Walks | R. Elsässer and T. Sauerwald | Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 415-426 | July 2009 | Algorithms | [PDF]
|
| Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness | B. Doerr, T. Friedrich, and T. Sauerwald | Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 366-377 | July 2009 | Algorithms | [PDF]
|
| The bit vector intersection problem | R. M. Karp, O. Waarts and G. Zweig | Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, Wisconsin, pp. 621-30 | October 1995 | 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 | |
| Polylogarithmic Inapproximability | E. Halperin and R. Krauthgamer | Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 585-594 | 2003 | 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 | |
