| 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]
|
| Towards Lightweight Self-Configuration in Wireless Sensor Networks | B. Satzger, F. Bagci, F. Kluge, and T. Ungerer | Proceedings of the 25th ACM Symposium on Applied Computing (ACM SAC 2010), Sierre, Switzerland, pp. 791-792 | March 2010 | 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 | |
| Go Thermography: The 4/12/98 Jiang-Rui Environmental Endgame | B. Spight | More Games of No Chance, MSRI Publictations vo. 42, Cambridge University Press, 2002. | 2002 | Algorithms | |
| PathBLAST: A Tool for Alignment of Protein Interaction Networks | B.P. Kelley, B. Yuan, F. Lewitter, R. Sharan, B.R. Stockwell, and T. Ideker | Nucleic Acids Research 32, pp. W83-W88 | January 05 2004 | Algorithms | |
| Simulation-Based Evolutionary Optimization of Complex Multi-Location Inventory Models | C. A. Hochmuth, J. Laessig, and S. Thiem | Proceedings of the Third IEEE International Conference on Computer Science and Information Technology (IEEE ICCSIT 2010), pp. 703-708, Chengdu, China | July 2010 | Algorithms | [PDF]
|
| Towards Faster Stochastic Gradient Search | C. Darken and J. Moody | Advances in Neural Information Processing Systems, Vol. 4, Moody, Hanson, and Lippmann, eds., Morgan Kaufmann, Palo Alto | 1992 | Algorithms | |
| Note on Learning Rate Schedules for Stochastic Optimization | C. Darken and J. Moody | Advances in Neural Information Processing Systems, Vol. 3, Lippmann, Moody, and Touretzky, eds. Morgan Kaufmann, Palo Alto | 1991 | Algorithms | |
| Fast, Adaptive K-Means Clustering: Some Empirical Results | C. Darken and J. Moody | Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN 1990), San Diego, California | 1990 | Algorithms | |
| Learning Rate Schedules for Faster Stochastic Gradient Search | C. Darken, J. Chang, and J. Moody | Neural Networks for Signal Processing, Vol. 2 - Proceedings of the 1992 IEEE Workshop | August 1992 | Algorithms | |
| Probabilistic Analysis of Linear Programming Decoding | C. Daskalakis, A. G. Dimakis, R. M. Karp, and M. J. Wainwright | IEEE Transactions on Information Theory, Vol. 54, Issue 8, pp. 3565-3578 | August 2008 | 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]
|
| Developments in Forecast Combination and Portfolio Choice | C. Dunis, A. Timmermann, and J. Moody, editors | Wiley Financial Economics, London, 2001. | 2001 | Algorithms | |
| Polymorphisms in the Estrogen Receptor 1 and Vitamin C and Matrix Metalloproteinase Gene Families Are Associated with Susceptibility to Lymphoma | C. F. Skibola, P. M. Bracci, E. Halperin, A. Nieters, A. Hubbard, R. A. Paynter, D. R. Skibola, A. Agana, N. Becker, P. Tessler, M. S. Forrest, S. Sankararaman, L. Conde, E. A. Holly, and M. T. Smith | PLoS ONE, Vol. 3, Issue 7, e2816 | June 2008 | Algorithms | [PDF]
|
| Genetic Variants at 6p21.33 Are Associated with Susceptibility to Follicular Lymphoma | C. F. Skibola, P. M. Bracci, E. Halperin, L. Conde, D. W. Craig, L. Agana, K. Iyadurai, N. Becker, A. Brooks-Wilson, J. D. Curry, J. J. Spinelli, E. A. Holly, J. Riby, L. Zhang, A. Nieters, M. T. Smith, and K. M. Brown | Nature Genetics, Vol. 41, No. 8, pp. 873-875 | August 2009 | Algorithms | [PDF]
|
| Running Time Analysis of ACO Systems for Shortest Path Problems | C. Horoba and D. Sudholt | Proceedings of Engineering and Stochastic Local Search Algorithms (SLS 2009), Brussels, Belgium, pp. 76-91 | September 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 | |
| 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 | |
| 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 | |
| Whole-Genome Patterns of Common DNA Variation in Three Human Populations | D. A. Hinds, L. L. Stuve, G. B. Nilsen, E. Halperin, E. Eskin, D. G. Ballinger, K. A. Frazer, and D. R. Cox | Science, Vol. 307, No. 5712, pp. 1072-1079. DOI:10.1126/science.1105436 | February 2005 | 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]
|
| On the Effects of Adding Objectives to Plateau Functions | D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, and E. Zitzler | IEEE Transactions on Evolutionary Computation, Vol. 13, Issue 3, pp. 591-603 | June 2009 | Algorithms | [PDF]
|
| LogP: towards a realistic model of parallel computation | D. Culler, R.M. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. | SIGPLAN Notices, Vol. 28, No. 7. Also in the proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, California, USA, May 1993, pp. 1-12 | July 1993 | Algorithms | |
| On the security of ping-pong protocols | D. Dolev, S. Even, and R. M. Karp | Information and Control, Vol. 55, No.1-3, pp. 57-68 | 1982 | Algorithms | |
| On the security of ping-pong protocols | D. Dolev, S. Even, and R. M. Karp. Edited by: D. Chaum, R.L. Rivest, and A.T. Sherman | Advances in Cryptology: Proceedings of Crypto 82, Santa Barbara, California, pp. 177-86 | August 1982 | Algorithms | |
| 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]
|
| Constructing Maps Using the Span and Inclusion Relations | D. Fasulo, T. Jiang, R.M. Karp, and N. Sharma | RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 64-73. | 1998 | 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 | |
| Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. | D. Gusfield, R.M. Karp, L. Wang, and P. Stelling | Discrete Applied Mathematics, 9 Nov. 1998, vol.88, (no.1-3):167-80. | 1998 | Algorithms | |
| Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem | D. Gusfield, R.M. Karp, W. Lusheng, and P. Stelling | Combinatorial Pattern Matching. 7th Annual Symposium, CPM 96. Proceedings. 10-12 June 1996. Berlin, Germany: Springer-Verlag, 1996. p. 304-19. | June 1996 | Algorithms | |
| Genotyping Common and Rare Variation Using Overlapping Pool Sequencing | D. He, N. Zaitlen, B. Pasaniuc, E. Eskin, and E. Halperin | BMC Informatics, Vol. 12, Suppl. 6. Also appears in the proceedings of the First Annual RECOMB Satellite Workshop on Massively Parallel Sequencing (RECOMB-seq), Vancouver, Canada, pp. 26-27 | March 2011 | 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 | |
| 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]
|
| 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]
|
| 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 | |
| LogP: A Practical Model of Parallel Computation | D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, and others | Communications of the ACM, Vol. 39, No. 11, pp. 78-85 | November 1996 | Algorithms | |
| Curve Reconstruction and the Traveling Salsman Problem. | E. Althaus | Ph.D. Thesis, Universitat des Saarlandes. 2001. | 2001 | 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 | |
| TSP-Based Curve Reconstruction in Polynomial Time | E. Althaus and K. Melhorn | SIAM Journal of Computing 31(1), 2001. | 2001 | Algorithms | |
| 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 | |
| Multiple Sequence Alighment with Arbitrary Gap Costs: Computing an Optimal Solution Using Polydhedral Combinatorics | E. Althaus, A. Caprara, H.P. Lenhof, and K. Reinert | ECCB, 4-16, 2002. | 2002 | Algorithms | |
| Experiments on Curve Reconstruction | E. Althaus, K. Melhorn. S Naher, and S. Schirra | Proceedings of the Second Workshop Algorithm Engineering and Experiments (ALENEX00). Lecture Notes in Computer Science, Springer-Verlag, 2000. | 2000 | 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 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 | |
| Constant-Factor Approximation of Vertex-Cuts in Planar Graphs | E. Amir, R. Krathgamer, and S. Rao | Manuscript, 2002. | 2002 | Algorithms | |
| Idempotents Among Partesan Games | E. Berlekamp | More Games of No Chance, MSRI Publicatons vol. 42, pp 3-23, Cambridge University Press, 2002. | 2002 | Algorithms | |
| Performance Aspects of Distributed Caches Using TTL-Based Consistency | E. Cohen, E. Halperin, and H. Kaplan | Theoretical Computer Science, Vol. 331, Issue 1, pp. 73-96 | February 2005 | Algorithms | |
