#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1965

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up inâ€¦ (More)

- Noga Alon, Shlomo Hoory, Nathan Linial
- Graphs and Combinatorics
- 2002

What is the largest number of edges in a graph of order n and girth g? For dregular graphs, essentially the best known answer is provided by the Moore bound. This result is extended here to coverâ€¦ (More)

- Shlomo Hoory
- J. Comb. Theory, Ser. B
- 2002

- Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman
- Haifa Verification Conference
- 2008

DPLL-based SAT solvers progress by implicitly applying binary resolution. The resolution proofs that they generate are used, after the SAT solverâ€™s run has terminated, for various purposes. Mostâ€¦ (More)

- Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
- 2003

We present a new method for proving rank lower bounds for the cutting planes procedures of Gomory and ChvÃ¡tal (GC) and LovÃ¡sz and Schrijver (LS), when viewed as proof systems for unsatisfiability. Weâ€¦ (More)

- Shlomo Hoory, Avi Wigderson
- Inf. Process. Lett.
- 1993

Graph reachability is a key problem in the study of various logarithmic space complexity classes. Its version for directed graphs is logspace complete for NSPACE(logn), and hence if proved to be inâ€¦ (More)

- Shlomo Hoory, Stefan Szeider
- SIAM J. Discrete Math.
- 2006

The (k, s)-SAT problem is the satisfiability problem restricted to instances where each clause has exactly k literals and every variable occurs at most s times. It is known that there exists aâ€¦ (More)

- Yonatan Bilu, Shlomo Hoory
- Eur. J. Comb.
- 2004

We propose a new family of asymptotically good binary codes, generalizing previous constructions of expander codes to -uniform hypergraphs. We also describe an efficient decoding algorithm for theseâ€¦ (More)

- Shlomo Hoory, Stefan Szeider
- SAT
- 2004

(k, s)-SAT is the propositional satisfiability problem restricted to instances where each clause has exactly k distinct literals and every variable occurs at most s times. It is known that thereâ€¦ (More)

- Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
- ICALP
- 2004

We study the random composition of a small family of O(n3) simple permutations on {0, 1}n. Specifically we ask what is the number of compositions needed to achieve a permutation that is close toâ€¦ (More)