Search the dblp DataBase

Publications of Author

1. Christos Gkantsidis, Milena Mihail, Ellen W. Zegura
   The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2003, pp:16-25 [Conf]
   
2. Milena Mihail, Christos H. Papadimitriou
   On the Random Walk Method for Protocol Testing. [Citation Graph (0, 0)][DBLP]
   CAV, 1994, pp:132-141 [Conf]
   
3. Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani
   Polytopes, Permanents and Graphs with Large Factors [Citation Graph (0, 0)][DBLP]
   FOCS, 1988, pp:412-421 [Conf]
   
4. Milena Mihail
   Conductance and Convergence of Markov Chains-A Combinatorial Treatment of Expanders [Citation Graph (0, 0)][DBLP]
   FOCS, 1989, pp:526-531 [Conf]
   
5. Milena Mihail, Christos Kaklamanis, Satish Rao
   Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings. [Citation Graph (0, 0)][DBLP]
   FOCS, 1995, pp:548-557 [Conf]
   
6. Milena Mihail, Christos H. Papadimitriou, Amin Saberi
   On Certain Connectivity Properties of the Internet Topology. [Citation Graph (0, 0)][DBLP]
   FOCS, 2003, pp:28-35 [Conf]
   
7. Tomás Feder, Adam Guetz, Milena Mihail, Amin Saberi
   A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:69-76 [Conf]
   
8. Christos Gkantsidis, Milena Mihail, Amin Saberi
   Random Walks in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
   INFOCOM, 2004, pp:- [Conf]
   
9. Christos Gkantsidis, Milena Mihail, Amin Saberi
   Hybrid search schemes for unstructured peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
   INFOCOM, 2005, pp:1526-1537 [Conf]
   
10. Christos Gkantsidis, Milena Mihail, Ellen W. Zegura
    Spectral Analysis of Internet Topologies. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
    
11. Milena Mihail
    On the Expansion of Combinatorial Polytopes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:37-49 [Conf]
    
12. Howard J. Karloff, Milena Mihail
    On the Complexity of the View-Selection Problem. [Citation Graph (0, 7)][DBLP]
    PODS, 1999, pp:167-173 [Conf]
    
13. Milena Mihail
    Set Cover with Requirements and Costs Evolving over Time. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:63-72 [Conf]
    
14. Milena Mihail, Christos H. Papadimitriou
    On the Eigenvalue Power Law. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:254-262 [Conf]
    
15. Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
    Strategyproof cost-sharing mechanisms for set cover and facility location games. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:108-114 [Conf]
    
16. Christos Gkantsidis, Milena Mihail, Amin Saberi
    Conductance and congestion in power law graphs. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2003, pp:148-159 [Conf]
    
17. William Aiello, Milena Mihail
    Learning the Fourier Spectrum of Probabilistic Lists and Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:291-299 [Conf]
    
18. Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
    Caching with expiration times. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:540-547 [Conf]
    
19. Milena Mihail, David Shallcross, Nate Dean, Marco Mostrel
    A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:279-287 [Conf]
    
20. Milena Mihail, Peter Winkler
    On the Number of Eularian Orientations of a Graph. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:138-145 [Conf]
    
21. Tomás Feder, Milena Mihail
    Balanced Matroids [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:26-38 [Conf]
    
22. David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
    A primal-dual approximation algorithm for generalized Steiner network problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:708-717 [Conf]
    
23. Milena Mihail, Peter Winkler
    On the Number of Eulerian Orientations of a Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:402-414 [Journal]
    
24. David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
    A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:435-454 [Journal]
    
25. Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani
    Strategyproof cost-sharing mechanisms for set cover and facility location games. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2005, v:39, n:1, pp:11-22 [Journal]
    
26. Milena Mihail
    On Coupling and the Approximation of the Permanent. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:2, pp:91-95 [Journal]
    
27. Milena Mihail, Christos H. Papadimitriou, Amin Saberi
    On certain connectivity properties of the internet topology. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:239-251 [Journal]
    
28. Christos Gkantsidis, Milena Mihail, Amin Saberi
    Random walks in peer-to-peer networks: Algorithms and evaluation. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2006, v:63, n:3, pp:241-263 [Journal]
    
29. Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
    Optimal Wavelength Routing on Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:119-137 [Journal]
    
30. Christos Gkantsidis, Gagan Goel, Milena Mihail, Amin Saberi
    Towards Topology Aware Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:2591-2595 [Conf]
    
31. David A. Bader, Shiva Kintali, Kamesh Madduri, Milena Mihail
    Approximating Betweenness Centrality. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:124-137 [Conf]