| Identifying Personal Genomes by Surname Inference | M. Gymrek, A. L. McGuire, D. Golan, E. Halperin, and Y. Erlich | Science, Vol. 339, No. 6117, pp. 321-324 | January 2013 | Algorithms | |
| Computing Nash Equilibria for Scheduling on Restricted Parallel Links | M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien | Theory of Computing Systems, Vol. 47, No. 2, pp. 405-432 | August 2010 | Algorithms | |
| Total Latency in Singleton Congestion Games | M. Gairing and F. Schoppmann | Proceedings of the Third International Workshop on Internet and Network Economics (WINE 2007), San Diego, California, pp. 381-387 | December 2007 | 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]
|
| 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]
|
| 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]
|
| The Complexity of Testing Whether a Graph is a Superconcentrator | M. Blum, R. M. Karp, O.Vornberger, C.H. Papadimitriou, and M. Yannakakis | Information Processing Letters, Vol. 13, No. 4-5, pp. 164-7 | 1981 | Algorithms | |
| Selection in the presence of noise: the design of playoff systems | M. Adler, P. Gemmell, M. Harchol-Balter, R. M. Karp, and C. Kenyon | Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, pp. 564-72 | January 1994 | Algorithms | |
| Scheduling parallel communication: the h-relation problem | M. Adler, J.W. Byers, and R. M. Karp | Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). Edited by: Wiedermann, J.; Hajek, P. Berlin, Germany: Springer-Verlag, pp. 1-20 | August 1995 | Algorithms | |
| 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 | |
| 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 | |
| A Stellar Energy Loss Mechanism Involving Axions | L.M. Krauss, J. Moody, and F. Wilczek | Physics Letters, Vol. 144B, pp. 391 | 1984 | Algorithms | |
| Multi-Effect Decompositions for Financial Data Modeling | L. Wu and J. Moody | Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997. | 1997 | Algorithms | |
| A Smoothing Regularizer for Feedforward and Recurrent Neural Networks | L. Wu and J. Moody | Neural Computation, Vol. 8, Issue 3 | 1996 | 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 | |
| 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 | |
| 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 | |
| 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 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 | IEEE/ACM Transactions on Computational Biology and Bioinformatics, PMID: 21968956 | September 2011 | Algorithms | [PDF]
|
| Coding techniques for handling failures in large disk arrays | L. Hellerstein, G.A. Gibson, R. M. Karp, R.M. Katz, and D.A. Patterson | Algorithmica, Vol. 12, No. 2-3, pp. 182-208 | August 1994 | Algorithms | |
| Novel Associations for Coronary Artery Disease Derived from Genome Wide Association Studies Are Not Associated with Increased Carotid Intima-Media Thickness.... | L. Conde, S. Bevan, M. Sitzer, N. Klopp, T. Illig, J. Thiery, J. Seissler, J. Baumert, O. Raitakari, M. Khnen, L. P. Lyytikinen, R. Laaksonen, J. Viikari, T. Lehtimki, W. Koernig, E. Halperin, H. S. Markus | Atherosclerosis, Vol. 219, No 2, pp. 684-689 | December 2011 | Algorithms | |
| 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 | |
| Genome-Wide Association Study of Follicular Lymphoma Identifies a Risk Locus at 6p21.32 | L. Conde, E. Halperin, N. K. Akers, K. M. Brown, K. E. Smedby, N. Rothman, et al. | Nature Genetics, Vol. 42, No. 8, pp. 661-664. DOI:10.1038/ng.626 | August 2010 | Algorithms | |
| Using DNA Pools for Genotyping Trios | K.B. Beckman, K.A. Abel, A. Braun, and E. Halperin | Nucleic Acids Research, Vol. 34, No. 19, electronic article no. 129 | November 2006 | Algorithms | [PDF]
|
| Efficiently Solvable Perfect Phylogeny Problems on Binary and k-State Data with Missing Values | K. Stephens and B. Kirkpatrick | Proceedings of the 11th Workshop on Algorithms in Bioinformatics (WABI 2011), Saarbrücken, Germany | September 2011 | Algorithms | |
| 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]
|
| 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]
|
| Don’t Be Greedy When Calculating Hypervolume Contributions. | K. Bringmann and T. Friedrich. | Proceedings of the 10th Foundations of Genetic Algorithms Workshop (FOGA X), Orlando, Florida, pp. 103-112 | January 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 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 | Computational Geometry, Vol. 43, Issues 6-7, pp. 601-610 | August 2010 | Algorithms | [PDF]
|
| Inhibition of Activated Pericentromeric SINE/Alu Repeat Transcription in Senescent Human Adult Stem Cells Reinstates Self-Renewal | J. Wang, G. J. Geesman, S. L. Hostikka, M. Atallah, B. Blackwell, E. Lee, P. J. Cook, B. Pasaniuc, G. Shariat, E. Halperin, M. Dobke, M. G. Rosenfeld, I. K. Jordan, and V. V. Lunyak | Cell Cycle, Vol. 10, No.17, pp. 3016-3030 | September 2011 | Algorithms | |
| Selecting Input Variables via Sensitivity Analysis: Application to Predicting the U.S. Business Cycle | J. Utans, J. Moody, S. Rehfuss, and H. Siegelmann | Proceedings of Computational Intelligence in Financial Engineering (IEEE IAFE 1995), New York, New York | April 1995 | 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 | |
| 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 | |
| Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks | J. Scott, T. Ideker, R. M. Karp, and R. Sharan | Journal of Computational Biology, Vol. 13, Issue 2 pp. 133-144 | March 2006 | Algorithms | [PDF]
|
| Robust Convergence in Pulse Coupled Oscillators with Delays | J. Nishimura and E. Friedman | In Physical Review Letters, Vol. 106, No. 19, DOI:10.1103/PhysRevLett.106.194101 | May 2011 | Algorithms | |
| Probabilistic Convergence Guarantees for Type-II Pulse-Coupled Oscillators | J. Nishimura and E. Friedman | Physical Review E, Vol. 86, Issue 2 | August 2012 | Algorithms | |
| Stochastic Direct Reinforcement: Application to Simple Games with Recurrence | J. Moody, Y. Liu, M. Saffell, and K. Youn | Proceedings of the 2004 AAAI Fall Symposium on Artificial Multiagent Learning, Arlington, Virginia, pp. 23-34 | October 2004 | Algorithms | [PDF]
|
| Advances in Neural Information Processing Systems 4 | J. Moody, S. Hanson, and R. Lippmann, eds. | Morgan Kaufmann, Palo Alto | 1992 | Algorithms | |
| Reinforcement Learning for Trading Systems and Portfolios | J. Moody, M. Saffell, Y. Liao, and L. Wu | Decision Technologies for Computational Finance, Proceedings of the London Conference, A.N. Refenes, N. Burgess and J. Moody, eds., Kluwer Financial Publishing, 1998. | 1998 | Algorithms | |
| Performance Functions and Reinforcement Learning for Trading Systems and Portfolios | J. Moody, L. Wu, Y. Liao, and M. Saffell | Journal of Forecasting, vol. 17, pp. 441-470, 1998. | 1998 | Algorithms | |
| Filamentary Galaxy Clustering: A Mapping Algorithm | J. Moody, E.L. Turner, and J.R. Gott III | Astrophysical Journal, Vol. 273, pp. 16-23 | October 1983 | Algorithms | |
| 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 | |
| Realizations of Magnetic Monopole Gauge Fields: Diatoms and Spin-Precession | J. Moody, A. Shapere, and F. Wilczek | Physical Review Letters, Vol. 56, pp. 893 | 1986 | Algorithms | |
| Predicting the U.S. Index of Industrial Production | J. Moody, A. Levin, and S. Rehfuss | Proceedings of Parallel Applications in Statistics and Economics '93, M. Novak (ed), special issue of Neural Network World, Vol. 3, No. 6, pp. 791-794 | 1993 | Algorithms | |
| Regularizers and Priors for Feed-Forward Networks | J. Moody and T. Rognvaldsson | Submitted for publication 2003 | 2003 | Algorithms | |
| Smoothing Regularizers for Projective Basis Function Networks | J. Moody and T. Rognvaldsson | Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997. | 1997 | Algorithms | |
| Temperature Profiles Induced by a Scanning CW Laser Beam | J. Moody and R.H. Hendel | Journal of Applied Physics, Vol. 53, Issue 6, pp. 4364-4371 | 1982 | Algorithms | |