Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMayank Goswami 0001
Person information
- affiliation: City University of New York, NY, USA
- affiliation (PhD): Stony Brook University, New York, NY, USA
- affiliation (2013 - 2016): Max-Planck Institute for Informatics, Saarbrücken, Germany,
- affiliation (former): Indian Statistical Institute, Bangalore, India
Other persons with the same name
- Mayank Goswami 0002 — Indian Institute of Technology Roorkee, Department of Physics, India (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c36]Mayank Goswami, Riko Jacob:
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. ITCS 2024: 56:1-56:17- 2023
- [c35]Madhav Narayan Bhat, Paul Cesaretti, Mayank Goswami, Prashant Pandey:
Distance and Time Sensitive Filters for Similarity Search in Trajectory Datasets. APOCS 2023: 51-63 - [c34]Jiachen Yao, Yikai Zhang, Songzhu Zheng, Mayank Goswami, Prateek Prasanna, Chao Chen:
Learning to Segment from Noisy Annotations: A Spatial Correction Approach. ICLR 2023 - [c33]Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk:
On Flipping the Fréchet Distance. ITCS 2023: 51:1-51:22 - [c32]Esther M. Arkin, Rezaul Alam Chowdhury, Mayank Goswami, Jason Huang, Joseph S. B. Mitchell, Valentin Polishchuk, Rakesh Ravindran:
Fair subgraph selection for contagion containment (Brief Announcement). LAGOS 2023: 370-372 - [i25]Jiachen Yao, Yikai Zhang, Songzhu Zheng, Mayank Goswami, Prateek Prasanna, Chao Chen:
Learning to Segment from Noisy Annotations: A Spatial Correction Approach. CoRR abs/2308.02498 (2023) - [i24]Mayank Goswami, Riko Jacob:
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. CoRR abs/2311.05773 (2023) - 2022
- [c31]Wenjia Zhang, Yikai Zhang, Xiaoling Hu, Mayank Goswami, Chao Chen, Dimitris N. Metaxas:
A Manifold View of Adversarial Risk. AISTATS 2022: 11598-11614 - [c30]Jie Gao
, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang:
Obtaining Approximately Optimal and Diverse Solutions via Dispersion. LATIN 2022: 222-239 - [c29]Yikai Zhang, Wenjia Zhang, Sammy Bald, Vamsi Pingali, Chao Chen, Mayank Goswami:
Stability of SGD: Tightness analysis and improved bounds. UAI 2022: 2364-2373 - [i23]Jie Gao, Mayank Goswami, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang:
Obtaining Approximately Optimal and Diverse Solutions via Dispersion. CoRR abs/2202.10028 (2022) - [i22]Omrit Filtser, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk:
How to Stay Socially Distant: A Geometric Approach. CoRR abs/2203.04548 (2022) - [i21]Wenjia Zhang, Yikai Zhang, Xiaolin Hu, Mayank Goswami, Chao Chen, Dimitris N. Metaxas:
A Manifold View of Adversarial Risk. CoRR abs/2203.13277 (2022) - [i20]Mayank Goswami, Riko Jacob:
Universal Sorting: Finding a DAG using Priced Comparisons. CoRR abs/2211.04601 (2022) - 2021
- [c28]Yikai Zhang, Songzhu Zheng, Pengxiang Wu, Mayank Goswami, Chao Chen:
Learning with Feature-Dependent Label Noise: A Progressive Approach. ICLR 2021 - [c27]Songzhu Zheng, Yikai Zhang, Hubert Wagner, Mayank Goswami, Chao Chen:
Topological Detection of Trojaned Neural Networks. NeurIPS 2021: 17258-17272 - [i19]Yikai Zhang, Wenjia Zhang, Sammy Bald, Vamsi Pingali, Chao Chen, Mayank Goswami:
Stability of SGD: Tightness Analysis and Improved Bounds. CoRR abs/2102.05274 (2021) - [i18]Yikai Zhang, Songzhu Zheng, Pengxiang Wu, Mayank Goswami, Chao Chen:
Learning with Feature-Dependent Label Noise: A Progressive Approach. CoRR abs/2103.07756 (2021) - [i17]Songzhu Zheng, Yikai Zhang, Hubert Wagner, Mayank Goswami, Chao Chen:
Topological Detection of Trojaned Neural Networks. CoRR abs/2106.06469 (2021) - 2020
- [c26]Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. ESA 2020: 7:1-7:23 - [c25]Songzhu Zheng, Pengxiang Wu, Aman Goswami, Mayank Goswami, Dimitris N. Metaxas, Chao Chen:
Error-Bounded Correction of Noisy Labels. ICML 2020: 11447-11457 - [c24]Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas:
Batched Predecessor and Sorting with Size-Priced Information in External Memory. LATIN 2020: 155-167 - [c23]Pengxiang Wu, Songzhu Zheng, Mayank Goswami, Dimitris N. Metaxas, Chao Chen:
A Topological Filter for Learning with Label Noise. NeurIPS 2020 - [c22]Mayank Goswami, Riko Jacob, Rasmus Pagh:
On the I/O Complexity of the k-Nearest Neighbors Problem. PODS 2020: 205-212 - [i16]Mayank Goswami, Riko Jacob, Rasmus Pagh:
On the I/O complexity of the k-nearest neighbor problem. CoRR abs/2002.04870 (2020) - [i15]Michael A. Bender, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas:
Batched Predecessor and Sorting with Size-Priced Information in External Memory. CoRR abs/2004.13197 (2020) - [i14]Esther M. Arkin, Rathish Das, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk, Csaba D. Tóth:
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization. CoRR abs/2006.15089 (2020) - [i13]Songzhu Zheng, Pengxiang Wu, Aman Goswami, Mayank Goswami, Dimitris N. Metaxas, Chao Chen:
Error-Bounded Correction of Noisy Labels. CoRR abs/2011.10077 (2020) - [i12]Pengxiang Wu, Songzhu Zheng, Mayank Goswami, Dimitris N. Metaxas, Chao Chen:
A Topological Filter for Learning with Label Noise. CoRR abs/2012.04835 (2020)
2010 – 2019
- 2018
- [c21]Mayank Goswami, Dzejla Medjedovic, Emina Mekic, Prashant Pandey:
Buffered Count-Min Sketch on SSD: Theory and Experiments. ESA 2018: 41:1-41:15 - [c20]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. FOCS 2018: 182-193 - [c19]Maria Sinziana Astefanoaei, Paul Cesaretti, Panagiota Katsikouli, Mayank Goswami, Rik Sarkar:
Multi-resolution sketches and locality sensitive hashing for fast trajectory processing. SIGSPATIAL/GIS 2018: 279-288 - [c18]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-Finger Binary Search Trees. ISAAC 2018: 55:1-55:26 - [i11]Mayank Goswami, Dzejla Medjedovic, Emina Mekic, Prashant Pandey:
Buffered Count-Min Sketch on SSD: Theory and Experiments. CoRR abs/1804.10673 (2018) - [i10]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-finger binary search trees. CoRR abs/1809.01759 (2018) - 2017
- [j2]Mayank Goswami, Xianfeng Gu, Vamsi Pingali, Gaurish Telang:
Computing Teichmüller Maps Between Polygons. Found. Comput. Math. 17(2): 497-526 (2017) - [j1]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. SIAM J. Discret. Math. 31(3): 2138-2171 (2017) - [c17]Kin Sum Liu, Tyler Mayer, Hao-Tsung Yang, Esther M. Arkin, Jie Gao, Mayank Goswami, Matthew P. Johnson, Nirman Kumar, Shan Lin:
Joint sensing duty cycle scheduling for heterogeneous coverage guarantee. INFOCOM 2017: 1-9 - [c16]Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen:
Distance Sensitive Bloom Filters Without False Negatives. SODA 2017: 257-269 - [c15]Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai:
Cross-Referenced Dictionaries and the Limits of Write Optimization. SODA 2017: 1523-1532 - [i9]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Rob Johnson, Samuel McCauley, Shikha Singh:
Bloom Filters, Adaptivity, and the Dictionary Problem. CoRR abs/1711.01616 (2017) - 2016
- [i8]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
The landscape of bounds for binary search trees. CoRR abs/1603.04892 (2016) - [i7]Mayank Goswami, Rasmus Pagh, Francesco Silvestri, Johan Sivertsen:
Distance Sensitive Bloom Filters Without False Negatives. CoRR abs/1607.05451 (2016) - 2015
- [c14]Mayank Goswami, Siming Li, Junwei Zhang, Emil Saucan, Xianfeng David Gu, Jie Gao:
Space Filling Curves for 3D Sensor Networks with Complex Topology. CCCG 2015 - [c13]Mayank Goswami, Xianfeng Gu, Vamsi Pingali, Gaurish Telang:
Computing Teichmüller Maps between Polygons. SoCG 2015: 615-629 - [c12]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA 2015: 300-312 - [c11]Jie Gao, Mayank Goswami:
Medial Axis Based Routing Has Constant Load Balancing Factor. ESA 2015: 557-569 - [c10]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-Avoiding Access in Binary Search Trees. FOCS 2015: 410-423 - [c9]Mayank Goswami, Allan Grønlund Jørgensen, Kasper Green Larsen, Rasmus Pagh:
Approximate Range Emptiness in Constant Time and Optimal Space. SODA 2015: 769-775 - [c8]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. TAMC 2015: 347-358 - [c7]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. WADS 2015: 152-165 - [i6]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
A Global Geometric View of Splaying. CoRR abs/1503.03105 (2015) - [i5]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. CoRR abs/1506.08319 (2015) - [i4]Mayank Goswami, Siming Li, Junwei Zhang, Emil Saucan, Xianfeng David Gu, Jie Gao:
Space Filling Curves for 3D Sensor Networks with Complex Topology. CoRR abs/1507.02931 (2015) - [i3]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-avoiding access in binary search trees. CoRR abs/1507.06953 (2015) - 2014
- [c6]Michael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai:
The Batched Predecessor Problem in External Memory. ESA 2014: 112-124 - [c5]Mayank Goswami, Chien-Chun Ni, Xiaomeng Ban, Jie Gao, Xianfeng David Gu, Vamsi Pingali:
Load balanced short path routing in large-scale wireless networks using area-preserving maps. MobiHoc 2014: 63-72 - [i2]Mayank Goswami, Allan Grønlund Jørgensen, Kasper Green Larsen, Rasmus Pagh:
Approximate Range Emptiness in Constant Time and Optimal Space. CoRR abs/1407.2907 (2014) - [i1]Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of point samples in metric spaces using gap ratio. CoRR abs/1411.7819 (2014) - 2013
- [c4]Wei Zeng, Mayank Goswami, Feng Luo, Xianfeng Gu:
Geometric Registration Based on Distortion Estimation. ICCV 2013: 2632-2639 - [c3]Xiaomeng Ban, Mayank Goswami, Wei Zeng, Xianfeng Gu, Jie Gao:
Topology dependent space filling curves for sensor networks and applications. INFOCOM 2013: 2166-2174 - [c2]Rui Shi, Mayank Goswami, Jie Gao, Xianfeng Gu:
Is random walk truly memoryless - Traffic analysis and source location privacy under random walks. INFOCOM 2013: 3021-3029 - 2011
- [c1]Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Zeng, Jie Gao, Xianfeng Gu:
Exploration of path space using sensor network geometry. IPSN 2011: 49-60
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-04-21 17:00 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:
