Mayank Goswami

MaRDI QIDQ2081611zbMATH OpenORCIDWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments	2026-09-10	Paper
Vantage point selection algorithms for bottleneck capacity estimation	2026-08-11	Paper
Computing diverse and nice triangulations	2026-02-26	Paper
Fair subgraph selection for contagion containment Procedia Computer Science	2025-12-11	Paper
An algorithm for bichromatic sorting with polylog competitive ratio	2025-11-04	Paper
On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting	2025-10-06	Paper
Bloom filters, adaptivity, and the dictionary problem	2025-08-12	Paper
Pattern-avoiding access in binary search trees	2025-08-05	Paper
On flipping the Fréchet distance Algorithmica	2024-12-03	Paper
On flipping the Fréchet distance	2024-09-25	Paper
Obtaining approximately optimal and diverse solutions via dispersion LATIN 2022: Theoretical Informatics	2023-07-26	Paper
Batched predecessor and sorting with size-priced information in external memory (available as arXiv preprint)	2022-10-13	Paper
Multi-Finger Binary Search Trees (available as arXiv preprint)	2022-07-21	Paper
Buffered Count-Min Sketch on SSD: Theory and Experiments (available as arXiv preprint)	2021-08-04	Paper
Distance sensitive Bloom filters without false negatives Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Cross-referenced dictionaries and the limits of write optimization Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Approximate range emptiness in constant time and optimal space Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
Uniformity of point samples in metric spaces using gap ratio SIAM Journal on Discrete Mathematics	2017-09-27	Paper
Self-adjusting binary search trees: what makes them tick? Algorithms - ESA 2015	2015-11-19	Paper
Greedy is an almost optimal deque Lecture Notes in Computer Science	2015-10-30	Paper
Uniformity of point samples in metric spaces using gap ratio Lecture Notes in Computer Science	2015-09-30	Paper
Pattern-avoiding access in binary search trees	2015-07-24	Paper
The batched predecessor problem in external memory Algorithms - ESA 2014	2014-10-08	Paper

Research outcomes over time

This page was built for person: Mayank Goswami