Shlomo Hoory

2008
22	EE	Shlomo Hoory, Oded Margalit: Finding the Rare Cube. ALT 2008: 344-358
21	EE	Elad Yom-Tov, Rachel Tzoref, Shmuel Ur, Shlomo Hoory: Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections. ASE 2008: 307-316
20	EE	Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman: Linear-Time Reductions of Resolution Proofs. Haifa Verification Conference 2008: 114-128
19	EE	Alex Brodsky, Shlomo Hoory: Simple permutations mix even better. Random Struct. Algorithms 32(3): 274-289 (2008)
2007
18	EE	Abraham D. Flaxman, Shlomo Hoory: Maximum Matchings in Regular Graphs of High Girth. Electr. J. Comb. 14(1): (2007)
2006
17	EE	Shlomo Hoory, Avner Magen, Toniann Pitassi: Monotone Circuits for the Majority Function. APPROX-RANDOM 2006: 410-425
16	EE	Shlomo Hoory, Stefan Szeider: A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. SIAM J. Discrete Math. 20(2): 523-528 (2006)
15	EE	Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi: Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory of Computing 2(1): 65-90 (2006)
2005
14	EE	Shlomo Hoory: A lower bound on the spectral radius of the universal cover of a graph. J. Comb. Theory, Ser. B 93(1): 33-43 (2005)
13	EE	Shlomo Hoory, Nathan Linial: A counterexample to a conjecture of Björner and Lovász on the chi-coloring complex. J. Comb. Theory, Ser. B 95(2): 346-349 (2005)
12	EE	Shlomo Hoory, Stefan Szeider: Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337(1-3): 347-359 (2005)
11	EE	Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff: Simple permutations mix well. Theor. Comput. Sci. 348(2-3): 251-261 (2005)
2004
10	EE	Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff: Simple Permutations Mix Well. ICALP 2004: 770-781
9	EE	Shlomo Hoory, Stefan Szeider: Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004
8	EE	Yonatan Bilu, Shlomo Hoory: On codes from hypergraphs. Eur. J. Comb. 25(3): 339-354 (2004)
7	EE	Shlomo Hoory, Nathan Linial: Colorings of the d-regular infinite tree. J. Comb. Theory, Ser. B 91(2): 161-167 (2004)
2003
6	EE	Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi: Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS 2003: 318-
2002
5	EE	Noga Alon, Shlomo Hoory, Nathan Linial: The Moore Bound for Irregular Graphs. Graphs and Combinatorics 18(1): 53-57 (2002)
4	EE	Alon Amit, Shlomo Hoory, Nathan Linial: A Continuous Analogue of the Girth Problem. J. Comb. Theory, Ser. B 84(2): 340-363 (2002)
3	EE	Shlomo Hoory: The Size of Bipartite Graphs with a Given Girth. J. Comb. Theory, Ser. B 86(2): 215-220 (2002)
1996
2	EE	Shlomo Hoory, Nathan Linial: Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem). Discrete & Computational Geometry 15(4): 467-479 (1996)
1993
1		Shlomo Hoory, Avi Wigderson: Universal Traversal Sequences for Expander Graphs. Inf. Process. Lett. 46(2): 67-69 (1993)

Coauthor Index

1	Noga Alon	[5]
2	Alon Amit	[4]
3	Omer Bar-Ilan	[20]
4	Yonatan Bilu	[8]
5	Alex Brodsky (Alexander O. Brodsky, Alexander Brodsky)	[19]
6	Joshua Buresh-Oppenheim (Josh Buresh-Oppenheim)	[6] [15]
7	Abraham D. Flaxman (Abraham Flaxman)	[18]
8	Oded Fuhrmann	[20]
9	Nicola Galesi	[6] [15]
10	Nathan Linial (Nati Linial)	[2] [4] [5] [7] [13]
11	Avner Magen	[6] [10] [11] [15] [17]
12	Oded Margalit	[22]
13	Steven Myers	[10] [11]
14	Toniann Pitassi	[6] [15] [17]
15	Charles Rackoff	[10] [11]
16	Ohad Shacham	[20]
17	Ofer Strichman	[20]
18	Stefan Szeider	[9] [12] [16]
19	Rachel Tzoref	[21]
20	Shmuel Ur	[21]
21	Avi Wigderson	[1]
22	Elad Yom-Tov	[21]

Colors in the list of coauthors