Shlomo Hoory

Orcid: 0000-0002-8166-4428

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Learning and Evaluating a Differentially Private Pre-trained Language Model.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2021, 2021

2020
Customization scenarios for de-identification of clinical notes.
BMC Medical Informatics Decis. Mak., 2020

2011
Reducing the size of resolution proofs in linear time.
Int. J. Softw. Tools Technol. Transf., 2011

2009
On the girth of random Cayley graphs.
Random Struct. Algorithms, 2009

On Extending Bounded Proofs to Inductive Proofs.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Simple permutations mix even better.
Random Struct. Algorithms, 2008

Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections.
Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering (ASE 2008), 2008

Linear-Time Reductions of Resolution Proofs.
Proceedings of the Hardware and Software: Verification and Testing, 2008

Finding the Rare Cube.
Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007
Maximum Matchings in Regular Graphs of High Girth.
Electron. J. Comb., 2007

2006
Rank Bounds and Integrality Gaps for Cutting Planes Procedures.
Theory Comput., 2006

A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.
SIAM J. Discret. Math., 2006

Monotone Circuits for the Majority Function.
Proceedings of the Approximation, 2006

2005
Computing unsatisfiable k-SAT instances with few occurrences per variable.
Theor. Comput. Sci., 2005

Simple permutations mix well.
Theor. Comput. Sci., 2005

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

A lower bound on the spectral radius of the universal cover of a graph.
J. Comb. Theory B, 2005

2004
Colorings of the d-regular infinite tree.
J. Comb. Theory B, 2004

On codes from hypergraphs.
Eur. J. Comb., 2004

2003
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

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

The Size of Bipartite Graphs with a Given Girth.
J. Comb. Theory B, 2002

A Continuous Analogue of the Girth Problem.
J. Comb. Theory B, 2002

The Moore Bound for Irregular Graphs.
Graphs Comb., 2002

1996
Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem).
Discret. Comput. Geom., 1996

1993
Universal Traversal Sequences for Expander Graphs.
Inf. Process. Lett., 1993


  Loading...