Mayank Goswami

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

Manifold-driven decomposition for adversarial robustness.

[BibT_eX]

[DOI]

Frontiers Comput. Sci., 2023

Fair subgraph selection for contagion containment (Brief Announcement).

[BibT_eX]

[DOI]

Esther M. Arkin

Rezaul Alam Chowdhury

Jason Huang

Rakesh Ravindran

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

On Flipping the Fréchet Distance.

[BibT_eX]

[DOI]

Omrit Filtser

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Learning to Segment from Noisy Annotations: A Spatial Correction Approach.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Distance and Time Sensitive Filters for Similarity Search in Trajectory Datasets.

[BibT_eX]

[DOI]

Proceedings of the 2023 Symposium on Algorithmic Principles of Computer Systems, 2023

2022

Universal Sorting: Finding a DAG using Priced Comparisons.

[BibT_eX]

[DOI]

CoRR, 2022

A Manifold View of Adversarial Risk.

[BibT_eX]

[DOI]

CoRR, 2022

How to Stay Socially Distant: A Geometric Approach.

[BibT_eX]

[DOI]

Omrit Filtser

CoRR, 2022

Stability of SGD: Tightness analysis and improved bounds.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2022

Obtaining Approximately Optimal and Diverse Solutions via Dispersion.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

A Manifold View of Adversarial Risk.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Topological Detection of Trojaned Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Learning with Feature-Dependent Label Noise: A Progressive Approach.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Learning Representations, 2021

2020

On the I/O complexity of the k-nearest neighbor problem.

[BibT_eX]

[DOI]

Rasmus Pagh

CoRR, 2020

On the I/O Complexity of the k-Nearest Neighbors Problem.

[BibT_eX]

[DOI]

Rasmus Pagh

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

A Topological Filter for Learning with Label Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Batched Predecessor and Sorting with Size-Priced Information in External Memory.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Error-Bounded Correction of Noisy Labels.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization.

[BibT_eX]

[DOI]

Csaba D. Tóth

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2018

Multi-Finger Binary Search Trees.

[BibT_eX]

[DOI]

Maria Sinziana Astefanoaei

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Multi-resolution sketches and locality sensitive hashing for fast trajectory processing.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Bloom Filters, Adaptivity, and the Dictionary Problem.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Buffered Count-Min Sketch on SSD: Theory and Experiments.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Uniformity of Point Samples in Metric Spaces Using Gap Ratio.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Computing Teichmüller Maps Between Polygons.

[BibT_eX]

[DOI]

Found. Comput. Math., 2017

Distance Sensitive Bloom Filters Without False Negatives.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Cross-Referenced Dictionaries and the Limits of Write Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Joint sensing duty cycle scheduling for heterogeneous coverage guarantee.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016

The landscape of bounds for binary search trees.

[BibT_eX]

[DOI]

CoRR, 2016

2015

A Global Geometric View of Splaying.

[BibT_eX]

[DOI]

CoRR, 2015

Greedy Is an Almost Optimal Deque.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Approximate Range Emptiness in Constant Time and Optimal Space.

[BibT_eX]

[DOI]

Allan Grønlund Jørgensen

Kasper Green Larsen

Rasmus Pagh

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Pattern-Avoiding Access in Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Medial Axis Based Routing Has Constant Load Balancing Factor.

[BibT_eX]

[DOI]

Jie Gao

Proceedings of the Algorithms - ESA 2015, 2015

Self-Adjusting Binary Search Trees: What Makes Them Tick?

[BibT_eX]

[DOI]