Shlomo Hoory

According to our database, Shlomo Hoory authored at least 26 papers between 1993 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2021

Learning and Evaluating a Differentially Private Pre-trained Language Model.

Shlomo Hoory, Amir Feder, Avichai Tendler, Sofia Erell, Alon Peled-Cohen, Itay Laish, Hootan Nakhost, Uri Stemmer, Ayelet Benjamini, Avinatan Hassidim, Yossi Matias

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2021, 2021

2020

Customization scenarios for de-identification of clinical notes.

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

BMC Medical Informatics Decis. Mak., 2020

2011

Reducing the size of resolution proofs in linear time.

Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman

Int. J. Softw. Tools Technol. Transf., 2011

2009

On the girth of random Cayley graphs.

Alexander Gamburd, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, Bálint Virág

Random Struct. Algorithms, 2009

On Extending Bounded Proofs to Inductive Proofs.

Oded Fuhrmann, Shlomo Hoory

Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008

Simple permutations mix even better.

Alex Brodsky, Shlomo Hoory

Random Struct. Algorithms, 2008

Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections.

Elad Yom-Tov, Rachel Tzoref, Shmuel Ur, Shlomo Hoory

Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering (ASE 2008), 2008

Linear-Time Reductions of Resolution Proofs.

Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman

Proceedings of the Hardware and Software: Verification and Testing, 2008

Finding the Rare Cube.

Shlomo Hoory, Oded Margalit

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007

Maximum Matchings in Regular Graphs of High Girth.

Abraham D. Flaxman, Shlomo Hoory

Electron. J. Comb., 2007

2006

Rank Bounds and Integrality Gaps for Cutting Planes Procedures.

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

Theory Comput., 2006

A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.

Shlomo Hoory, Stefan Szeider

SIAM J. Discret. Math., 2006

Monotone Circuits for the Majority Function.

Shlomo Hoory, Avner Magen, Toniann Pitassi

Proceedings of the Approximation, 2006

2005

Computing unsatisfiable k-SAT instances with few occurrences per variable.

Shlomo Hoory, Stefan Szeider

Theor. Comput. Sci., 2005

Simple permutations mix well.

Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff

Theor. Comput. Sci., 2005

A counterexample to a conjecture of Björner and Lovász on the <i>chi</i>-coloring complex.

Shlomo Hoory, Nathan Linial

J. Comb. Theory, Ser. B, 2005

A lower bound on the spectral radius of the universal cover of a graph.

Shlomo Hoory

J. Comb. Theory, Ser. B, 2005

2004

Colorings of the d-regular infinite tree.

Shlomo Hoory, Nathan Linial

J. Comb. Theory, Ser. B, 2004

On codes from hypergraphs.

Yonatan Bilu, Shlomo Hoory

Eur. J. Comb., 2004

2003

Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.

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

Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002

On graphs of high girth (נוספו שער, תקציר ותכן בעברית: על גרפים בעלי מותן גבוה.).

Shlomo Hoory

PhD thesis, 2002

The Size of Bipartite Graphs with a Given Girth.

Shlomo Hoory

J. Comb. Theory, Ser. B, 2002

A Continuous Analogue of the Girth Problem.

Alon Amit, Shlomo Hoory, Nathan Linial

J. Comb. Theory, Ser. B, 2002

The Moore Bound for Irregular Graphs.

Noga Alon, Shlomo Hoory, Nathan Linial

Graphs Comb., 2002

1996

Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem).

Shlomo Hoory, Nathan Linial

Discret. Comput. Geom., 1996

1993

Universal Traversal Sequences for Expander Graphs.

Shlomo Hoory, Avi Wigderson

Inf. Process. Lett., 1993