![]() | 2009 | |
---|---|---|
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Erik Vee: Stream Similarity Mining. Encyclopedia of Database Systems 2009: 2842-2847 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Erik Vee, Jayavel Shanmugasundaram, Sihem Amer-Yahia: Efficient Computation of Diverse Query Results. IEEE Data Eng. Bull. 32(4): 57-64 (2009) |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Steven Whang, Chad Brower, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Ramana Yerneni, Hector Garcia-Molina: Indexing Boolean Expressions. PVLDB 2(1): 37-48 (2009) |
2008 | ||
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasundaram, Prashant Bhat, Sihem Amer-Yahia: Efficient Computation of Diverse Query Results. ICDE 2008: 228-236 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Adam Silberstein, Brian F. Cooper, Utkarsh Srivastava, Erik Vee, Ramana Yerneni, Raghu Ramakrishnan: Efficient bulk insertion into a distributed ordered table. SIGMOD Conference 2008: 765-778 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Ravi Kumar, Andrew Tomkins, Erik Vee: Connectivity structure of bipartite graphs via the KNC-plot. WSDM 2008: 129-138 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. ACM Trans. Database Syst. 33(4): (2008) |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jayavel Shanmugasundaram, Utkarsh Srivastava, Erik Vee: Efficient top-k processing over query-dependent functions. PVLDB 1(1): 1044-1055 (2008) |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Ashwin Machanavajjhala, Erik Vee, Minos N. Garofalakis, Jayavel Shanmugasundaram: Scalable ranked publish/subscribe. PVLDB 1(1): 451-462 (2008) |
2007 | ||
16 | ![]() ![]() ![]() ![]() ![]() ![]() | T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. PODS 2007: 243-252 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | T. S. Jayram, Satyen Kale, Erik Vee: Efficient aggregation algorithms for probabilistic data. SODA 2007: 346-355 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Zoë Abrams, Arpita Ghosh, Erik Vee: Cost of Conciseness in Sponsored Search Auctions. WINE 2007: 326-334 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Zoë Abrams, Erik Vee: Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm. WINE 2007: 535-540 |
2006 | ||
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee: Towards Secure and Scalable Computation in Peer-to-Peer Networks. FOCS 2006: 87-98 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | T. S. Jayram, Phokion G. Kolaitis, Erik Vee: The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee: Scalable leader election. SODA 2006: 990-999 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | David Liben-Nowell, Erik Vee, An Zhu: Finding longest increasing and common subsequences in streaming data. J. Comb. Optim. 11(2): 155-175 (2006) |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing Partial Rankings. SIAM J. Discrete Math. 20(3): 628-648 (2006) |
2005 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | David Liben-Nowell, Erik Vee, An Zhu: Finding Longest Increasing and Common Subsequences in Streaming Data. COCOON 2005: 263-272 |
2004 | ||
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58 |
2003 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee: Time-space trade-off lower bounds for randomized computation of decision problems. J. ACM 50(2): 154-195 (2003) |
2002 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Beame, Erik Vee: Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. IEEE Conference on Computational Complexity 2002: 18 |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Beame, Erik Vee: Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. STOC 2002: 688-697 |
2000 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee: Super-linear time-space tradeoff lower bounds for randomized computation. FOCS 2000: 169-179 |
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee: Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation Electronic Colloquium on Computational Complexity (ECCC) 7(25): (2000) |