default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTal Wagner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner:
Erratum: Multitasking Capacity: Hardness Results and Improved Constructions. SIAM J. Discret. Math. 38(2): 2001-2003 (2024)- 2023
- [j4]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Learning Space Partitions for Nearest Neighbor Search. IEEE Data Eng. Bull. 46(3): 55-68 (2023) - [c24]Nicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner:
Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees. ACDA 2023: 87-97 - [c23]Tal Wagner, Yonatan Naamad, Nina Mishra:
Fast Private Kernel Density Estimation via Locality Sensitive Quantization. ICML 2023: 35339-35367 - [i22]Nicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner:
Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees. CoRR abs/2304.07652 (2023) - [i21]Tal Wagner, Yonatan Naamad, Nina Mishra:
Fast Private Kernel Density Estimation via Locality Sensitive Quantization. CoRR abs/2307.01877 (2023) - 2022
- [j3]Piotr Indyk, Tal Wagner:
Optimal (Euclidean) Metric Compression. SIAM J. Comput. 51(3): 467-491 (2022) - [c22]Peter L. Bartlett, Piotr Indyk, Tal Wagner:
Generalization Bounds for Data-Driven Numerical Linear Algebra. COLT 2022: 2013-2040 - [c21]Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang:
Triangle and Four Cycle Counting with Predictions in Graph Streams. ICLR 2022 - [c20]Justin Y. Chen, Piotr Indyk, Tal Wagner:
Streaming Algorithms for Support-Aware Histograms. ICML 2022: 3184-3203 - [c19]Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. NeurIPS 2022 - [i20]Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang:
Triangle and Four Cycle Counting with Predictions in Graph Streams. CoRR abs/2203.09572 (2022) - [i19]Yi Zhang, Arturs Backurs, Sébastien Bubeck, Ronen Eldan, Suriya Gunasekar, Tal Wagner:
Unveiling Transformers with LEGO: a synthetic reasoning task. CoRR abs/2206.04301 (2022) - [i18]Peter L. Bartlett, Piotr Indyk, Tal Wagner:
Generalization Bounds for Data-Driven Numerical Linear Algebra. CoRR abs/2206.07886 (2022) - [i17]Justin Y. Chen, Piotr Indyk, Tal Wagner:
Streaming Algorithms for Support-Aware Histograms. CoRR abs/2207.08686 (2022) - [i16]David Alvarez-Melis, Nicolò Fusi, Lester Mackey
, Tal Wagner:
Budget-Constrained Bounds for Mini-Batch Estimation of Optimal Transport. CoRR abs/2210.13630 (2022) - [i15]Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. CoRR abs/2211.03232 (2022) - 2021
- [c18]Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. ICLR 2021 - [c17]Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner:
Faster Kernel Matrix Algebra via Density Estimation. ICML 2021: 500-510 - [c16]Piotr Indyk, Tal Wagner, David P. Woodruff:
Few-Shot Data-Driven Algorithms for Low Rank Approximation. NeurIPS 2021: 10678-10690 - [i14]Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner:
Faster Kernel Matrix Algebra via Density Estimation. CoRR abs/2102.08341 (2021) - [i13]Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. CoRR abs/2106.08396 (2021) - [i12]Piotr Indyk, Tal Wagner:
Optimal (Euclidean) Metric Compression. CoRR abs/2110.03152 (2021) - 2020
- [j2]Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner, Alexander Y. Ku:
Multitasking Capacity: Hardness Results and Improved Constructions. SIAM J. Discret. Math. 34(1): 885-903 (2020) - [c15]Tal Wagner:
Eccentricity Heuristics through Sublinear Analysis Lenses. APOCS 2020: 75-89 - [c14]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Learning Space Partitions for Nearest Neighbor Search. ICLR 2020 - [c13]Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Scalable Nearest Neighbor Search for Optimal Transport. ICML 2020: 497-506
2010 – 2019
- 2019
- [c12]Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff:
Sample-Optimal Low-Rank Approximation of Distance Matrices. COLT 2019: 1723-1751 - [c11]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. ICML 2019: 405-413 - [c10]Arturs Backurs, Piotr Indyk, Tal Wagner:
Space and Time Efficient Kernel Density Estimation in High Dimensions. NeurIPS 2019: 15773-15782 - [c9]Tal Wagner:
Eccentricities via Parallel Set Cover (Brief Announcement). SPAA 2019: 43-45 - [i11]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Learning Sublinear-Time Indexing for Nearest Neighbor Search. CoRR abs/1901.08544 (2019) - [i10]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. CoRR abs/1902.03519 (2019) - [i9]Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff:
Sample-Optimal Low-Rank Approximation of Distance Matrices. CoRR abs/1906.00339 (2019) - [i8]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Scalable Nearest Neighbor Search for Optimal Transport. CoRR abs/1910.04126 (2019) - 2018
- [c8]Piotr Indyk, Tal Wagner:
Approximate Nearest Neighbors in Limited Space. COLT 2018: 2012-2036 - [c7]Tal Wagner, Sudipto Guha, Shiva Prasad Kasiviswanathan, Nina Mishra:
Semi-Supervised Learning on Data Streams via Temporal Label Propagation. ICML 2018: 5082-5091 - [i7]Piotr Indyk, Tal Wagner:
Approximate Nearest Neighbors in Limited Space. CoRR abs/1807.00112 (2018) - [i6]Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner, Alexander Y. Ku:
Multitasking Capacity: Hardness Results and Improved Constructions. CoRR abs/1809.02835 (2018) - 2017
- [c6]Noga Alon, Daniel Reichman, Igor Shinkar, Tal Wagner, Sebastian Musslick, Jonathan D. Cohen, Tom Griffiths, Biswadip Dey, Kayhan Özcimder:
A graph-theoretic approach to multitasking. NIPS 2017: 2100-2109 - [c5]Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Practical Data-Dependent Metric Compression with Provable Guarantees. NIPS 2017: 2617-2626 - [c4]Piotr Indyk, Tal Wagner:
Near-Optimal (Euclidean) Metric Compression. SODA 2017: 710-723 - [i5]Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Practical Data-Dependent Metric Compression with Provable Guarantees. CoRR abs/1711.01520 (2017) - 2016
- [j1]Robert Krauthgamer, Tal Wagner:
Cheeger-Type Approximation for Sparsest st-Cut. ACM Trans. Algorithms 13(1): 14:1-14:21 (2016) - [c3]Tal Wagner, Eric Schkufza, Udi Wieder:
A sampling-based approach to accelerating queries in log management systems. SPLASH (Companion Volume) 2016: 37-38 - [i4]Piotr Indyk, Tal Wagner:
Near-Optimal (Euclidean) Metric Compression. CoRR abs/1609.06295 (2016) - [i3]Jonathan D. Cohen, Biswadip Dey, Tom Griffiths, Sebastian Musslick, Kayhan Özcimder, Daniel Reichman, Igor Shinkar, Tal Wagner:
A Graph-Theoretic Approach to Multitasking. CoRR abs/1611.02400 (2016) - 2015
- [c2]Michael Dinitz, Robert Krauthgamer, Tal Wagner:
Towards Resistance Sparsifiers. APPROX-RANDOM 2015: 738-755 - [i2]Michael Dinitz, Robert Krauthgamer, Tal Wagner:
Towards Resistance Sparsifiers. CoRR abs/1506.07568 (2015) - 2014
- [i1]Robert Krauthgamer, Tal Wagner:
Cheeger-type approximation for sparsest $st$-cut. CoRR abs/1410.3889 (2014) - 2012
- [c1]Koby Crammer, Tal Wagner:
Volume Regularization for Binary Classification. NIPS 2012: 341-349
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-07 21:21 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:
