| Ph.D. Thesis | On graphs of high girth, under the supervision of Prof. Nati Linial, Hebrew university, Jerusalem 2002. Gzipped thesis | 1 | A counterexample to a conjecture of Björner and Lovász on the χ-coloring complex, with Nati Linial, Journal of Combinatorial Theory Series B 95(2), p.346-349, 2005. ps, pdf. | 2 | Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable, with Stefan Szeider, Theoretical Computer Science 337(1-3), p.347-359, 2005. ps, pdf, Archive for (k,s)-SAT certificates. | 3 | A lower bound on the spectral radius of the universal cover of a graph, Journal of Combinatorial Theory Series B 93(1), p.33-43, 2005. ps, pdf. | 4 | Colorings of the d-regular infinite tree, with Nati Linial, Journal of Combinatorial Theory Series B 91(2), p.161-167, 2004. ps, pdf. | 5 | On Codes from Hypergraphs, with Yonatan Bilu, European Journal of Combinatorics 25(3), p.339-354, 2004. ps, pdf. | 6 | The size of bipartite graphs with a given girth, Journal of Combinatorial Theory Series B 86(2), p.215-220, 2002. ps, pdf. | 7 | A Continuous Analogue of the Girth Problem, with Alon Amit and Nati Linial, Journal of Combinatorial Theory Series B 84(2), p.340-363, 2002. ps, pdf. | 8 | The Moore bound for irregular graphs, with Noga Alon and Nati Linial, Graph and Combinatorics 18(1), p.53-57, 2002. ps, pdf. | 9 | Central Points for Set in R^n (or: the Chocolate Ice-Cream Problem), with Nati Linial, Discrete & Computational Geometry 15, p.467-479, 1996. ps, pdf. | 10 | Universal Traversal Sequences for Expander Graphs, with Avi Wigderson, Information Processing Letters 46(2), p.67-69, 1993. ps, pdf. | 11 | Simple permutations mix well, with Avner Magen, Steven Myers and Charles Rackoff, ICALP 2004. To appear in Theoretical Computer Science. ps, pdf. | 12 | A note on unsatisfiable k-CNF formulas with few occurrences per variable, with Stefan Szeider, to appear in SIAM Journal on Discrete Mathematics, ps, pdf. | 13 | Expander Graphs and their Applications, an invited survey acticle to appear in the Bulletin of the AMS. Draft version: ps, pdf. | 14 | Rank Bounds and Integrality Gaps for Cutting Planes Procedures, with Joshua Buresh-Oppenheim, Nicola Galesi, Avner Magen and Toniann Pitassi, IEEE Symposium on Foundations of Computer Science (FOCS), 2003. ps, pdf. | 15 | Simple Permutations Mix Even Better, with Alex Brodsky, submitted, ps, pdf, Arxiv math.CO/0411098. | 16 | Monotone circuits for the majority function, with Avner Magen and Toniann Pitassi, submitted to RANDOM 2006. ps, pdf. | 22 | Maximum matchings in regular graphs of high girth, with Abraham D. Flaxman, sumitted to EJC. ps, pdf. | 18 | The girth of random Cayley graphs, with Alex Gamburd, Mehrdad Shahshahani and Bálint Virág, work in progress. | 19 | The non-backtracking spectrum of the universal cover of a graph, with Omer Angel and Joel Friedman, work in progress. | 20 | On the largest eigenvalue of irregular graphs, with Nick Wormald, work in progress. | 21 | On the number of eight cycles in a quadrilateral free bipartite graph, with Jacques A. Verstraete, and Felix Lazebnik, work in progress. |