Publication One Useful Logic That Defines Its Own Truth Andreas Blass, Yuri Gurevich 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008). Springer Lecture Notes in Computer Science. | January 2008
Publication Dichotomies between computational and mathematical models (Correspondence) Jasmin Fisher, Henzinger T.A Nature Biotechnology | January 2008, Vol 26: pp. 737-8-738-9
Publication Compact Name-Independent Routing with Minimum Stretch Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup ACM Transactions on Algorithms | January 2008, Vol 4: pp. 1-12
Publication Poisson Matching Alexander E. Holroyd, Robin Pemantle, Yuval Peres, Oded Schramm Annales de l’Institut Henri Poincaré, Probabilités et Statistiques | December 2007, Vol 45: pp. 266-287
Publication Interpolant based Decision Procedure for Quantifier-free Presburger Arithmetic Shuvendu Lahiri, Krishna Kumar Mehra MSR-TR-2005-121 | September 2007 Proc. National Academy of Sciences
Publication Local Overlaps In Special Unfoldings Of Convex Polyhedra Brendan Lucier Canadian Conference on Computational Geometry 2006 and Computational Geometry: Theory and Applications 2009 | July 2007
Publication Wait-Free Regular Storage from Byzantine Components Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi Information Processsing Letters | July 2007, Vol 101(2): pp. 60-65
Publication Data Management in Dynamic Environment-driven Computational Science Yogesh Simmhan, Sangmi Lee Pallickara, Nithya N. Vijayakumar, Beth Plale Grid-Based Problem Solving Environments (WoCo9) | July 2007 ISBN: 978-0387736587
Publication An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem David Wipf, Bhaskar D. Rao IEEE Transactions on Signal Processing, vol. 55, no. 7, July 2007. | July 2007
Publication Learning Nested Halfspaces and Uphill Decision Trees Adam Tauman Kalai 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA; June 13-15, 2007. Proceedings | June 2007 ISBN: 978-3-540-72925-9 (Print) 978-3-540-72927-3 (Online)