Tal Wagner

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers21 papers

Sort

By YearBy Citation

Multitasking Capacity: Hardness Results and Improved Constructions

Noga Alon,Jonathan D. Cohen,Thomas L. Griffiths,Pasin Manurangsi,Daniel Reichman,Igor Shinkar,Tal Wagner, Alexander Yu

SIAM Journal on Discrete Mathematics, no. 1 (2020): 885-903

Bibtex

Scalable Nearest Neighbor Search for Optimal Transport

Arturs Backurs,Yihe Dong,Piotr Indyk, Ilya Razenshteyn,Tal Wagner

ICML, pp.497-506, (2020)

EIBibtex

Learning Space Partitions for Nearest Neighbor Search

Yihe Dong,Piotr Indyk, Ilya Razenshteyn,Tal Wagner

ICLR, (2020)

Cited by1EIBibtex

Multitasking Capacity: Hardness Results and Improved Constructions

Noga Alon,Jonathan D. Cohen,Thomas L. Griffiths,Pasin Manurangsi,Daniel Reichman,Igor Shinkar,Tal Wagner, Alexander Y. Ku

SIAM J. Discret. Math., no. 1 (2020): 885-903

EIBibtex

Learning Sublinear-Time Indexing for Nearest Neighbor Search

Yihe Dong,Piotr Indyk,Ilya P. Razenshteyn,Tal Wagner

arXiv: Learning, (2019)

Cited by4EIBibtex

Sample-Optimal Low-Rank Approximation of Distance Matrices

Piotr Indyk,Ali Vakilian,Tal Wagner,David P. Woodruff

COLT, (2019): 1723-1751

Cited by6EIBibtex

Scalable Nearest Neighbor Search for Optimal Transport

Dong Yihe,Indyk Piotr, Razenshteyn Ilya,Wagner Tal

Bibtex

Scalable Fair Clustering

Arturs Backurs,Piotr Indyk,Krzysztof Onak,Baruch Schieber,Ali Vakilian,Tal Wagner

CoRR, (2019): 405-413

Cited by34EIBibtex

Semi-Supervised Learning on Data Streams via Temporal Label Propagation

Tal Wagner,Sudipto Guha,Shiva Prasad Kasiviswanathan,Nina Mishra

ICML, pp.5082-5091, (2018)

Cited by14EIBibtex

Approximate Nearest Neighbors in Limited Space

Piotr Indyk,Tal Wagner

COLT, (2018): 2012-2036

Cited by5EIBibtex

Multitasking Capacity: Hardness Results and Improved Constructions

Noga Alon,Jonathan D. Cohen,Thomas L. Griffiths,Pasin Manurangsi,Daniel Reichman,Igor Shinkar,Tal Wagner, Alexander Y. Ku

arXiv: Data Structures and Algorithms, (2018)

Cited by1EIBibtex

Practical Data-Dependent Metric Compression with Provable Guarantees

Piotr Indyk,Ilya Razenshteyn,Tal Wagner

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), (2017)

Bibtex

Practical Data-Dependent Metric Compression with Provable Guarantees

Piotr Indyk,Ilya P. Razenshteyn,Tal Wagner

neural information processing systems, (2017): 2614-2623

Cited by7EIBibtex

A graph-theoretic approach to multitasking

Noga Alon,Daniel Reichman,Igor Shinkar,Tal Wagner, Sebastian Musslick,Jonathan D. Cohen, Tom Griffiths,Biswadip Dey,Kayhan Özcimder

neural information processing systems, pp.2097-2106, (2017)

Cited by5EIBibtex

A graph-theoretic approach to multitasking

Noga Alon,Daniel Reichman,Igor Shinkar,Tal Wagner, Sebastian Musslick,Jonathan D. Cohen,Thomas L. Griffiths,Biswadip Dey, Kayhan Ozcimder

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), (2017)

Bibtex

Near-optimal (euclidean) metric compression

Piotr Indyk,Tal Wagner

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp.710-723, (2017)

Cited by8EIBibtex

Near-Optimal (Euclidean) Metric Compression

Piotr Indyk,Tal Wagner

SODA, (2017)

Cited by8EIBibtex

Cheeger-type approximation for sparsest $st$-cut

Robert Krauthgamer,Tal Wagner

ACM Transactions on Algorithms, (2016)

EIBibtex

Cheeger-Type Approximation for Sparsest st-Cut

Robert Krauthgamer,Tal Wagner

ACM Trans. Algorithms, no. 1 (2016): 14:1-14:21

Cited by2EIBibtex

A sampling-based approach to accelerating queries in log management systems

Tal Wagner,Eric Schkufza,Udi Wieder

SPLASH (Companion Volume), pp.37-38, (2016)

Cited by3EIBibtex

View All

Base Info Papers Patents Projects