Zur Luria

12 papers A* 1Journal 10
YearRankTypeTitle / Venue / Authors
2022 A* conf
A Lower Bound for the n-queens Problem.
SODA
Michael Simkin, Zur Luria
2022 J jnl
On Simple Connectivity of Random 2-Complexes.
Discret. Comput. Geom.
Zur Luria, Yuval Peled
2021 J jnl
Perfect matchings in random subgraphs of regular bipartite graphs.
J. Graph Theory
Roman Glebov, Zur Luria, Michael Simkin
2019 J jnl
On the threshold problem for Latin boxes.
Random Struct. Algorithms
Zur Luria, Michael Simkin
2019 J jnl
Random Steiner systems and bounded degree coboundary expanders of every dimension.
Discret. Comput. Geom.
Alexander Lubotzky, Zur Luria, Ron Rosenthal
2018 J jnl
On groups and simplicial complexes.
Eur. J. Comb.
Alexander Lubotzky, Zur Luria, Ron Rosenthal
2016 J jnl
On the maximum number of Latin transversals.
J. Comb. Theory A
Roman Glebov, Zur Luria
2014 J jnl
An upper bound on the number of high-dimensional permutations.
Comb.
Nathan Linial, Zur Luria
2014 — —
High dimensional combinatorics (שער נוסף בעברית: קומבינטוריקה במימדים גבוהים.).
Zur Luria
2014 J jnl
On the Vertices of the d-Dimensional Birkhoff Polytope.
Discret. Comput. Geom.
Nathan Linial, Zur Luria
2013 J jnl
An upper bound on the number of Steiner triple systems.
Random Struct. Algorithms
Nathan Linial, Zur Luria
2010 J jnl
An approximation algorithm for counting contingency tables.
Random Struct. Algorithms
Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong