Zur Luria

According to our database, Zur Luria authored at least 12 papers between 2010 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

On Simple Connectivity of Random 2-Complexes.

Zur Luria, Yuval Peled

Discret. Comput. Geom., 2022

A Lower Bound for the n-queens Problem.

Michael Simkin, Zur Luria

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Perfect matchings in random subgraphs of regular bipartite graphs.

Roman Glebov, Zur Luria, Michael Simkin

J. Graph Theory, 2021

2019

On the threshold problem for Latin boxes.

Zur Luria, Michael Simkin

Random Struct. Algorithms, 2019

Random Steiner systems and bounded degree coboundary expanders of every dimension.

Alexander Lubotzky, Zur Luria, Ron Rosenthal

Discret. Comput. Geom., 2019

2018

On groups and simplicial complexes.

Alexander Lubotzky, Zur Luria, Ron Rosenthal

Eur. J. Comb., 2018

2016

On the maximum number of Latin transversals.

Roman Glebov, Zur Luria

J. Comb. Theory, Ser. A, 2016

2014

High dimensional combinatorics (שער נוסף בעברית: קומבינטוריקה במימדים גבוהים.).

Zur Luria

PhD thesis, 2014

On the Vertices of the d-Dimensional Birkhoff Polytope.

Nathan Linial, Zur Luria

Discret. Comput. Geom., 2014

An upper bound on the number of high-dimensional permutations.

Nathan Linial, Zur Luria

Comb., 2014

2013

An upper bound on the number of Steiner triple systems.

Nathan Linial, Zur Luria

Random Struct. Algorithms, 2013

2010

An approximation algorithm for counting contingency tables.

Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong

Random Struct. Algorithms, 2010