Shlomo Hoory - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2021

Learning and Evaluating a Differentially Private Pre-trained Language ModelShlomo Hoory, Amir Feder, Avichai Tendler, Sofia Erell, Alon Peled-Cohen, Itay Laish, Hootan Nakhost, Uri Stemmer, Ayelet Benjamini, Avinatan Hassidim, Yossi Matias. emnlp 2021: 1178-1189 [doi]

2020

2011

Reducing the size of resolution proofs in linear timeOmer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman. STTT, 13(3):263-272, 2011. [doi]

2009

On Extending Bounded Proofs to Inductive ProofsOded Fuhrmann, Shlomo Hoory. cav 2009: 278-290 [doi]

On the girth of random Cayley graphsAlexander Gamburd, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, B. VirÃ¡g. rsa, 35(1):100-117, 2009. [doi]

2008

2007

Maximum Matchings in Regular Graphs of High GirthAbraham D. Flaxman, Shlomo Hoory. combinatorics, 14(1), 2007. [doi]

2006

Rank Bounds and Integrality Gaps for Cutting Planes ProceduresJoshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi. toc, 2(1):65-90, 2006. [doi]

Monotone Circuits for the Majority FunctionShlomo Hoory, Avner Magen, Toniann Pitassi. approx 2006: 410-425 [doi]

A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per VariableShlomo Hoory, Stefan Szeider. siamdm, 20(2):523-528, 2006. [doi]

2005

A lower bound on the spectral radius of the universal cover of a graphShlomo Hoory. JCT, 93(1):33-43, 2005. [doi]

A counterexample to a conjecture of Björner and Lovász on the ::::chi::::-coloring complexShlomo Hoory, Nathan Linial. JCT, 95(2):346-349, 2005. [doi]

Simple permutations mix wellShlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff. TCS, 348(2-3):251-261, 2005. [doi]

Computing unsatisfiable k-SAT instances with few occurrences per variableShlomo Hoory, Stefan Szeider. TCS, 337(1-3):347-359, 2005. [doi]

2004

2003

Rank Bounds and Integrality Gaps for Cutting Planes Procedures JoshuaJosh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi. focs 2003: 318 [doi]

2002

The Moore Bound for Irregular GraphsNoga Alon, Shlomo Hoory, Nathan Linial. gc, 18(1):53-57, 2002. [doi]

A Continuous Analogue of the Girth ProblemAlon Amit, Shlomo Hoory, Nathan Linial. JCT, 84(2):340-363, 2002. [doi]

The Size of Bipartite Graphs with a Given GirthShlomo Hoory. JCT, 86(2):215-220, 2002. [doi]

On graphs of high girth (נוספו שער, תקציר ותכן בעברית: על גרפים בעלי מותן גבוה.)Shlomo Hoory. PhD thesis, Hebrew University of Jerusalem, Israel, 2002. [doi]

1996

Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem)Shlomo Hoory, Nathan Linial. dcg, 15(4):467-479, 1996. [doi]

1993

Universal Traversal Sequences for Expander GraphsShlomo Hoory, Avi Wigderson. ipl, 46(2):67-69, 1993.

Sign in or sign up to see more results.

runs on WebDSL