default search action
Erik Vee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i15]Noel Loo, Fotis Iliopoulos, Wei Hu, Erik Vee:
Linear Projections of Teacher Embeddings for Few-Class Distillation. CoRR abs/2409.20449 (2024) - 2023
- [c36]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Caching with Reserves via Marking. ICALP 2023: 80:1-80:20 - [c35]Cenk Baykal, Khoa Trinh, Fotis Iliopoulos, Gaurav Menghani, Erik Vee:
Robust Active Distillation. ICLR 2023 - [c34]Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee:
SLaM: Student-Label Mixing for Distillation with Unlabeled Examples. NeurIPS 2023 - [i14]Vasilis Kontonis, Fotis Iliopoulos, Khoa Trinh, Cenk Baykal, Gaurav Menghani, Erik Vee:
SLaM: Student-Label Mixing for Semi-Supervised Knowledge Distillation. CoRR abs/2302.03806 (2023) - [i13]Yicheng Fan, Dana Alon, Jingyue Shen, Daiyi Peng, Keshav Kumar, Yun Long, Xin Wang, Fotis Iliopoulos, Da-Cheng Juan, Erik Vee:
LayerNAS: Neural Architecture Search in Polynomial Complexity. CoRR abs/2304.11517 (2023) - [i12]Sharat Ibrahimpur
, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Caching with Reserves via Marking. CoRR abs/2305.02508 (2023) - [i11]Ce Jin, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
New Tools for Peak Memory Scheduling. CoRR abs/2312.13526 (2023) - 2022
- [c33]Sharat Ibrahimpur
Caching with Reserves. APPROX/RANDOM 2022: 52:1-52:16 - [c32]Fotis Iliopoulos, Vasilis Kontonis, Cenk Baykal, Gaurav Menghani, Khoa Trinh, Erik Vee:
Weighted Distillation with Unlabeled Examples. NeurIPS 2022 - [c31]Nikhil Bansal, Christian Coester
Learning-Augmented Weighted Paging. SODA 2022: 67-89 - [c30]Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. STACS 2022: 47:1-47:23 - [i10]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Caching with Reserves. CoRR abs/2207.05975 (2022) - [i9]Cenk Baykal, Khoa Trinh, Fotis Iliopoulos, Gaurav Menghani, Erik Vee:
Robust Active Distillation. CoRR abs/2210.01213 (2022) - [i8]Fotis Iliopoulos, Vasilis Kontonis, Cenk Baykal, Gaurav Menghani, Khoa Trinh, Erik Vee:
Weighted Distillation with Unlabeled Examples. CoRR abs/2210.06711 (2022) - 2021
- [i7]Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. CoRR abs/2108.02770 (2021) - 2020
- [c29]Ravi Kumar, Manish Purohit, Zoya Svitkina, Erik Vee:
Interleaved Caching with Access Graphs. SODA 2020: 1846-1858 - [i6]Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee:
Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging. CoRR abs/2011.09076 (2020)
2010 – 2019
- 2019
- [c28]Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee:
Semi-Online Bipartite Matching. ITCS 2019: 50:1-50:20 - [c27]Ravi Kumar, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Rematerialization for Deep Networks. NeurIPS 2019: 15146-15155 - 2018
- [r2]Erik Vee:
Stream Similarity Mining. Encyclopedia of Database Systems (2nd ed.) 2018 - [i5]Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee:
Semi-Online Bipartite Matching. CoRR abs/1812.00134 (2018) - 2016
- [j11]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
An Algorithmic View of Voting. SIAM J. Discret. Math. 30(4): 1978-1996 (2016) - 2015
- [j10]Deepayan Chakrabarti
Traffic Shaping to Optimize Ad Delivery. ACM Trans. Economics and Comput. 3(2): 11:1-11:20 (2015) - [c26]Ravi Kumar, Andrew Tomkins, Sergei Vassilvitskii, Erik Vee:
Inverting a Steady-State. WSDM 2015: 359-368 - 2012
- [c25]Jian Yang, Erik Vee, Sergei Vassilvitskii, John A. Tomlin, Jayavel Shanmugasundaram, Tasos Anastasakos, Oliver Kennedy:
Inventory Allocation for Online Graphical Display Advertising using Multi-objective Optimization. ICORES 2012: 293-304 - [c24]Vijay Bharadwaj, Peiji Chen, Wenjing Ma, Chandrashekhar Nagarajan, John A. Tomlin, Sergei Vassilvitskii, Erik Vee, Jian Yang:
SHALE: an efficient algorithm for allocation of guaranteed display advertising. KDD 2012: 1195-1203 - [c23]Deepayan Chakrabarti
Traffic shaping to optimize ad delivery. EC 2012: 302-318 - [c22]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. EC 2012: 319-336 - [i4]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) - [i3]Vijay Bharadwaj, Peiji Chen, Wenjing Ma, Chandrashekhar Nagarajan, John A. Tomlin, Sergei Vassilvitskii, Erik Vee, Jian Yang:
SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising. CoRR abs/1203.3619 (2012) - 2011
- [c21]Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee:
The Multiple Attribution Problem in Pay-Per-Conversion Advertising. SAGT 2011: 31-43 - 2010
- [j9]Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee:
Floodlight illumination of infinite wedges. Comput. Geom. 43(1): 23-34 (2010) - [c20]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 - [c19]Saeed Alaei
Balanced allocation with succinct representation. KDD 2010: 523-532 - [c18]Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasundaram:
Optimal online assignment with forecasts. EC 2010: 109-118 - [c17]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 - [c16]Deepak Agarwal, Datong Chen, Long-ji Lin, Jayavel Shanmugasundaram, Erik Vee:
Forecasting high-dimensional data. SIGMOD Conference 2010: 1003-1012 - [i2]Jian Yang, Erik Vee, Sergei Vassilvitskii, John A. Tomlin, Jayavel Shanmugasundaram, Tasos Anastasakos, Oliver Kennedy:
Inventory Allocation for Online Graphical Display Advertising. CoRR abs/1008.3551 (2010)
2000 – 2009
- 2009
- [j8]Erik Vee, Jayavel Shanmugasundaram, Sihem Amer-Yahia:
Efficient Computation of Diverse Query Results. IEEE Data Eng. Bull. 32(4): 57-64 (2009) - [j7]Steven Whang, Chad Brower, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Ramana Yerneni, Hector Garcia-Molina:
Indexing Boolean Expressions. Proc. VLDB Endow. 2(1): 37-48 (2009) - [r1]Erik Vee:
Stream Similarity Mining. Encyclopedia of Database Systems 2009: 2842-2847 - 2008
- [j6]Ashwin Machanavajjhala, Erik Vee, Minos N. Garofalakis, Jayavel Shanmugasundaram:
Scalable ranked publish/subscribe. Proc. VLDB Endow. 1(1): 451-462 (2008) - [j5]Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jayavel Shanmugasundaram, Utkarsh Srivastava, Erik Vee:
Efficient top-k processing over query-dependent functions. Proc. VLDB Endow. 1(1): 1044-1055 (2008) - [j4]T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee:
Estimating statistical aggregates on probabilistic data streams. ACM Trans. Database Syst. 33(4): 26:1-26:30 (2008) - [c15]Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasundaram, Prashant Bhat, Sihem Amer-Yahia:
Efficient Computation of Diverse Query Results. ICDE 2008: 228-236 - [c14]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 - [c13]Ravi Kumar, Andrew Tomkins, Erik Vee:
Connectivity structure of bipartite graphs via the KNC-plot. WSDM 2008: 129-138 - 2007
- [c12]T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee:
Estimating statistical aggregates on probabilistic data streams. PODS 2007: 243-252 - [c11]T. S. Jayram, Satyen Kale, Erik Vee:
Efficient aggregation algorithms for probabilistic data. SODA 2007: 346-355 - [c10]Zoë Abrams, Arpita Ghosh, Erik Vee:
Cost of Conciseness in Sponsored Search Auctions. WINE 2007: 326-334 - [c9]Zoë Abrams, Erik Vee:
Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm. WINE 2007: 535-540 - 2006
- [j3]David Liben-Nowell, Erik Vee, An Zhu:
Finding longest increasing and common subsequences in streaming data. J. Comb. Optim. 11(2): 155-175 (2006) - [j2]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing Partial Rankings. SIAM J. Discret. Math. 20(3): 628-648 (2006) - [c8]Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee:
Towards Secure and Scalable Computation in Peer-to-Peer Networks. FOCS 2006: 87-98 - [c7]T. S. Jayram, Phokion G. Kolaitis, Erik Vee:
The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89 - [c6]Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee:
Scalable leader election. SODA 2006: 990-999 - 2005
- [c5]David Liben-Nowell, Erik Vee, An Zhu:
Finding Longest Increasing and Common Subsequences in Streaming Data. COCOON 2005: 263-272 - 2004
- [c4]Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee:
Comparing and Aggregating Rankings with Ties. PODS 2004: 47-58 - 2003
- [j1]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
- [c3]Paul Beame
Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. CCC 2002: 18 - [c2]Paul Beame
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. STOC 2002: 688-697 - 2000
- [c1]Paul Beame
Super-linear time-space tradeoff lower bounds for randomized computation. FOCS 2000: 169-179 - [i1]Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee:
Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: