[et_pb_section fb_built=”1″ _builder_version=”4.23.1″ _module_preset=”default” min_height=”128.7px” custom_margin=”||-3px|||” custom_padding=”24px||26px|||” global_colors_info=”{}”][et_pb_row column_structure=”3_4,1_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”3_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” border_width_bottom=”1px” border_color_bottom=”#E71939″ global_colors_info=”{}”]<\/p>\n
[\/et_pb_text][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”]<\/p>\n
Department of Computer Science [\/et_pb_text][\/et_pb_column][et_pb_column type=”1_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_image src=”https:\/\/www.qc.cuny.edu\/academics\/cs\/wp-content\/uploads\/sites\/137\/2025\/04\/mayank_goswami_webpage.jpg” alt=”Mayank Goswami, Associate Professor, Computer Science” title_text=”mayank_goswami_webpage” _builder_version=”4.27.4″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_image][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ _builder_version=”4.23.1″ _module_preset=”default” custom_padding=”7px||17px|||” global_colors_info=”{}”][et_pb_row column_structure=”3_4,1_4″ _builder_version=”4.23.1″ _module_preset=”default” custom_margin=”-18px|auto||auto||” custom_padding=”5px|||||” global_colors_info=”{}”][et_pb_column type=”3_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” text_font_size=”16px” global_colors_info=”{}”]<\/p>\n Hiring<\/span>: Ph.D. and Postdoc Positions available! Requirements for the Ph.D. position are a strong mathematical foundation and knowledge of algorithm design. Requirements for the Postdoctoral position are a strong record of publication in top theoretical CS or ML venues. Email me if interested.<\/p>\n Short Bio<\/strong>: I received my Ph.D. from the Applied Mathematics and Statistics<\/a> at the Stony Brook University<\/a>, New York. My advisors were Joe Mitchell<\/a> and David Gu<\/a>. From 2013-2016 I was a researcher at the Max-Planck Institute for Informatics<\/a> in Germany, in the Algorithms and Complexity<\/a> group headed by Kurt Mehlhorn. I received my Bachelors in Mathematics (B.Math.) from the Indian Statistical Institute<\/a>, Bangalore, India.<\/p>\n Research Interests:<\/strong><\/p>\n I hosted the Fall Workshop on Computational Geometry (FWCG) in October 2018<\/a>\u00a0and\u00a0November 2025<\/a>.<\/p>\n I organize the Computer Science Seminar, Q4C (Queens College CS Colloquium)<\/p>\n [\/et_pb_text][\/et_pb_column][et_pb_column type=”1_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_button button_url=”#grants” button_text=”Grants” button_alignment=”left” _builder_version=”4.27.4″ _module_preset=”default” custom_button=”on” button_text_size=”16px” button_text_color=”#FFFFFF” button_bg_color=”#E71939″ button_border_width=”2px” button_border_radius=”0px” button_use_icon=”off” custom_margin=”|0px|6px|0px|false|false” custom_css_main_element=”width: 100%” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”#publications” button_text=”Publications” button_alignment=”left” _builder_version=”4.27.4″ _module_preset=”default” custom_button=”on” button_text_size=”16px” button_text_color=”#000000″ button_bg_color=”#EFEFEF” button_border_width=”0px” button_border_radius=”1px” custom_margin=”||8px||false|false” button_text_color_tablet=”#000000″ button_text_color_phone=”#000000″ button_text_color_last_edited=”on|desktop” custom_css_main_element=”width: 100%” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”#talks” button_text=”Talks” button_alignment=”left” _builder_version=”4.27.4″ _module_preset=”default” custom_button=”on” button_text_size=”16px” button_text_color=”#000000″ button_bg_color=”#EFEFEF” button_border_width=”0px” button_border_radius=”0px” custom_margin=”||7px||false|false” custom_css_main_element=”width: 100%” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”#students” button_text=”Students” button_alignment=”left” _builder_version=”4.27.4″ _module_preset=”default” custom_button=”on” button_text_size=”16px” button_text_color=”#000000″ button_bg_color=”#EFEFEF” button_border_width=”0px” button_border_radius=”0px” custom_css_main_element=”width: 100%;” global_colors_info=”{}”][\/et_pb_button][et_pb_button button_url=”#teachings” button_text=”Teachings” button_alignment=”left” _builder_version=”4.27.4″ _module_preset=”default” custom_button=”on” button_text_size=”16px” button_text_color=”#000000″ button_bg_color=”#EFEFEF” button_border_width=”0px” button_border_radius=”0px” custom_margin=”-21px||0px||false|false” custom_padding=”0px||||false|false” custom_css_main_element=”width: 100%;” global_colors_info=”{}”][\/et_pb_button][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”3_4,1_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”3_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_text module_id=”grants” _builder_version=”4.27.4″ _module_preset=”default” border_width_bottom=”1px” border_color_bottom=”#E71939″ global_colors_info=”{}”]<\/p>\n [\/et_pb_text][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” text_font_size=”16px” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n My research is supported thanks to the following sponsors.<\/p>\n [\/et_pb_text][\/et_pb_column][et_pb_column type=”1_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”3_4,1_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”3_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_text module_id=”publications” _builder_version=”4.27.4″ _module_preset=”default” border_width_bottom=”1px” border_color_bottom=”#E71939″ global_colors_info=”{}”]<\/p>\n [\/et_pb_text][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” text_font_size=”16px” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n Reverse-chronologically ordered. Authors are ordered alphabetically by convention in theory. Uses of the files linked below are subject to copyrights of respective publishers. Please check before use.<\/p>\n <\/p>\n [\/et_pb_text][\/et_pb_column][et_pb_column type=”1_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][\/et_pb_column][\/et_pb_row][et_pb_row column_structure=”3_4,1_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_column type=”3_4″ _builder_version=”4.23.1″ _module_preset=”default” global_colors_info=”{}”][et_pb_text module_id=”talks” _builder_version=”4.27.4″ _module_preset=”default” border_width_bottom=”1px” border_color_bottom=”#E71939″ global_colors_info=”{}”]<\/p>\n [\/et_pb_text][et_pb_text _builder_version=”4.27.4″ _module_preset=”default” text_font_size=”16px” global_colors_info=”{}”]<\/p>\n
Queens College, CUNY & Graduate Center, CUNY
Science Building A202
65-30 Kissena Blvd, Flushing, NY 11367
Email: mayank.goswami@qc.cuny.edu<\/a><\/p>\n\n
Grants<\/h2>\n
\n
Publications<\/h2>\n
Peer-Reviewed Conferences<\/h3>\n
\n
A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems<\/a><\/span><\/li>\n
Computing Diverse and Nice Triangulations<\/a><\/span>
Proc. of the 25th International Symposium on Fundamentals of Computation Theory, (FCT), September 2025<\/span><\/em><\/li>\n
Vantage Point Selection Algorithms for Bottleneck Capacity Estimation<\/a><\/span>
Proc of the 19th Algorithms and Data Structures Symposium (WADS), August 2025<\/span><\/em><\/li>\n
A Theoretical Study of Neural Network Expressive Power via Manifold Topology<\/a><\/span>
Transactions on Machine Learning Research (TMLR), 2025<\/span><\/em><\/li>\n
Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments<\/a><\/span>
Proc of the 52nd EATCS International Colloquium on Automata, Languages and Programming (ICALP), July 2025<\/span><\/em><\/li>\n
On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting<\/a><\/span>
Proc. Of the 27th International Conference on Approximation Algorithms for Combinatorial Optimization (APPROX), August 2024<\/span><\/li>\n
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio<\/a><\/span>
Proc. Of the 15th Innovations in Theoretical Computer Science (ITCS), January 2024<\/span><\/li>\n
On the Existence of a Trojaned Twin Model<\/span>
BANDS Workshop at the 11th International Conference on Learning Representations (ICLR), May 2023<\/span><\/li>\n
Learning to Segment from Noisy Annotations: A Spatial Correction Approach<\/span>
The 11th International Conference on Learning Representations (ICLR), May 2023<\/span><\/li>\n
On Flipping the Frechet Distance<\/a><\/span>
Proc. of the 14th Innovations in Theoretical Computer Science (ITCS), January 2023<\/span><\/li>\n
Distance and Time Sensitive Filters for Similarity Search in Trajectory Datasets<\/span>
Proc. of the SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS 23), January 2023<\/span><\/li>\n
Obtaining Approximately Optimal and Diverse Solutions via Dispersion<\/a><\/span>
Proceedings of the 15th Latin American Theoretical Informatics Symposium (LATIN), November 2022<\/span><\/li>\n
The Impact of Maternal PTSD and Child Temperament on Child Behavioral Problems: An Interpretable Machine Learning Approach<\/span>
Presented at the 38th Annual Meeting of the International Society for Traumatic Stress Studies (ISTSS), November, 2022<\/span><\/li>\n
Stability of SGD: Tightness Analysis and Improved Bounds<\/a><\/span>
Proceedings of the 38th Conference on Uncertainty in Artificial Intelligence (UAI) August 2022<\/span><\/li>\n
A Manifold View of Adversarial Risk<\/a><\/span>
Proceedings of the 25th International Conference on Artificial Intelligence and Statistics (AISTATS 2022)<\/span><\/li>\n
Topological Detection of Trojaned Neural Networks<\/a><\/span>
Proceedings of the 35th Conference on Neural Information Processing Systems (NeurIPS’21), December 2021.<\/span><\/li>\n
Learning with Feature-Dependent Label Noise: A Progressive Approach<\/a><\/span>
Proc. of the 9th International Conference of Learning Representations (ICLR), 2021. (Spotlight).<\/span><\/li>\n
A Topological Filter for Learning with Label Noise<\/a><\/span>
Proceedings of the 34th Conference on Neural Information Processing Systems (NeurIPS’20), December 2020.<\/span><\/li>\n
On the I\/O-Complexity of the k-nearest neighbors problem<\/a><\/span>
Proc. of the 2020 ACM SIGMOD\/PODS (Principles of Database Systems) Conference (PODS’20), June 2020.<\/span><\/li>\n
Error-Bounded Correction of Noisy Labels<\/a><\/span>
Proc. of the 37th International Conference on Machine Learning (ICML’20), July 2020.<\/span><\/li>\n
Cutting Polygons into Small Pieces with Chords: Laser-Based Localization<\/a><\/span>
Proc. of the European Symposium on Algorithms (ESA’20), July 2020.<\/span><\/li>\n
Batched Predecessor and Sorting with Size-Priced Information in External Memory<\/a><\/span>
Proc. of the 14th Latin American Theoretical Informatics Symposium (LATIN’20), June 2020.<\/span><\/li>\n
Multi-finger binary search trees<\/a><\/span>
29th International Symposium on Algorithms and Computation (ISAAC), December 2018.<\/span><\/li>\n
Multi-resolution sketches and locality sensitive hashing for fast trajectory processing<\/a><\/span>
Proceedings of the 26th International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2018)<\/span>.<\/li>\n
Bloom Filters, Adaptivity and the Dictionary Problem<\/a><\/span>
Proc. of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), October 2018.<\/span><\/li>\n
Buffered Count-Min Sketch on SSD: Theory and Experiments<\/span>
Proc. of the 26th European Symposium on Algorithms (ESA), August 2018.<\/span><\/li>\n
Joint Sensing Duty Cycle Scheduling For Heterogenous Coverage Guarantee<\/span>
Proc. of the 36th Annual IEEE Conference on Computer Communications 2017 (INFOCOMM’17).<\/span><\/li>\n
Distance Sensitive Bloom Filters without False Negatives<\/a><\/span>
Proc. of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’17), January, 2017.<\/span><\/li>\n
Cross Referencing and the Limits of Write Optimization<\/a><\/span>
Proc. of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’17), January, 2017.<\/span><\/li>\n
Pattern-Avoiding Access in Binary Search Trees<\/a><\/span>
Symposium on Foundations of Computer Science (FOCS’15), October 2015.<\/span><\/li>\n
Medial Axis Based Routing has Constant Load Balancing Factor<\/a><\/span>
European Symposium on Algorithms (ESA’15), September 2015.<\/span><\/li>\n
Self-Adjusting Binary Search Trees: What Makes Them Tick?<\/a><\/span>
European Symposium on Algorithms (ESA’15), September 2015.<\/span><\/li>\n
Space Filling Curves for 3D Sensor Networks with Complex Topologys<\/a><\/span>
Proc. of the 27th Canadian Conference on Computational Geometry (CCCG’15), August 2015.<\/span><\/li>\n
Greedy is an almost optimal deque<\/a><\/span>
Proc. of the Algorithms and Data Structures Symposium (WADS’15), August, 2015.<\/span><\/li>\n
Computing Teichm\u00fcller Maps between Polygons<\/a><\/span>
Proc. of the 31st International Symposium on Computational Geometry (SoCG’15), June, 2015. Invited to Journal of Computational Geometry (SoCG15 special issue).<\/span><\/li>\n
Approximate Range Emptiness in Constant Time and Optimal Space<\/a><\/span>
Proc. of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’15), January, 2015.<\/span><\/li>\n
Uniformity of point samples in metric spaces using gap ratio<\/a><\/span>
Proc. of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC’15), May 2015.<\/span><\/li>\n
The Batched Predecessor Problem in External Memory<\/a><\/span>
Proc. of the European Symposium on Algorithms (ESA’14), September, 2014.<\/span><\/li>\n
Load Balanced Short Path Routing in Large-Scale Wireless Networks Using Area-Preserving Maps<\/a><\/span>
proc. of the 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’14), August, 2014.<\/span><\/li>\n
Geometric Registration Based on Distortion Estimation<\/a><\/span>
Proc. of the International Conference on Computer Vision (ICCV’13), December, 2013.<\/span><\/li>\n
Topology Dependent Space Filling Curves for Sensor Networks and Applications<\/a><\/span>
Proc. of the 32nd Annual IEEE Conference on Computer Communications (INFOCOM’13), April, 2013.<\/span><\/li>\n
Is Random Walk Truly Memoryless – Traffic analysis and Source Location Privacy Under Random Walk<\/a><\/span>
Proc. of the 32nd Annual IEEE Conference on Computer Communications (INFOCOM’13), April, 2013.<\/span><\/li>\n
Exploration of Path Space using Sensor Network Geometry<\/a><\/span>
Proc. of the 10th International Symposium on Information Processing in Sensor Networks (IPSN), 49-60, April, 2011.<\/span><\/li>\n<\/ol>\nJournal<\/span><\/h3>\n
\n
Uniformity of Point Samples in Metric Spaces Using Gap Ratio<\/a><\/span>
SIAM J. Discret. Math. 31(3): 2138-2171 (2017)<\/span>.<\/li>\n
Manifold-driven decomposition for adversarial robustness<\/a><\/span>
Frontiers Comput. Sci. 5 (2023)<\/span>.<\/li>\n
On Flipping the Fr\u00e9chet Distance<\/span>
Algorithmica (2024).<\/li>\n
Computing Teichm\u00fcller Maps between Polygons<\/a><\/span>
Journal of Foundations of Computational Mathematics (JoFOCM)<\/span>.<\/li>\n<\/ol>\nWorkshops<\/h3>\n
\n
On Flipping the Frechet Distance<\/span>
30th Annual Fall Workshop on Computational Geometry (FWCG 2022), October, 2022<\/span><\/li>\n
Distance and Time Sensitive Filters for Similarity Search in Trajectory Datasets<\/span>
30th Annual Fall Workshop on Computational Geometry (FWCG 2022), October, 2022<\/span><\/li>\n
Obtaining Approximately Optimal and Diverse Solutions via Dispersion<\/span>
30th Annual Fall Workshop on Computational Geometry (FWCG 2022), October, 2022<\/span><\/li>\n
Lightweight Sketches for Mining Trajectory Data<\/span>
The 27th Fall Workshop on Computational Geometry (FWCG), October 2017<\/span>.<\/li>\n
Joint Sensing Duty Cycle Scheduling for Heterogeneous Coverage Guarantee<\/span>
The 26th Fall Workshop on Computational Geometry (FWCG), October 2016<\/span>.<\/li>\n
Optimal Cutting of a Polygon by Lasers<\/span>
The 26th Fall Workshop on Computational Geometry (FWCG), October 2016<\/span>.<\/li>\n
The I\/O complexity of sorting with two key lengths<\/span>
Workshop on Massive Data Algorithmics (MASSIVE), 2013<\/span>.<\/li>\n<\/ol>\nTalks<\/h2>\n
\n