The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vahab S. Mirrokni: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni
    Secure Overlay Network Design. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:354-366 [Conf]
  2. Vahab S. Mirrokni, Adrian Vetta
    Convergence Issues in Competitive Games. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:183-194 [Conf]
  3. Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni
    Locality-sensitive hashing scheme based on p-stable distributions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:253-262 [Conf]
  4. Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta
    Sink Equilibria and Convergence. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:142-154 [Conf]
  5. Marina Thottan, Erran L. Li, Bin Yao, Vahab S. Mirrokni, Sanjoy Paul
    Distributed Network Monitoring for Evolving IP Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2004, pp:712-719 [Conf]
  6. Marina Thottan, Vahab S. Mirrokni, Hüseyin Uzunalioglu, Sanjoy Paul
    A Simple Polynomial Time Framework For Reduced Path Decomposition in Multi-Path Routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  7. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power Optimization for Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:349-361 [Conf]
  8. Mohammad Taghi Hajiaghayi, Nicole Immorlica, Vahab S. Mirrokni
    Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2003, pp:300-312 [Conf]
  9. Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni, Marina Thottan
    Market sharing games applied to content distribution in ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2004, pp:55-66 [Conf]
  10. Magnús M. Halldórsson, Joseph Y. Halpern, Erran L. Li, Vahab S. Mirrokni
    On spectrum sharing games. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:107-114 [Conf]
  11. Mansour Jamzad, Hamid Reza Chitsaz, Amirali Foroughnassiraei, Reza Ghorbani, Moslem Kazemi, Vahab S. Mirrokni, Sayyed Bashir Sadjad
    Basic Requirements for a Teamwork in Middle Size RoboCup. [Citation Graph (0, 0)][DBLP]
    RoboCup, 2001, pp:621-626 [Conf]
  12. Mansour Jamzad, Amirali Foroughnassiraei, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni, Reza Ghorbani, Abbas Heydarnoori, Moslem Kazemi, Hamid Reza Chitsaz, Farid Mobasser, Mohsen Ebrahimi Moghaddam, M. Gudarzi, N. Ghaffarzadegan
    A Goal Keeper for Middle Size RoboCup. [Citation Graph (0, 0)][DBLP]
    RoboCup, 2000, pp:583-586 [Conf]
  13. Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan
    A Fast Vision System for Middle Size Robots in RoboCup. [Citation Graph (0, 0)][DBLP]
    RoboCup, 2001, pp:71-80 [Conf]
  14. Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
    Tight approximation algorithms for maximum general assignment problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:611-620 [Conf]
  15. Nicole Immorlica, David R. Karger, Maria Minkoff, Vahab S. Mirrokni
    On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:691-700 [Conf]
  16. Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni
    Limitations of cross-monotonic cost sharing schemes. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:602-611 [Conf]
  17. Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber
    Traffic engineering of management flows by link augmentations on confluent trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:289-298 [Conf]
  18. George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos
    Convergence and Approximation in Potential Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:349-360 [Conf]
  19. Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni
    Cycle Cover with Short Cycles. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:641-653 [Conf]
  20. David Abraham, Ning Chen, Vijay Kumar, Vahab S. Mirrokni
    Assignment Problems in Rental Markets. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:198-213 [Conf]
  21. Nicole Immorlica, Li Li, Vahab S. Mirrokni, Andreas Schulz
    Coordination Mechanisms for Selfish Scheduling. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:55-69 [Conf]
  22. Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami
    Subjective-Cost Policy Routing. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:174-183 [Conf]
  23. Manuela M. Veloso, Tucker R. Balch, Peter Stone, Hiroaki Kitano, Fuminori Yamasaki, Ken Endo, Minoru Asada, Mansour Jamzad, Sayyed Bashir Sadjad, Vahab S. Mirrokni, Moslem Kazemi, Hamid Reza Chitsaz, Abbas Heydarnoori, Mohammad Taghi Hajiaghayi, Ehsan Chiniforooshan
    RoboCup-2001: The Fifth Robotic Soccer World Championships. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2002, v:23, n:1, pp:55-68 [Journal]
  24. Saieed Akbari, Vahab S. Mirrokni, Bashir S. Sadjad
    A relation between choosability and uniquely list colorability. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:577-583 [Journal]
  25. Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
    Power optimization for connectivity problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:195-208 [Journal]
  26. Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni
    The facility location problem with general cost functions. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:1, pp:42-47 [Journal]
  27. Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni
    Length-constrained path-matchings in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:4, pp:210-215 [Journal]
  28. Paramvir Bahl, Mohammad Taghi Hajiaghayi, Kamal Jain, Vahab S. Mirrokni, Lili Qiu, Amin Saberi
    Cell Breathing in Wireless LANs: Algorithms and Evaluation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Mob. Comput., 2007, v:6, n:2, pp:164-178 [Journal]
  29. Mohsen Bahramgiri, Mohammad Taghi Hajiaghayi, Vahab S. Mirrokni
    Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2006, v:12, n:2, pp:179-188 [Journal]
  30. Mohammad Taghi Hajiaghayi, Li Li, Vahab S. Mirrokni, Marina Thottan
    Bandwidth Sharing Network Design for Multi-Class Traffic. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  31. Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni
    Robust Combinatorial Optimization with Exponential Scenarios. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:439-453 [Conf]
  32. Reid Andersen, Christian Borgs, Jennifer T. Chayes, John Hopcraft, Vahab S. Mirrokni, Shang-Hua Teng
    Local Computation of PageRank Contributions. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:150-165 [Conf]
  33. Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami
    Subjective-cost policy routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:2, pp:175-189 [Journal]

  34. PASS Approximation. [Citation Graph (, )][DBLP]


  35. Two-Stage Robust Network Design with Exponential Scenarios. [Citation Graph (, )][DBLP]


  36. Online Stochastic Packing Applied to Display Ad Allocation. [Citation Graph (, )][DBLP]


  37. Maximizing Non-Monotone Submodular Functions. [Citation Graph (, )][DBLP]


  38. Online Stochastic Matching: Beating 1-1/e. [Citation Graph (, )][DBLP]


  39. Tutorial summary: Convergence of natural dynamics to equilibria. [Citation Graph (, )][DBLP]


  40. On the Stability of Web Crawling and Web Search. [Citation Graph (, )][DBLP]


  41. A Recommender System Based on Local Random Walks and Spectral Methods. [Citation Graph (, )][DBLP]


  42. Approximating Minimum-Power Degree and Connectivity Problems. [Citation Graph (, )][DBLP]


  43. Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. [Citation Graph (, )][DBLP]


  44. Auctions with intermediaries: extended abstract. [Citation Graph (, )][DBLP]


  45. Fast convergence to nearly optimal solutions in potential games. [Citation Graph (, )][DBLP]


  46. Uncoordinated two-sided matching markets. [Citation Graph (, )][DBLP]


  47. Permutation betting markets: singleton betting with extra information. [Citation Graph (, )][DBLP]


  48. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. [Citation Graph (, )][DBLP]


  49. On the complexity of nash dynamics and sink equilibria. [Citation Graph (, )][DBLP]


  50. (Almost) optimal coordination mechanisms for unrelated machine scheduling. [Citation Graph (, )][DBLP]


  51. Approximating submodular functions everywhere. [Citation Graph (, )][DBLP]


  52. The myth of the folk theorem. [Citation Graph (, )][DBLP]


  53. Non-monotone submodular maximization under matroid and knapsack constraints. [Citation Graph (, )][DBLP]


  54. Online Ad Assignment with Free Disposal. [Citation Graph (, )][DBLP]


  55. Competitive Routing over Time. [Citation Graph (, )][DBLP]


  56. A Unified Approach to Congestion Games and Two-Sided Markets. [Citation Graph (, )][DBLP]


  57. A combinatorial allocation mechanism with penalties for banner advertising. [Citation Graph (, )][DBLP]


  58. Trust-based recommendation systems: an axiomatic approach. [Citation Graph (, )][DBLP]


  59. Optimal marketing strategies over social networks. [Citation Graph (, )][DBLP]


  60. Bid optimization for broad match ad auctions. [Citation Graph (, )][DBLP]


  61. Optimal marketing and pricing over social networks. [Citation Graph (, )][DBLP]


  62. Mining advertiser-specific user behavior using adfactors. [Citation Graph (, )][DBLP]


  63. Robust PageRank and locally computable spam detection features. [Citation Graph (, )][DBLP]


  64. Secure Overlay Network Design. [Citation Graph (, )][DBLP]


  65. Bid Optimization in Broad-Match Ad Auctions [Citation Graph (, )][DBLP]


  66. Non-monotone submodular maximization under matroid and knapsack constraints [Citation Graph (, )][DBLP]


  67. On the complexity of Nash dynamics and Sink Equilibria [Citation Graph (, )][DBLP]


  68. Online Stochastic Matching: Beating 1-1/e [Citation Graph (, )][DBLP]


  69. Quasi-Proportional Mechanisms: Prior-free Revenue Maximization [Citation Graph (, )][DBLP]


  70. Online Stochastic Ad Allocation: Efficiency and Fairness [Citation Graph (, )][DBLP]


  71. The Myth of the Folk Theorem. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002