Shlomo Hoory

According to our database1, Shlomo Hoory authored at least 25 papers between 1993 and 2011.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Reducing the size of resolution proofs in linear time.
STTT, 2011

On the girth of random Cayley graphs.
Random Struct. Algorithms, 2009

On Extending Bounded Proofs to Inductive Proofs.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

Simple permutations mix even better.
Random Struct. Algorithms, 2008

Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections.
Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering (ASE 2008), 2008

Linear-Time Reductions of Resolution Proofs.
Proceedings of the Hardware and Software: Verification and Testing, 2008

Finding the Rare Cube.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

Maximum Matchings in Regular Graphs of High Girth.
Electr. J. Comb., 2007

Rank Bounds and Integrality Gaps for Cutting Planes Procedures.
Theory of Computing, 2006

A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.
SIAM J. Discrete Math., 2006

Monotone Circuits for the Majority Function.
Proceedings of the Approximation, 2006

Computing unsatisfiable k-SAT instances with few occurrences per variable.
Theor. Comput. Sci., 2005

Simple permutations mix well.
Theor. Comput. Sci., 2005

A counterexample to a conjecture of Björner and Lovász on the chi-coloring complex.
J. Comb. Theory, Ser. B, 2005

A lower bound on the spectral radius of the universal cover of a graph.
J. Comb. Theory, Ser. B, 2005

Colorings of the d-regular infinite tree.
J. Comb. Theory, Ser. B, 2004

On codes from hypergraphs.
Eur. J. Comb., 2004

Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable.
Proceedings of the SAT 2004, 2004

Simple Permutations Mix Well.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

The Size of Bipartite Graphs with a Given Girth.
J. Comb. Theory, Ser. B, 2002

A Continuous Analogue of the Girth Problem.
J. Comb. Theory, Ser. B, 2002

The Moore Bound for Irregular Graphs.
Graphs and Combinatorics, 2002

Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem).
Discrete & Computational Geometry, 1996

Universal Traversal Sequences for Expander Graphs.
Inf. Process. Lett., 1993