The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Aranyak Mehta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
    On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:112-119 [Conf]
  2. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
    AdWords and Generalized On-line Matching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:264-273 [Conf]
  3. Bharat Adsul, Aranyak Mehta, Milind A. Sohoni
    Keeping Track of the Latest Gossip in Shared Memory Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:477-488 [Conf]
  4. Parikshit Gopalan, Richard J. Lipton, Aranyak Mehta
    Randomized Time-Space Tradeoffs for Directed Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:208-216 [Conf]
  5. Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani
    Design Is as Easy as Optimization. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:477-488 [Conf]
  6. Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Nagarajan
    Fairness and optimality in congestion games. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2005, pp:52-57 [Conf]
  7. Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
    Playing large games using simple strategies. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:36-41 [Conf]
  8. Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
    Profit-maximizing multicast pricing by approximating fixed points. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:218-219 [Conf]
  9. Aranyak Mehta, Vijay V. Vazirani
    Randomized truthful auctions of digital goods are randomizations over truthful auctions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:120-124 [Conf]
  10. 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]
  11. Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
    On earthmover distance, metric labeling, and 0-extension. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:547-556 [Conf]
  12. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
    A Note on Approximate Nash Equilibria. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:297-306 [Conf]
  13. Kamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani
    A Simple Characterization for Truth-Revealing Single-Item Auctions. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:122-128 [Conf]
  14. Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
    An Auction-Based Market Equilibrium Algorithm for a Production Model. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:102-111 [Conf]
  15. Subhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta
    Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:92-101 [Conf]
  16. Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
    On earthmover distance, metric labeling, and 0-extension [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:064, pp:- [Journal]
  17. Aranyak Mehta, Scott Shenker, Vijay V. Vazirani
    Posted price profit maximization for multicast by approximating fixed points. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:58, n:2, pp:150-164 [Journal]
  18. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
    Progress in approximate nash equilibria. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:355-358 [Conf]
  19. Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan
    Beyond moulin mechanisms. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:1-10 [Conf]
  20. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
    AdWords and generalized online matching. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:5, pp:- [Journal]
  21. Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani
    An auction-based market equilibrium algorithm for a production model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:2, pp:153-164 [Journal]

  22. Some results on approximating the minimax solution in approval voting. [Citation Graph (, )][DBLP]


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


  24. Greedy List Intersection. [Citation Graph (, )][DBLP]


  25. Efficiency of (revenue-)optimal mechanisms. [Citation Graph (, )][DBLP]


  26. Online budgeted matching in random input models with applications to Adwords. [Citation Graph (, )][DBLP]


  27. A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. [Citation Graph (, )][DBLP]


  28. Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. [Citation Graph (, )][DBLP]


  29. Adwords Auctions with Decreasing Valuation Bids. [Citation Graph (, )][DBLP]


  30. Is Shapley Cost Sharing Optimal? [Citation Graph (, )][DBLP]


  31. Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. [Citation Graph (, )][DBLP]


  32. On the Fourier spectrum of symmetric Boolean functions. [Citation Graph (, )][DBLP]


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


  34. Efficiency of (Revenue-)Optimal Mechanisms [Citation Graph (, )][DBLP]


  35. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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