Mayank Goswami

Orcid: 0000-0002-2111-3210

Affiliations:
  • City University of New York, NY, USA
  • Stony Brook University, New York, NY, USA (PhD)
  • Max-Planck Institute for Informatics, Saarbrücken, Germany, (2013 - 2016)
  • Indian Statistical Institute, Bangalore, India (former)


According to our database1, Mayank Goswami authored at least 45 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the geometry of <i>k</i>-SAT solutions: what more can PPZ and Schöning's algorithms do?
CoRR, 2024

An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio.
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.
Proceedings of the Approximation, 2024

2023
Manifold-driven decomposition for adversarial robustness.
Frontiers Comput. Sci., 2023

Fair subgraph selection for contagion containment (Brief Announcement).
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

On Flipping the Fréchet Distance.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Learning to Segment from Noisy Annotations: A Spatial Correction Approach.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Distance and Time Sensitive Filters for Similarity Search in Trajectory Datasets.
Proceedings of the 2023 Symposium on Algorithmic Principles of Computer Systems, 2023

2022
Universal Sorting: Finding a DAG using Priced Comparisons.
CoRR, 2022

A Manifold View of Adversarial Risk.
CoRR, 2022

How to Stay Socially Distant: A Geometric Approach.
CoRR, 2022

Stability of SGD: Tightness analysis and improved bounds.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Obtaining Approximately Optimal and Diverse Solutions via Dispersion.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

A Manifold View of Adversarial Risk.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Topological Detection of Trojaned Neural Networks.
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.
Proceedings of the 9th International Conference on Learning Representations, 2021

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

On the I/O Complexity of the k-Nearest Neighbors Problem.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

A Topological Filter for Learning with Label Noise.
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.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Error-Bounded Correction of Noisy Labels.
Proceedings of the 37th International Conference on Machine Learning, 2020

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2018
Multi-Finger Binary Search Trees.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Multi-resolution sketches and locality sensitive hashing for fast trajectory processing.
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Bloom Filters, Adaptivity, and the Dictionary Problem.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Buffered Count-Min Sketch on SSD: Theory and Experiments.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Uniformity of Point Samples in Metric Spaces Using Gap Ratio.
SIAM J. Discret. Math., 2017

Computing Teichmüller Maps Between Polygons.
Found. Comput. Math., 2017

Distance Sensitive Bloom Filters Without False Negatives.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Cross-Referenced Dictionaries and the Limits of Write Optimization.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Joint sensing duty cycle scheduling for heterogeneous coverage guarantee.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016
The landscape of bounds for binary search trees.
CoRR, 2016

2015
A Global Geometric View of Splaying.
CoRR, 2015

Greedy Is an Almost Optimal Deque.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Approximate Range Emptiness in Constant Time and Optimal Space.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Pattern-Avoiding Access in Binary Search Trees.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Medial Axis Based Routing Has Constant Load Balancing Factor.
Proceedings of the Algorithms - ESA 2015, 2015

Self-Adjusting Binary Search Trees: What Makes Them Tick?
Proceedings of the Algorithms - ESA 2015, 2015

Space Filling Curves for 3D Sensor Networks with Complex Topology.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Load balanced short path routing in large-scale wireless networks using area-preserving maps.
Proceedings of the Fifteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2014

The Batched Predecessor Problem in External Memory.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Is random walk truly memoryless - Traffic analysis and source location privacy under random walks.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Topology dependent space filling curves for sensor networks and applications.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Geometric Registration Based on Distortion Estimation.
Proceedings of the IEEE International Conference on Computer Vision, 2013

2011
Exploration of path space using sensor network geometry.
Proceedings of the 10th International Conference on Information Processing in Sensor Networks, 2011


  Loading...