Shlomo Hoory

29 papers A* 4A 1B 1Journal 19Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
An Infinite Family of Counterexamples to a Conjecture on Distance Magic Labeling.
Exp. Math.
Ehab Ebrahem, Shlomo Hoory, Dani Kotlar
2021 — conf
Learning and Evaluating a Differentially Private Pre-trained Language Model.
EMNLP (Findings)
Shlomo Hoory, Amir Feder, Avichai Tendler, Sofia Erell, Alon Peled-Cohen, Itay Laish, Hootan Nakhost, Uri Stemmer, Ayelet Benjamini, Avinatan Hassidim, Yossi Matias
2020 J jnl
Customization scenarios for de-identification of clinical notes.
BMC Medical Informatics Decis. Mak.
Tzvika Hartman, Michael D. Howell, Jeff Dean, Shlomo Hoory, Ronit Slyper, Itay Laish, Oren Gilon, Danny Vainstein, Greg Corrado, Katherine Chou, Ming Jack Po, Jutta Williams, Scott Ellis, Gavin Bee, Avinatan Hassidim, Rony Amira, Genady Beryozkin, Idan Szpektor, Yossi Matias
2011 J jnl
Reducing the size of resolution proofs in linear time.
Int. J. Softw. Tools Technol. Transf.
Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman
2009 A* conf
On Extending Bounded Proofs to Inductive Proofs.
CAV
Oded Fuhrmann, Shlomo Hoory
2009 J jnl
On the girth of random Cayley graphs.
Random Struct. Algorithms
Alexander Gamburd, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, Bálint Virág
2008 A* conf
Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections.
ASE
Elad Yom-Tov, Rachel Tzoref, Shmuel Ur, Shlomo Hoory
2008 B conf
Finding the Rare Cube.
ALT
Shlomo Hoory, Oded Margalit
2008 — conf
Linear-Time Reductions of Resolution Proofs.
Haifa Verification Conference
Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman
2008 J jnl
Simple permutations mix even better.
Random Struct. Algorithms
Alex Brodsky, Shlomo Hoory
2007 J jnl
Maximum Matchings in Regular Graphs of High Girth.
Electron. J. Comb.
Abraham D. Flaxman, Shlomo Hoory
2006 J jnl
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.
SIAM J. Discret. Math.
Shlomo Hoory, Stefan Szeider
2006 — conf
Monotone Circuits for the Majority Function.
APPROX-RANDOM
Shlomo Hoory, Avner Magen, Toniann Pitassi
2006 J jnl
Rank Bounds and Integrality Gaps for Cutting Planes Procedures.
Theory Comput.
Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
2005 J jnl
A counterexample to a conjecture of Björner and Lovász on the
J. Comb. Theory B
Shlomo Hoory, Nathan Linial
2005 J jnl
A lower bound on the spectral radius of the universal cover of a graph.
J. Comb. Theory B
Shlomo Hoory
2005 J jnl
Computing unsatisfiable k-SAT instances with few occurrences per variable.
Theor. Comput. Sci.
Shlomo Hoory, Stefan Szeider
2005 J jnl
Simple permutations mix well.
Theor. Comput. Sci.
Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff
2004 J jnl
Colorings of the d-regular infinite tree.
J. Comb. Theory B
Shlomo Hoory, Nathan Linial
2004 A conf
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable.
SAT
Shlomo Hoory, Stefan Szeider
2004 J jnl
On codes from hypergraphs.
Eur. J. Comb.
Yonatan Bilu, Shlomo Hoory
2004 A* conf
Simple Permutations Mix Well.
ICALP
Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff
2003 A* conf
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.
FOCS
Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
2002 J jnl
A Continuous Analogue of the Girth Problem.
J. Comb. Theory B
Alon Amit, Shlomo Hoory, Nathan Linial
2002 — —
On graphs of high girth (נוספו שער, תקציר ותכן בעברית: על גרפים בעלי מותן גבוה.).
Shlomo Hoory
2002 J jnl
The Moore Bound for Irregular Graphs.
Graphs Comb.
Noga Alon, Shlomo Hoory, Nathan Linial
2002 J jnl
The Size of Bipartite Graphs with a Given Girth.
J. Comb. Theory B
Shlomo Hoory
1996 J jnl
Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem).
Discret. Comput. Geom.
Shlomo Hoory, Nathan Linial
1993 J jnl
Universal Traversal Sequences for Expander Graphs.
Inf. Process. Lett.
Shlomo Hoory, Avi Wigderson