According to our database1, Milena Mihail authored at least 38 papers between 1988 and 2018.
Legend:Book In proceedings Article PhD thesis Other
Connected realizations of joint-degree matrices.
Discret. Appl. Math., 2018
Cycles in Zero-Sum Differential Games and Biological Diversity.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018
Graphic Realizations of Joint-Degree Matrices.
Efficient Generation ε-close to G(n,p) and Generalizations
Random Walks with Lookahead on Power Law Random Graphs.
Internet Mathematics, 2007
MobCast: Overlay Architecture for Seamless IP Mobility using Scalable Anycast Proxies.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2007
Approximating Betweenness Centrality.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007
Towards Topology Aware Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007
Random walks in peer-to-peer networks: Algorithms and evaluation.
Perform. Evaluation, 2006
On certain connectivity properties of the internet topology.
J. Comput. Syst. Sci., 2006
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006
Caching with Expiration Times for Internet Applications.
Internet Mathematics, 2005
Strategyproof cost-sharing mechanisms for set cover and facility location games.
Decis. Support Syst., 2005
Hybrid search schemes for unstructured peer-to-peer networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005
Random Walks in Peer-to-Peer Networks.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004
Conductance and congestion in power law graphs.
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2003
Spectral Analysis of Internet Topologies.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003
Caching with expiration times.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
On the Eigenvalue Power Law.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002
Theoretical Computer Science.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Optimal Wavelength Routing on Directed Fiber Trees.
Theor. Comput. Sci., 1999
Set Cover with Requirements and Costs Evolving over Time.
Proceedings of the Randomization, 1999
On the Complexity of the View-Selection Problem.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999
On the Number of Eulerian Orientations of a Graph.
A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996
Monte Carlo and Markov Chain techniques for network reliability and sampling.
A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems.
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
On the Random Walk Method for Protocol Testing.
Proceedings of the Computer Aided Verification, 6th International Conference, 1994
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
On the Number of Eularian Orientations of a Graph.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992
On the Expansion of Combinatorial Polytopes.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Computing Spanning Trees in NETPAD.
Proceedings of the Computational Support for Discrete Mathematics, 1992
Learning the Fourier Spectrum of Probabilistic Lists and Trees.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991
On Coupling and the Approximation of the Permanent.
Inf. Process. Lett., 1989
Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Polytopes, Permanents and Graphs with Large Factors
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988