The SCEAS System
| |||||||

## Search the dblp DataBase
Shlomo Hoory:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Shlomo Hoory, Avner Magen, Toniann Pitassi
**Monotone Circuits for the Majority Function.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:410-425 [Conf] - Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
**Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:318-0 [Conf] - Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
**Simple Permutations Mix Well.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:770-781 [Conf] - Shlomo Hoory, Stefan Szeider
**Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable.**[Citation Graph (0, 0)][DBLP] SAT, 2004, pp:- [Conf] - Shlomo Hoory, Nathan Linial
**Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem).**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1996, v:15, n:4, pp:467-479 [Journal] - Yonatan Bilu, Shlomo Hoory
**On codes from hypergraphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2004, v:25, n:3, pp:339-354 [Journal] - Noga Alon, Shlomo Hoory, Nathan Linial
**The Moore Bound for Irregular Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:1, pp:53-57 [Journal] - Shlomo Hoory, Avi Wigderson
**Universal Traversal Sequences for Expander Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:46, n:2, pp:67-69 [Journal] - Alon Amit, Shlomo Hoory, Nathan Linial
**A Continuous Analogue of the Girth Problem.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2002, v:84, n:2, pp:340-363 [Journal] - Shlomo Hoory
**The Size of Bipartite Graphs with a Given Girth.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:215-220 [Journal] - Shlomo Hoory
**A lower bound on the spectral radius of the universal cover of a graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:93, n:1, pp:33-43 [Journal] - Shlomo Hoory, Nathan Linial
**Colorings of the d-regular infinite tree.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:91, n:2, pp:161-167 [Journal] - Shlomo Hoory, Nathan Linial
**A counterexample to a conjecture of Björner and Lovász on the**[Citation Graph (0, 0)][DBLP]*chi*-coloring complex. J. Comb. Theory, Ser. B, 2005, v:95, n:2, pp:346-349 [Journal] - Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
**Simple permutations mix well.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:348, n:2-3, pp:251-261 [Journal] - Shlomo Hoory, Stefan Szeider
**Computing unsatisfiable k-SAT instances with few occurrences per variable.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:337, n:1-3, pp:347-359 [Journal] **Finding the Rare Cube.**[Citation Graph (, )][DBLP]**On Extending Bounded Proofs to Inductive Proofs.**[Citation Graph (, )][DBLP]**Linear-Time Reductions of Resolution Proofs.**[Citation Graph (, )][DBLP]**Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections.**[Citation Graph (, )][DBLP]**Maximum Matchings in Regular Graphs of High Girth.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |