Asaf Nachmias

According to our database, Asaf Nachmias authored at least 10 papers between 2004 and 2026.

Collaborative distances:

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

2026

A Tight Bound on Localization of Electrical Flows.

Ori Gurel-Gurevich, Asaf Nachmias, Sushant Sachdeva

CoRR, May, 2026

2022

The diameter of the uniform spanning tree of dense graphs.

Noga Alon, Asaf Nachmias, Matan Shalev

Comb. Probab. Comput., 2022

2020

Slightly subcritical hypercube percolation.

Tim Hulshof, Asaf Nachmias

Random Struct. Algorithms, 2020

2016

Random walks on stochastic hyperbolic half planar triangulations.

Omer Angel, Asaf Nachmias, Gourab Ray

Random Struct. Algorithms, 2016

2011

The Evolution of the Cover Time.

Martin T. Barlow, Jian Ding, Asaf Nachmias, Yuval Peres

Comb. Probab. Comput., 2011

2010

Critical percolation on random regular graphs.

Asaf Nachmias, Yuval Peres

Random Struct. Algorithms, 2010

2007

Testing the Expansion of a Graph.

Asaf Nachmias, Asaf Shapira

Electron. Colloquium Comput. Complex., 2007

Mixing Time Power Laws at Criticality.

Yun Long, Asaf Nachmias, Yuval Peres

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

2006

Coloring complete bipartite graphs from random lists.

Michael Krivelevich, Asaf Nachmias

Random Struct. Algorithms, 2006

2004

Colouring powers of cycles from random lists.

Michael Krivelevich, Asaf Nachmias

Eur. J. Comb., 2004