Shlomo Hoory

Publication Activity (10 Years)

Years Active: 1993-2021
Publications (10 Years): 2

Top Topics

Differentially Private

Application Scenarios

Language Modeling

Top Venues

BMC Medical Informatics Decis. Mak.

EMNLP (Findings)

Publications

Shlomo Hoory, Amir Feder, Avichai Tendler, Sofia Erell, Alon Peled-Cohen, Itay Laish, Hootan Nakhost, Uri Stemmer, Ayelet Benjamini, Avinatan Hassidim, Yossi Matias
Learning and Evaluating a Differentially Private Pre-trained Language Model. EMNLP (Findings) (2021)
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
Customization scenarios for de-identification of clinical notes. BMC Medical Informatics Decis. Mak. 20 (1) (2020)
Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman
Reducing the size of resolution proofs in linear time. Int. J. Softw. Tools Technol. Transf. 13 (3) (2011)
Oded Fuhrmann, Shlomo Hoory
On Extending Bounded Proofs to Inductive Proofs. CAV (2009)
Alexander Gamburd, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, Bálint Virág
On the girth of random Cayley graphs. Random Struct. Algorithms 35 (1) (2009)
Alex Brodsky, Shlomo Hoory
Simple permutations mix even better. Random Struct. Algorithms 32 (3) (2008)
Shlomo Hoory, Oded Margalit
Finding the Rare Cube. ALT (2008)
Elad Yom-Tov, Rachel Tzoref, Shmuel Ur, Shlomo Hoory
Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections. ASE (2008)
Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman
Linear-Time Reductions of Resolution Proofs. Haifa Verification Conference (2008)
Abraham D. Flaxman, Shlomo Hoory
Maximum Matchings in Regular Graphs of High Girth. Electron. J. Comb. 14 (1) (2007)
Shlomo Hoory, Stefan Szeider
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. SIAM J. Discret. Math. 20 (2) (2006)
Shlomo Hoory, Avner Magen, Toniann Pitassi
Monotone Circuits for the Majority Function. APPROX-RANDOM (2006)
Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory Comput. 2 (4) (2006)
Shlomo Hoory, Nathan Linial
-coloring complex. J. Comb. Theory, Ser. B 95 (2) (2005)
Shlomo Hoory, Stefan Szeider
Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337 (1-3) (2005)
Shlomo Hoory
A lower bound on the spectral radius of the universal cover of a graph. J. Comb. Theory, Ser. B 93 (1) (2005)
Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff
Simple permutations mix well. Theor. Comput. Sci. 348 (2-3) (2005)
Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff
Simple Permutations Mix Well. ICALP (2004)
Shlomo Hoory, Nathan Linial
Colorings of the d-regular infinite tree. J. Comb. Theory, Ser. B 91 (2) (2004)
Yonatan Bilu, Shlomo Hoory
On codes from hypergraphs. Eur. J. Comb. 25 (3) (2004)
Shlomo Hoory, Stefan Szeider
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT (2004)
Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS (2003)
Shlomo Hoory
The Size of Bipartite Graphs with a Given Girth. J. Comb. Theory, Ser. B 86 (2) (2002)
Alon Amit, Shlomo Hoory, Nathan Linial
A Continuous Analogue of the Girth Problem. J. Comb. Theory, Ser. B 84 (2) (2002)
Noga Alon, Shlomo Hoory, Nathan Linial
The Moore Bound for Irregular Graphs. Graphs Comb. 18 (1) (2002)
Shlomo Hoory, Nathan Linial
Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem). Discret. Comput. Geom. 15 (4) (1996)
Shlomo Hoory, Avi Wigderson
Universal Traversal Sequences for Expander Graphs. Inf. Process. Lett. 46 (2) (1993)