default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik Waingarten
Person information
- affiliation: University of Pennsylvania, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Moses Charikar, Michael Kapralov, Erik Waingarten:
A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations. SODA 2024: 5118-5144- [c29]Rajesh Jayaram
, Erik Waingarten, Tian Zhang:
Data-Dependent LSH for the Earth Mover's Distance. STOC 2024: 800-811 - [i31]Moses Charikar, Michael Kapralov, Erik Waingarten:
A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations. CoRR abs/2401.02562 (2024) - [i30]Rajesh Jayaram, Erik Waingarten, Tian Zhang:
Data-Dependent LSH for the Earth Mover's Distance. CoRR abs/2403.05041 (2024) - 2023
- [c28]Moses Charikar, Beidi Chen, Christopher Ré, Erik Waingarten:
Fast Algorithms for a New Relaxation of Optimal Transport. COLT 2023: 4831-4862 - [c27]Ainesh Bakshi, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal, Erik Waingarten:
Near-Linear Time Algorithm for the Chamfer Distance. NeurIPS 2023 - [c26]Moses Charikar, Monika Henzinger, Lunjia Hu, Maximilian Vötsch, Erik Waingarten:
Simple, Scalable and Effective Clustering via One-Dimensional Projections. NeurIPS 2023 - [c25]Xi Chen, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Streaming Euclidean MST to a Constant Factor. STOC 2023: 156-169 - [i29]Ainesh Bakshi, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal, Erik Waingarten:
A Near-Linear Time Algorithm for the Chamfer Distance. CoRR abs/2307.03043 (2023) - [i28]Moses Charikar, Beidi Chen, Christopher Ré, Erik Waingarten:
Fast Algorithms for a New Relaxation of Optimal Transport. CoRR abs/2307.10042 (2023) - [i27]Moses Charikar, Monika Henzinger, Lunjia Hu, Maximilian Vötsch, Erik Waingarten:
Simple, Scalable and Effective Clustering via One-Dimensional Projections. CoRR abs/2310.16752 (2023) - 2022
- [j5]Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten:
Approximating the distance to monotonicity of Boolean functions. Random Struct. Algorithms 60(2): 233-260 (2022) - [c24]Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten:
Finding Monotone Patterns in Sublinear Time, Adaptively. ICALP 2022: 17:1-17:19 - [c23]Moses Charikar, Erik Waingarten:
Polylogarithmic Sketches for Clustering. ICALP 2022: 38:1-38:20 - [c22]Maryam Aliakbarpour, Andrew McGregor, Jelani Nelson, Erik Waingarten:
Estimation of Entropy in Constant Space with Improved Sample Complexity. NeurIPS 2022 - [c21]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
New streaming algorithms for high dimensional EMD and MST. STOC 2022: 222-233 - [i26]Moses Charikar, Erik Waingarten:
Polylogarithmic Sketches for Clustering. CoRR abs/2204.12358 (2022) - [i25]Moses Charikar, Erik Waingarten:
The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction. CoRR abs/2205.00371 (2022) - [i24]Maryam Aliakbarpour, Andrew McGregor, Jelani Nelson, Erik Waingarten:
Estimation of Entropy in Constant Space with Improved Sample Complexity. CoRR abs/2205.09804 (2022) - [i23]Vincent Cohen-Addad, Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Streaming Euclidean MST to a Constant Factor. CoRR abs/2212.06546 (2022) - 2021
- [c20]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Learning and testing junta distributions with sub cube conditioning. COLT 2021: 1060-1113 - [c19]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning. SODA 2021: 321-336 - [c18]Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate Nearest Neighbors Beyond Space Partitions. SODA 2021: 1171-1190 - [i22]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
New Streaming Algorithms for High Dimensional EMD and MST. CoRR abs/2111.03528 (2021) - 2020
- [b1]Erik Alex Waingarten:
New Methods in Sublinear Computation for High Dimensional Problems. Columbia University, USA, 2020 - [c17]Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten:
Approximating the Distance to Monotonicity of Boolean Functions. SODA 2020: 1995-2009 - [c16]Xi Chen, Amit Levi, Erik Waingarten:
Nearly optimal edge estimation with independent set queries. SODA 2020: 2916-2935 - [i21]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Learning and Testing Junta Distributions with Subcube Conditioning. CoRR abs/2004.12496 (2020)
2010 – 2019
- 2019
- [c15]Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
On Mean Estimation for General Norms with Statistical Queries. COLT 2019: 2158-2172 - [c14]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding Monotone Patterns in Sublinear Time. FOCS 2019: 1469-1494 - [c13]Amit Levi, Erik Waingarten:
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. ITCS 2019: 52:1-52:20 - [c12]Xi Chen, Erik Waingarten:
Testing unateness nearly optimally. STOC 2019: 547-558 - [i20]Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
On Mean Estimation for General Norms with Statistical Queries. CoRR abs/1902.02459 (2019) - [i19]Xi Chen, Erik Waingarten:
Testing Unateness Nearly Optimally. CoRR abs/1904.05309 (2019) - [i18]Xi Chen, Amit Levi, Erik Waingarten:
Nearly optimal edge estimation with independent set queries. CoRR abs/1907.04381 (2019) - [i17]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding monotone patterns in sublinear time. CoRR abs/1910.01749 (2019) - [i16]Omri Ben-Eliezer, Shoham Letzter, Erik Waingarten:
Optimal Adaptive Detection of Monotone Patterns. CoRR abs/1911.01169 (2019) - [i15]Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten:
Approximating the Distance to Monotonicity of Boolean Functions. CoRR abs/1911.06924 (2019) - [i14]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning. CoRR abs/1911.07357 (2019) - [i13]Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding monotone patterns in sublinear time. Electron. Colloquium Comput. Complex. TR19 (2019) - [i12]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning. Electron. Colloquium Comput. Complex. TR19 (2019) - [i11]Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten:
Approximating the Distance to Monotonicity of Boolean Functions. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j4]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the Query Complexity of Non-adaptive Junta Testing. J. ACM 65(6): 40:1-40:18 (2018) - [j3]Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson:
The fewest clues problem. Theor. Comput. Sci. 748: 28-39 (2018) - [c11]Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Hölder Homeomorphisms and Approximate Nearest Neighbors. FOCS 2018: 159-169 - [c10]Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Data-dependent hashing via nonlinear spectral gaps. STOC 2018: 787-800 - [i10]Amit Levi, Erik Waingarten:
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. CoRR abs/1805.01074 (2018) - [i9]Amit Levi, Erik Waingarten:
Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j2]Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan C. Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, Daniel Ziegler:
Arboral satisfaction: Recognition and LP approximation. Inf. Process. Lett. 127: 1-5 (2017) - [c9]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten:
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces. APPROX-RANDOM 2017: 38:1-38:21 - [c8]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the Query Complexity of Non-Adaptive Junta Testing. CCC 2017: 26:1-26:19 - [c7]Xi Chen, Erik Waingarten, Jinyu Xie:
Boolean Unateness Testing with Õ(n3/4) Adaptive Queries. FOCS 2017: 868-879 - [c6]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. SODA 2017: 47-66 - [c5]Xi Chen, Erik Waingarten, Jinyu Xie:
Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness. STOC 2017: 523-536 - [c4]Alexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate near neighbors for general symmetric norms. STOC 2017: 902-913 - [i8]Xi Chen, Erik Waingarten, Jinyu Xie:
Beyond Talagrand Functions: New Lower Bounds for Testing Monotonicity and Unateness. CoRR abs/1702.06997 (2017) - [i7]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the query complexity of non-adaptive junta testing. CoRR abs/1704.06314 (2017) - [i6]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten:
Adaptivity is exponentially powerful for testing monotonicity of halfspaces. CoRR abs/1706.05556 (2017) - [i5]Xi Chen, Erik Waingarten, Jinyu Xie:
Boolean Unateness Testing with Õ(n3/4) Adaptive Queries. CoRR abs/1708.05786 (2017) - [i4]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the query complexity of non-adaptive junta testing. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c3]Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson:
The Fewest Clues Problem. FUN 2016: 12:1-12:12 - [i3]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. CoRR abs/1605.02701 (2016) - [i2]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. CoRR abs/1608.03580 (2016) - [i1]Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate Near Neighbors for General Symmetric Norms. CoRR abs/1611.06222 (2016) - 2015
- [j1]Erik D. Demaine, Fermi Ma, Matthew Susskind, Erik Waingarten:
You Should Be Scared of German Ghost. J. Inf. Process. 23(3): 293-298 (2015) - [c2]Jeffrey Bosboom, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, Erik Waingarten:
Mario Kart Is Hard. JCDCGG 2015: 49-59 - 2014
- [c1]Erik D. Demaine, Fermi Ma, Erik Waingarten:
Playing Dominoes Is Hard, Except by Yourself. FUN 2014: 137-146
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-08-05 21:24 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:
