default search action
Shlomo Hoory
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c9]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: 1178-1189 - 2020
- [j18]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): 14 (2020)
2010 – 2019
- 2011
- [j17]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): 263-272 (2011)
2000 – 2009
- 2009
- [j16]Alexander Gamburd, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, Bálint Virág:
On the girth of random Cayley graphs. Random Struct. Algorithms 35(1): 100-117 (2009) - [c8]Oded Fuhrmann, Shlomo Hoory:
On Extending Bounded Proofs to Inductive Proofs. CAV 2009: 278-290 - 2008
- [j15]Alex Brodsky, Shlomo Hoory:
Simple permutations mix even better. Random Struct. Algorithms 32(3): 274-289 (2008) - [c7]Shlomo Hoory, Oded Margalit:
Finding the Rare Cube. ALT 2008: 344-358 - [c6]Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman:
Linear-Time Reductions of Resolution Proofs. Haifa Verification Conference 2008: 114-128 - [c5]Elad Yom-Tov
Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections. ASE 2008: 307-316 - 2007
- [j14]Abraham D. Flaxman, Shlomo Hoory:
Maximum Matchings in Regular Graphs of High Girth. Electron. J. Comb. 14(1) (2007) - 2006
- [j13]Shlomo Hoory, Stefan Szeider
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. SIAM J. Discret. Math. 20(2): 523-528 (2006) - [j12]Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory Comput. 2(4): 65-90 (2006) - [c4]Shlomo Hoory, Avner Magen, Toniann Pitassi:
Monotone Circuits for the Majority Function. APPROX-RANDOM 2006: 410-425 - 2005
- [j11]Shlomo Hoory:
A lower bound on the spectral radius of the universal cover of a graph. J. Comb. Theory B 93(1): 33-43 (2005) - [j10]Shlomo Hoory, Nathan Linial:
A counterexample to a conjecture of Björner and Lovász on the chi-coloring complex. J. Comb. Theory B 95(2): 346-349 (2005) - [j9]Shlomo Hoory, Stefan Szeider
Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337(1-3): 347-359 (2005) - [j8]Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff:
Simple permutations mix well. Theor. Comput. Sci. 348(2-3): 251-261 (2005) - 2004
- [j7]Yonatan Bilu, Shlomo Hoory:
On codes from hypergraphs. Eur. J. Comb. 25(3): 339-354 (2004) - [j6]Shlomo Hoory, Nathan Linial:
Colorings of the d-regular infinite tree. J. Comb. Theory B 91(2): 161-167 (2004) - [c3]Shlomo Hoory, Avner Magen, Steven A. Myers, Charles Rackoff:
Simple Permutations Mix Well. ICALP 2004: 770-781 - [c2]Shlomo Hoory, Stefan Szeider:
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004 - 2003
- [c1]Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS 2003: 318-327 - 2002
- [b1]Shlomo Hoory:
On graphs of high girth (נוספו שער, תקציר ותכן בעברית: על גרפים בעלי מותן גבוה.). Hebrew University of Jerusalem, Israel, 2002 - [j5]Noga Alon, Shlomo Hoory, Nathan Linial:
The Moore Bound for Irregular Graphs. Graphs Comb. 18(1): 53-57 (2002) - [j4]Alon Amit, Shlomo Hoory, Nathan Linial:
A Continuous Analogue of the Girth Problem. J. Comb. Theory B 84(2): 340-363 (2002) - [j3]Shlomo Hoory:
The Size of Bipartite Graphs with a Given Girth. J. Comb. Theory B 86(2): 215-220 (2002)
1990 – 1999
- 1996
- [j2]Shlomo Hoory, Nathan Linial:
Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem). Discret. Comput. Geom. 15(4): 467-479 (1996) - 1993
- [j1]Shlomo Hoory, Avi Wigderson:
Universal Traversal Sequences for Expander Graphs. Inf. Process. Lett. 46(2): 67-69 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: