Mayank Goswami.   

Algorithms and Geometry
Assistant Professor
Department of Computer Science
CUNY Queens College & CUNY Graduate Center
SB-102 Science Building
65-30 Kissena Boulevard, Flushing, NY 11367
Email : first name.lastname@qc.cuny.edu

I am hosting the Fall Workshop on Computational Gemoetry (FWCG) in October 2018. Here is the webpage.

Short Bio: I received my Ph.D. from the Applied Mathematics and Statistics at the Stony Brook University, New York (CGPA: 3.99/4). My advisors were Joe Mitchell and David Gu. From 2013-2016 I was a researcher at the Max-Planck Institute for Informatics in Germany, in the Algorithms and Complexity group headed by Kurt Mehlhorn. I received my Bachelors in Mathematics (B.Math.) from the Indian Statistical Institute, Bangalore , India.

If you are are a prospective student who wants to enjoy five years solving cool and interesting algorithmic problems (in New York City), send me an email, and check out the graduate program at CUNY Graduate Center.

Research Interests

I am interested in algorithms and mathematical techniques for handling large sets of data that are either 1) centralized, 2) distributed or 3) visual.

  • Centralized data sets -- Approximate and adaptive data structures for databases and the external memory (Disk Access Model) setting. Apart from developing practical and efficient data structures, I also enjoy proving lower bounds on problems arising in these domains.

  • Distributed data sets -- Networks and distributed algorithms for sensor networks and social networks. The main problems I have studied here are distributed load balancing in wireless networks, secure communication protocols, efficient data aggregation via mobile agents and very recently, the topology of social networks. Main tools here are combinatorics, graph theory and optimization.

  • Visual data sets -- Computer Graphics and Vision: Computation in shape spaces (moduli or Teichmuller spaces) and applications to computer vision. Most of my work here is motivated by surface registration and matching problems and uses techniques from classical mathematics (differential, complex and algebraic geometry).

    • I publish in both theory and applied fields, in conferences ranging from (FOCS, SODA, SoCG, ESA) to (INFOCOM, ICCV, IPSN, MobiHoc). If you want to discuss any problems (possibly, but not necessarily, relating to my publications below), feel free to drop me an email.


    Grants

    • (Mini-CAREER) CRII: AF: RUI: Faster and Cache-Efficient Similarity Filters and Searches for Big Data (Award Id : 1755791). $175,000.
    • CUNY Collaborative Open Educational Resources in STEM (COERS) Program: Project-based pedagogical approach in introductory C++ courses. $10,000. Co-PI (along with Daniel Garbin and Kwang Hyun Kim).
    • PSC CUNY Cycle 49 award (type B). $6000.
    • PSC CUNY Cycle 48 award (type B). $6000.

    Publications

    Reverse-chronologically ordered. Uses of the files linked below are subject to copyrights of respective publishers. Please check before use.

    Conferences

    Journal

    Workshops

    • M. Astefanoaei, P. Katsikouli, M. Goswami, R. Sarkar
      Lightweight Sketches for Mining Trajectory Data
      The 27th Fall Workshop on Computational Geometry (FWCG), October 2017
    • K.S. Liu, T. Mayer, H.T. Yang, E. Arkin, J. Gao, M. Goswami, M.P. Johnson, N. Kumar, S. Lin
      Joint Sensing Duty Cycle Scheduling for Heterogeneous Coverage Guarantee
      The 26th Fall Workshop on Computational Geometry (FWCG), October 2016
    • E. Arkin, P. Brass, R. Das, J. Gao, M. Goswami, J.S.B. Mitchell, V. Polishchuk, C. D. Toth
      Optimal Cutting of a Polygon by Lasers
      The 26th Fall Workshop on Computational Geometry (FWCG), October 2016
    • M. Bender, M. Goswami, D. Medjedovic, P. Arango
      The I/O complexity of sorting with two key lengths
      Workshop on Massive Data Algorithmics (MASSIVE), 2013

    Talks

    • Load Balanced Routing using area-preserving maps and medial axis, Courant Geometry Seminar, New York University, November 2016.

    • Computing Teichmuller Maps, University of Washington at Seattle, and City University of New York, October 2015.

    • Medial axis based routing has constant load balancing factor, European Symposium on Algorithms, Patras (ESA'15)

    • Tight lower bounds for approximate range emptiness, Summer School on Lower Bounds, Prague, June 2015.

    • Computing Teichmuller Maps between Polygons, Symposium on Computational Geometry, Eindhoven (SoCG'15)

    • Approximate Range Emptiness in Constant Time and Optimal Space, Symposium on Discrete Algorithms, San Diego (SODA'15)

    • Load Balancing Using Area-Preserving Maps, International Symposium on Mobile Ad Hoc Networking and Computing, Philadelphia (MobiHoc'14)

    • Computing Teichmuller Maps between Polygons, Courant Geometry Seminar, New York University, September 2014.

    • Approximate Range Emptiness in Constant Time and Optimal Space, CG Group (organized by Joe Mitchell), Stony Brook University, August 2014.

    • Computing Teichmuller maps and connections to Tropical Geometry, Oberseminar (organized by Hannah Markwig), Department of Mathematics at University of Saarland, July 2014.

    • Geometric Registration Based on Distortion Estimation, International Conference on Computer Vision, Sydney (ICCV'13)

    • The I/O complexity of sorting with two key lengths, Max-Planck Institute for Informatics, October 2013.

    • Topology Dependent Space Filling Curves for Sensor Networks and Applications, International Conference on Computer Communications, Turin, Italy (INFOCOM'13)

    • Is Random Walk Truly Memoryless - Traffic analysis and Source Location Privacy Under Random Walk, International Conference on Computer Communications, Turin, Italy (INFOCOM'13)


    Students

    • Paul Cesaretti (Spring 2018-present)
    • Rakesh Ravindran (Fall 2018-present)
    • Sammy Bald (Fall 2018-present)


    Teaching

    • Spring 2018 - Algorithms for Big Data (381), Design and Analysis of Algorithms (323).
    • Fall 2017 - Discrete Structures (220), Design and Analysis of Algorithms (323).
    • Spring 2017 - Discrete Structures (220), Design and Analysis of Algorithms (323), Approximation Algorithms (381), Queens College, and Modern Approximation Algorithms, Graduate Center, CUNY.
    • Fall 2016 - Discrete Structures (220), Queens College, CUNY. Approximation Algorithms
    • Approximation Algorithms, Fall 2015, Max-Planck Institute for Informatics.
    • Efficient Data Structures, Summer 2014, Max-Planck Institute for Informatics.
    • Applied Calculus, Fall 2008, Spring 2009, Stony Brook University.