Search the dblp DataBase

Publications of Author

1. Paul Beame, Erik Vee
   Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:18- [Conf]
   
2. David Liben-Nowell, Erik Vee, An Zhu
   Finding Longest Increasing and Common Subsequences in Streaming Data. [Citation Graph (0, 0)][DBLP]
   COCOON, 2005, pp:263-272 [Conf]
   
3. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
   Super-linear time-space tradeoff lower bounds for randomized computation. [Citation Graph (0, 0)][DBLP]
   FOCS, 2000, pp:169-179 [Conf]
   
4. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
   Towards Secure and Scalable Computation in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:87-98 [Conf]
   
5. Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
   Comparing and Aggregating Rankings with Ties. [Citation Graph (0, 0)][DBLP]
   PODS, 2004, pp:47-58 [Conf]
   
6. T. S. Jayram, Phokion G. Kolaitis, Erik Vee
   The containment problem for REAL conjunctive queries with inequalities. [Citation Graph (0, 0)][DBLP]
   PODS, 2006, pp:80-89 [Conf]
   
7. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
   Scalable leader election. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:990-999 [Conf]
   
8. Paul Beame, Erik Vee
   Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. [Citation Graph (0, 0)][DBLP]
   STOC, 2002, pp:688-697 [Conf]
   
9. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
   Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:25, pp:- [Journal]
   
10. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
    Time-space trade-off lower bounds for randomized computation of decision problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:2, pp:154-195 [Journal]
    
11. David Liben-Nowell, Erik Vee, An Zhu
    Finding longest increasing and common subsequences in streaming data. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:2, pp:155-175 [Journal]
    
12. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee
    Estimating statistical aggregates on probabilistic data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:243-252 [Conf]
    
13. T. S. Jayram, Satyen Kale, Erik Vee
    Efficient aggregation algorithms for probabilistic data. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:346-355 [Conf]
    
14. 
    Efficient Computation of Diverse Query Results. [Citation Graph (, )][DBLP]
    
    
15. 
    Balanced allocation with succinct representation. [Citation Graph (, )][DBLP]
    
    
16. 
    Optimal online assignment with forecasts. [Citation Graph (, )][DBLP]
    
    
17. 
    Efficient bulk insertion into a distributed ordered table. [Citation Graph (, )][DBLP]
    
    
18. 
    Forecasting high-dimensional data. [Citation Graph (, )][DBLP]
    
    
19. 
    Efficiently evaluating complex boolean expressions. [Citation Graph (, )][DBLP]
    
    
20. 
    Cost of Conciseness in Sponsored Search Auctions. [Citation Graph (, )][DBLP]
    
    
21. 
    Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm. [Citation Graph (, )][DBLP]
    
    
22. 
    Connectivity structure of bipartite graphs via the KNC-plot. [Citation Graph (, )][DBLP]
    
    
23. 
    Floodlight illumination of infinite wedges. [Citation Graph (, )][DBLP]
    
    
24. 
    Inventory Allocation for Online Graphical Display Advertising [Citation Graph (, )][DBLP]
    
    
25. 
    Efficient Computation of Diverse Query Results. [Citation Graph (, )][DBLP]