| 2011 |
|---|
| 33 | The Multiple Attribution Problem in Pay-Per-Conversion Advertising. Patrick Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee. SAGT 2011, 31-43. Web SearchBibTeXDownload |
| 2010 |
|---|
| 32 | Optimal online assignment with forecasts. Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasundaram. ACM Conference on Electronic Commerce 2010, 109-118. Web SearchBibTeXDownload |
| 31 | Pricing guaranteed contracts in online display advertising. Vijay Bharadwaj, Wenjing Ma, Michael Schwarz, Jayavel Shanmugasundaram, Erik Vee, Jack Xie, Jian Yang. CIKM 2010, 399-408. Web SearchBibTeXDownload |
| 30 | Floodlight illumination of infinite wedges. Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee. Comput. Geom. (43): 23-34 (2010). Web SearchBibTeXDownload |
| 29 | Inventory Allocation for Online Graphical Display Advertising. Jian Yang, Erik Vee, Sergei Vassilvitskii, John Tomlin, Jayavel Shanmugasundaram, Tasos Anastasakos, Oliver Kennedy. CoRR (abs/1008.3551) (2010). Web SearchBibTeXDownload |
| 28 | Balanced allocation with succinct representation. Saeed Alaei, Ravi Kumar, Azarakhsh Malekian, Erik Vee. KDD 2010, 523-532. Web SearchBibTeXDownload |
| 27 | Forecasting high-dimensional data. Deepak Agarwal, Datong Chen, Long-ji Lin, Jayavel Shanmugasundaram, Erik Vee. SIGMOD Conference 2010, 1003-1012. Web SearchBibTeXDownload |
| 26 | Efficiently evaluating complex boolean expressions. Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Srihari Venkatesan, Jason Y. Zien. SIGMOD Conference 2010, 3-14. Web SearchBibTeXDownload |
| 2009 |
|---|
| 25 | Stream Similarity Mining. Erik Vee. Encyclopedia of Database Systems 2009, 2842-2847. Web SearchBibTeXDownload |
| 24 | Efficient Computation of Diverse Query Results. Erik Vee, Jayavel Shanmugasundaram, Sihem Amer-Yahia, Prashant Bhat, Sihem Amer-Yahia. IEEE Data Eng. Bull. (32): 57-64 (2009). Cited by 13Web SearchBibTeXDownload |
| 23 | Indexing Boolean Expressions. Steven Whang, Chad Brower, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Ramana Yerneni, Hector Garcia-Molina. PVLDB (2): 37-48 (2009). Web SearchBibTeXDownload |
| 2008 |
|---|
| 22 | Estimating statistical aggregates on probabilistic data streams. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee. ACM Trans. Database Syst. (33) (2008). Cited by 33Web SearchBibTeXDownload |
| 21 | Efficient Computation of Diverse Query Results. Erik Vee, Jayavel Shanmugasundaram, Sihem Amer-Yahia, Prashant Bhat, Sihem Amer-Yahia. ICDE 2008, 228-236. Cited by 13Web SearchBibTeXDownload |
| 20 | Efficient top-k processing over query-dependent functions. Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jayavel Shanmugasundaram, Utkarsh Srivastava, Erik Vee. PVLDB (1): 1044-1055 (2008). Cited by 1Web SearchBibTeXDownload |
| 19 | Scalable ranked publish/subscribe. Ashwin Machanavajjhala, Erik Vee, Minos N. Garofalakis, Jayavel Shanmugasundaram. PVLDB (1): 451-462 (2008). Cited by 7Web SearchBibTeXDownload |
| 18 | Efficient bulk insertion into a distributed ordered table. Adam Silberstein, Brian F. Cooper, Utkarsh Srivastava, Erik Vee, Ramana Yerneni, Raghu Ramakrishnan. SIGMOD Conference 2008, 765-778. Cited by 6Web SearchBibTeXDownload |
| 17 | Connectivity structure of bipartite graphs via the KNC-plot. Ravi Kumar, Andrew Tomkins, Erik Vee. WSDM 2008, 129-138. Cited by 3Web SearchBibTeXDownload |
| 2007 |
|---|
| 16 | Estimating statistical aggregates on probabilistic data streams. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee. PODS 2007, 243-252. Cited by 33Web SearchBibTeXDownload |
| 15 | Efficient aggregation algorithms for probabilistic data. T. S. Jayram, Satyen Kale, Erik Vee. SODA 2007, 346-355. Web SearchBibTeXDownload |
| 14 | Cost of Conciseness in Sponsored Search Auctions. Zoë Abrams, Arpita Ghosh, Erik Vee. WINE 2007, 326-334. Web SearchBibTeXDownload |
| 13 | Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm. Zoë Abrams, Erik Vee. WINE 2007, 535-540. Web SearchBibTeXDownload |
| 2006 |
|---|
| 12 | Towards Secure and Scalable Computation in Peer-to-Peer Networks. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee. FOCS 2006, 87-98. Web SearchBibTeXDownload |
| 11 | Finding longest increasing and common subsequences in streaming data. David Liben-Nowell, Erik Vee, An Zhu. J. Comb. Optim. (11): 155-175 (2006). Web SearchBibTeXDownload |
| 10 | The containment problem for REAL conjunctive queries with inequalities. T. S. Jayram, Phokion G. Kolaitis, Erik Vee. PODS 2006, 80-89. Web SearchBibTeXDownload |
| 9 | Comparing Partial Rankings. Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee. SIAM J. Discrete Math. (20): 628-648 (2006). Cited by 23Web SearchBibTeXDownload |
| 8 | Scalable leader election. Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee. SODA 2006, 990-999. Web SearchBibTeXDownload |
| 2005 |
|---|
| 7 | Finding Longest Increasing and Common Subsequences in Streaming Data. David Liben-Nowell, Erik Vee, An Zhu. COCOON 2005, 263-272. Web SearchBibTeXDownload |
| 2004 |
|---|
| 6 | Comparing and Aggregating Rankings with Ties. Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee. PODS 2004, 47-58. Cited by 73Web SearchBibTeXDownload |
| 2003 |
|---|
| 5 | Time-space trade-off lower bounds for randomized computation of decision problems. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. J. ACM (50): 154-195 (2003). Web SearchBibTeXDownload |
| 2002 |
|---|
| 4 | Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. Paul Beame, Erik Vee. IEEE Conference on Computational Complexity 2002, 18. Web SearchBibTeXDownload |
| 3 | Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. Paul Beame, Erik Vee. STOC 2002, 688-697. Web SearchBibTeXDownload |
| 2000 |
|---|
| 2 | Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. Electronic Colloquium on Computational Complexity (ECCC) (7) (2000). Web SearchBibTeXDownload |
| 1 | Super-linear time-space tradeoff lower bounds for randomized computation. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee. FOCS 2000, 169-179. Web SearchBibTeXDownload |
