Erik Vee

2008
17	EE	Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasundaram, Prashant Bhat, Sihem Amer-Yahia: Efficient Computation of Diverse Query Results. ICDE 2008: 228-236
16	EE	Ravi Kumar, Andrew Tomkins, Erik Vee: Connectivity structure of bipartite graphs via the KNC-plot. WSDM 2008: 129-138
2007
15	EE	T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. PODS 2007: 243-252
14	EE	T. S. Jayram, Satyen Kale, Erik Vee: Efficient aggregation algorithms for probabilistic data. SODA 2007: 346-355
13	EE	Zoë Abrams, Arpita Ghosh, Erik Vee: Cost of Conciseness in Sponsored Search Auctions. WINE 2007: 326-334
12	EE	Zoë Abrams, Erik Vee: Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm. WINE 2007: 535-540
2006
11	EE	Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee: Towards Secure and Scalable Computation in Peer-to-Peer Networks. FOCS 2006: 87-98
10	EE	T. S. Jayram, Phokion G. Kolaitis, Erik Vee: The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89
9	EE	Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee: Scalable leader election. SODA 2006: 990-999
8	EE	David Liben-Nowell, Erik Vee, An Zhu: Finding longest increasing and common subsequences in streaming data. J. Comb. Optim. 11(2): 155-175 (2006)
2005
7	EE	David Liben-Nowell, Erik Vee, An Zhu: Finding Longest Increasing and Common Subsequences in Streaming Data. COCOON 2005: 263-272
2004
6	EE	Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58
2003
5	EE	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	EE	Paul Beame, Erik Vee: Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. IEEE Conference on Computational Complexity 2002: 18
3	EE	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	EE	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)

Coauthor Index

1	Zoë Abrams	[12] [13]
2	Sihem Amer-Yahia	[17]
3	Paul Beame	[1] [2] [3] [4] [5]
4	Prashant Bhat	[17]
5	Ronald Fagin	[6]
6	Arpita Ghosh	[13]
7	T. S. Jayram (Jayram S. Thathachar)	[10] [14] [15]
8	Satyen Kale	[14]
9	Valerie King	[9] [11]
10	Phokion G. Kolaitis	[10]
11	Ravi Kumar (S. Ravi Kumar)	[6] [16]
12	David Liben-Nowell	[7] [8]
13	Mohammad Mahdian	[6]
14	Andrew McGregor	[15]
15	S. Muthukrishnan (S. Muthu Muthukrishnan)	[15]
16	Jared Saia	[9] [11]
17	Michael E. Saks	[1] [2] [5]
18	Vishal Sanwalani	[9] [11]
19	Jayavel Shanmugasundaram	[17]
20	D. Sivakumar	[6]
21	Utkarsh Srivastava	[17]
22	Xiaodong Sun	[1] [2] [5]
23	Andrew Tomkins	[16]
24	An Zhu	[7] [8]

Colors in the list of coauthors