Milena Mihail

Generating author description...

All published works

Action	Title	Year	Authors
+	Online Matching with High Probability	2021	Milena Mihail Thorben Tröbst
+	Graphic Realizations of Joint-Degree Matrices	2015	Georgios Amanatidis Bradley Green Milena Mihail
+	Graphic Realizations of Joint-Degree Matrices	2015	Georgios Amanatidis Bradley Green Milena Mihail
+	Efficient Generation ε-close to G(n,p) and Generalizations	2012	Antonio Blanca Milena Mihail
+	A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks	2006	Tomás Feder Adam Guetz Milena Mihail Amin Saberi
+ PDF Chat	Random Walks with Lookahead on Power Law Random Graphs	2006	Milena Mihail Amin Saberi Prasad Tetali
+	On certain connectivity properties of the internet topology	2005	Milena Mihail Christos H. Papadimitriou Amin Saberi
+	On certain connectivity properties of the Internet topology	2004	Milena Mihail Costas Papadimitriou Amin Saberi
+	Conductance and congestion in power law graphs	2003	Christos Gkantsidis Milena Mihail Amin Saberi
+	Conductance and congestion in power law graphs	2003	Christos Gkantsidis Milena Mihail Amin Saberi
+	Conductance and congestion in power law graphs	2003	Christos Gkantsidis Milena Mihail Amin Saberi
+	On the Eigenvalue Power Law	2002	Milena Mihail Christos H. Papadimitriou
+	On the number of Eulerian orientations of a graph	1996	Milena Mihail P. Winkler
+	Monte Carlo and Markov Chain techniques for network reliability and sampling	1995	Adam L. Buchsbaum Milena Mihail
+	On the expansion of combinatorial polytopes	1992	Milena Mihail
+	Conductance and convergence of Markov chains-a combinatorial treatment of expanders	1989	Milena Mihail
+	Polytopes, permanents and graphs with large factors	1988	Paul Dagum Michael Luby Milena Mihail Umesh Vazirani

Common Coauthors

Coauthor	Papers Together
Amin Saberi	7
Christos Gkantsidis	3
Georgios Amanatidis	2
Christos H. Papadimitriou	2
Bradley Green	1
Prasad Tetali	1
Thorben Tröbst	1
Umesh Vazirani	1
Costas Papadimitriou	1
Michael Luby	1
Adam Guetz	1
Tomás Feder	1
Bradley Green	1
Adam L. Buchsbaum	1
Antonio Blanca	1
Paul Dagum	1
P. Winkler	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	A Random Graph Model for Power Law Graphs	2001	William Aiello Fan Chung Linyuan Lü	5
+ PDF Chat	Emergence of Scaling in Random Networks	1999	Albert‐László Barabási Réka Albert	5
+	How hard is it to marry at random? (On the approximation of the permanent)	1986	Arndt Bröder	5
+ PDF Chat	The degree sequence of a scale‐free random graph process	2001	Béla Bollobás Oliver Riordan Joel Spencer Gábor Tusnády	5
+	Random Graphs	2001	Béla Bollobás	4
+ PDF Chat	A random graph model for massive graphs	2000	William Aiello Fan Chung Linyuan Lü	4
+	On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing	1987	David Aldous	4
+ PDF Chat	Approximate counting, uniform generation and rapidly mixing Markov chains	1989	Alistair Sinclair Mark Jerrum	4
+ PDF Chat	The Average Distance in a Random Graph with Given Expected Degrees	2004	Fan Chung Linyuan Lü	4
+ PDF Chat	The Size of the Giant Component of a Random Graph with a Given Degree Sequence	1998	Michael Molloy Bruce Reed	3
+	Polytopes, permanents and graphs with large factors	1988	Paul Dagum Michael Luby Milena Mihail Umesh Vazirani	3
+	Random generation of combinatorial structures from a uniform distribution	1986	Mark Jerrum Leslie G. Valiant Vijay V. Vazirani	3
+ PDF Chat	Eigenvalues and expanders	1986	Ilan Alon	3
+	A General Model of Undirected Web Graphs	2001	Colin Cooper Alan Frieze	3
+	Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved	1988	Mark Jerrum Alistair Sinclair	3
+	Connected Components in Random Graphs with Given Expected Degree Sequences	2002	Fan Chung Linyuan Lü	3
+ PDF Chat	Search in power-law networks	2001	Lada A. Adamic Rajan M. Lukose Amit Puniyani Bernardo A. Huberman	3
+	The Complexity of Enumeration and Reliability Problems	1979	Leslie G. Valiant	3
+	Random graph dynamics	2007	Richard Durrett	2
+ PDF Chat	Spectra of random graphs with given expected degrees	2003	Fan Chung Linyuan Lü Van Vu	2
+	Conductance and congestion in power law graphs	2003	Christos Gkantsidis Milena Mihail Amin Saberi	2
+ PDF Chat	Random Evolution in Massive Graphs	2002	William Aiello Fan Chung Linyuan Lü	2
+	Ramanujan graphs	1988	Alexander Lubotzky Ralph S. Phillips Peter Sarnak	2
+	The cover time of sparse random graphs	2006	Colin Cooper Alan Frieze	2
+	The complexity of computing the permanent	1979	Leslie G. Valiant	2
+ PDF Chat	Attack vulnerability of complex networks	2002	Petter Holme Beom Jun Kim Chang No Yoon Seung Kee Han	2
+	Conductance and convergence of Markov chains-a combinatorial treatment of expanders	1989	Milena Mihail	2
+	Approximating the permanent of graphs with large factors	1992	Paul Dagum Michael Luby	2
+	The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume	2002	László Lovász Miklós Simonovits	2
+	The average distances in random graphs with given expected degrees	2002	Fan Chung Linyuan Lü	2
+	Conductance and congestion in power law graphs	2003	Christos Gkantsidis Milena Mihail Amin Saberi	2
+	Submodular functions, matroids, and certain polyhedra	1970	Jack Edmonds	2
+	Fast uniform generation of regular graphs	1990	Mark Jerrum Alistair Sinclair	2
+	On the Eigenvalue Power Law	2002	Milena Mihail Christos H. Papadimitriou	2
+ PDF Chat	Edge overload breakdown in evolving networks	2002	Petter Holme	2
+	Monte-Carlo approximation algorithms for enumeration problems	1989	Richard M. Karp Michael Luby Neal Madras	2
+	The Diameter of a Scale-Free Random Graph	2004	Bélaa Bollobás Oliver Riordan	2
+	The diameter of random regular graphs	1982	Béla Bollobás W. Fernandez de la Véga	2
+	Spectral Graph Theory	1996	Fan Chung	2
+	Generating random spanning trees	1989	Arndt Bröder	2
+	The Diameter of Sparse Random Graphs	2001	Fan Chung Linyuan Lü	2
+	A critical point for random graphs with a given degree sequence	1995	Michael Molloy Bruce Reed	2
+	Bounds on the cover time	1989	Andrei Broder Anna R. Karlin	2
+	Maximum matching and a polyhedron with 0,1-vertices	1965	Jack Edmonds	2
+ PDF Chat	Constructing and sampling graphs with a prescribed joint degree distribution	2012	Isabelle Stanton Ali Pınar	1
+ PDF Chat	Spectra and eigenvectors of scale-free networks	2001	K.-I. Goh B. Kahng D. Kim	1
+	On realizations of a joint degree matrix	2014	Éva Czabarka Aaron Dutle Péter L. Erdős István Miklós	1
+ PDF Chat	Two-dimensional monomer-dimer systems are computationally intractable	1990	Mark Jerrum	1
+	A random polynomial time algorithm for approximating the volume of convex bodies	1989	Martin Dyer Alan Frieze	1
+ PDF Chat	Bounds on the 𝐿² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality	1988	Gregory F. Lawler Alan D. Sokal	1