The non-backtracking spectrum of the universal cover of a graph von ANGEL, OMER, FRIEDMAN, JOEL, HOORY, SHLOMO

Volltext

Customization scenarios for de-identification of clinical notes von Hartman, Tzvika, Howell, Michael D, Dean, Jeff, Hoory, Shlomo, Slyper, Ronit, Laish, Itay, Gilon, Oren, Vainstein, Danny, Corrado, Greg, Chou, Katherine, Po, Ming Jack, Williams, Jutta, Ellis, Scott, Bee, Gavin, Hassidim, Avinatan, Amira, Rony, Beryozkin, Genady, Szpektor, Idan, Matias, Yossi

Volltext

A lower bound on the spectral radius of the universal cover of a graph von Hoory, Shlomo

Volltext

Simple permutations mix even better von Brodsky, Alex, Hoory, Shlomo

Volltext

On the Girth of Graph Lifts von Hoory, Shlomo

Volltext bestellen

Entropy and the growth rate of universal covering trees von Eisner, Idan, Hoory, Shlomo

Volltext bestellen

Expander graphs and their applications von Hoory, Shlomo, Linial, Nathan, Wigderson, Avi

Volltext

The Size of Bipartite Graphs with a Given Girth von Hoory, Shlomo

Volltext

On the Girth of Graph Lifts von Hoory, Shlomo

Volltext

A Note on Unsatisfiable k -CNF Formulas with Few Occurrences per Variable von Hoory, Shlomo, Szeider, Stefan

Volltext

Maximum Matchings in Regular Graphs of High Girth von Flaxman, Abraham D., Hoory, Shlomo

Volltext

An infinite family of counterexamples to a conjecture on distance magic labeling von Ebrahem, Ehab, Hoory, Shlomo, Kotlar, Dani

Volltext bestellen

Entropy and the growth rate of universal covering trees von Eisner, Idan, Hoory, Shlomo

Volltext

Monotone Circuits for the Majority Function von Hoory, Shlomo, Magen, Avner, Pitassi, Toniann

Volltext

A note on unsatisfiable κ-CNF formulas with few occurrences per variable von HOORY, Shlomo, SZEIDER, Stefan

Volltext

Computing unsatisfiable k -SAT instances with few occurrences per variable von Hoory, Shlomo, Szeider, Stefan

Volltext

The Moore Bound for Irregular Graphs von Alon, Noga, Hoory, Shlomo, Linial, Nathan

Volltext

Reducing the size of resolution proofs in linear time von Bar-Ilan, Omer, Fuhrmann, Oded, Hoory, Shlomo, Shacham, Ohad, Strichman, Ofer

Volltext

Simple permutations mix well von Hoory, Shlomo, Magen, Avner, Myers, Steven, Rackoff, Charles

Volltext

Reducing the size of resolution proofs in linear time: Special Section on HVC 2008 von BAR-ILAN, Omer, FUHRMANN, Oded, HOORY, Shlomo, SHACHAM, Ohad, STRICHMAN, Ofer

Volltext