Erik Vee

Jian Yang, Erik Vee, Sergei Vassilvitskii, John Tomlin, Jayavel Shanmugasundaram, Tasos Anastasakos, Oliver Kennedy: Inventory Allocation for Online Graphical Display Advertising using Multi-objective Optimization. ICORES 2012: 293-304

Vijay Bharadwaj, Peiji Chen, Wenjing Ma, Chandrashekhar Nagarajan, John Tomlin, Sergei Vassilvitskii, Erik Vee, Jian Yang: SHALE: an efficient algorithm for allocation of guaranteed display advertising. KDD 2012: 1195-1203

Deepayan Chakrabarti, Erik Vee: Traffic shaping to optimize ad delivery. ACM Conference on Electronic Commerce 2012: 302-318

Peiji Chen, Wenjing Ma, Srinath Mandalapu, Chandrashekhar Nagarajan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Manfai Yu, Jason Y. Zien: Ad serving using a compact allocation plan. ACM Conference on Electronic Commerce 2012: 319-336

Peiji Chen, Wenjing Ma, Srinath Mandalapu, Chandrashekhar Nagarajan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Manfai Yu, Jason Y. Zien: Ad Serving Using a Compact Allocation Plan. CoRR abs/1203.3593 (2012)

Vijay Bharadwaj, Peiji Chen, Wenjing Ma, Chandrashekhar Nagarajan, John Tomlin, Sergei Vassilvitskii, Erik Vee, Jian Yang: SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising. CoRR abs/1203.3619 (2012)

Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee: The Multiple Attribution Problem in Pay-Per-Conversion Advertising. SAGT 2011: 31-43

Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee: Floodlight illumination of infinite wedges. Comput. Geom. 43(1): 23-34 (2010)

Vijay Bharadwaj, Wenjing Ma, Michael Schwarz, Jayavel Shanmugasundaram, Erik Vee, Jack Xie, Jian Yang: Pricing guaranteed contracts in online display advertising. CIKM 2010: 399-408

Saeed Alaei, Ravi Kumar, Azarakhsh Malekian, Erik Vee: Balanced allocation with succinct representation. KDD 2010: 523-532

Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasundaram: Optimal online assignment with forecasts. ACM Conference on Electronic Commerce 2010: 109-118

Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Srihari Venkatesan, Jason Y. Zien: Efficiently evaluating complex boolean expressions. SIGMOD Conference 2010: 3-14

Deepak Agarwal, Datong Chen, Long-ji Lin, Jayavel Shanmugasundaram, Erik Vee: Forecasting high-dimensional data. SIGMOD Conference 2010: 1003-1012

Jian Yang, Erik Vee, Sergei Vassilvitskii, John Tomlin, Jayavel Shanmugasundaram, Tasos Anastasakos, Oliver Kennedy: Inventory Allocation for Online Graphical Display Advertising. CoRR abs/1008.3551 (2010)

Erik Vee, Jayavel Shanmugasundaram, Sihem Amer-Yahia: Efficient Computation of Diverse Query Results. IEEE Data Eng. Bull. 32(4): 57-64 (2009)

Steven Whang, Chad Brower, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Ramana Yerneni, Hector Garcia-Molina: Indexing Boolean Expressions. PVLDB 2(1): 37-48 (2009)

Erik Vee: Stream Similarity Mining. Encyclopedia of Database Systems 2009: 2842-2847

Ashwin Machanavajjhala, Erik Vee, Minos N. Garofalakis, Jayavel Shanmugasundaram: Scalable ranked publish/subscribe. PVLDB 1(1): 451-462 (2008)

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)

T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. ACM Trans. Database Syst. 33(4) (2008)

Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasundaram, Prashant Bhat, Sihem Amer-Yahia: Efficient Computation of Diverse Query Results. ICDE 2008: 228-236

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

Ravi Kumar, Andrew Tomkins, Erik Vee: Connectivity structure of bipartite graphs via the KNC-plot. WSDM 2008: 129-138

T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee: Estimating statistical aggregates on probabilistic data streams. PODS 2007: 243-252

T. S. Jayram, Satyen Kale, Erik Vee: Efficient aggregation algorithms for probabilistic data. SODA 2007: 346-355

Zoë Abrams, Arpita Ghosh, Erik Vee: Cost of Conciseness in Sponsored Search Auctions. WINE 2007: 326-334

Zoë Abrams, Erik Vee: Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm. WINE 2007: 535-540

David Liben-Nowell, Erik Vee, An Zhu: Finding longest increasing and common subsequences in streaming data. J. Comb. Optim. 11(2): 155-175 (2006)

Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing Partial Rankings. SIAM J. Discrete Math. 20(3): 628-648 (2006)

Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee: Towards Secure and Scalable Computation in Peer-to-Peer Networks. FOCS 2006: 87-98

T. S. Jayram, Phokion G. Kolaitis, Erik Vee: The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89

Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee: Scalable leader election. SODA 2006: 990-999

David Liben-Nowell, Erik Vee, An Zhu: Finding Longest Increasing and Common Subsequences in Streaming Data. COCOON 2005: 263-272

Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58

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)

Paul Beame, Erik Vee: Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. IEEE Conference on Computational Complexity 2002: 18

Paul Beame, Erik Vee: Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. STOC 2002: 688-697

Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee: Super-linear time-space tradeoff lower bounds for randomized computation. FOCS 2000: 169-179

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)