You may have seen me at
You may have seen me at
On computing diverse solutions in optimization, University of Padua, Padua, Italy, September 2025.
On recent progress in computing diverse solutions in optimization, IT University of Copenhagen, Copenhagen, Denmark, September 2025.
Computing Diverse and Nice Triangulations, Fundamentals of Computation Theory (FCT 2025), Wroclaw, Poland, September 2025.
Algorithms for Generating Diverse Solutions to SAT, Fine-grained and Parameterized Complexity Today (FPcT) at National University of Singapore, June 2025.
Applications of Conformal and Quasiconformal Maps, Tata Institute of Fundamental Research-Centre for Applicable Mathematics (TIFR-CAM), Bangalore, India, December 2024.
Finding Diverse Triangulations and Geometric Knapsacks, NYU Courant Geometry Seminar, April 2024.
On Instance Optimal Algorithms for Sorting Nuts and Bolts and Sorting with Priced Information, University of Wroclaw, Poland, August 2024.
Finding Diverse Triangulations and Geometric Knapsacks, University of Edinburgh. Scotland UK, September 2024.
Applications of Conformal and Quasiconformal Maps, Universidad Nacional Autonoma de Mexico, Oaxaca, Mexico, August 2023.
On Flipping the Frechet Distance, ITCS, Simons Institute for Computing, Berkeley. January 2023.
Universal Sorting: Finding a DAG with priced comparisons, Rutgers Theory Seminar, December 2022.
How to stay socially distant: a geometric approach, NYU Courant Geometry Seminar, February 2021.
On the I/O-Complexity of the K-Nearest Neighbors Problem, Principles of Database Systems (PODS), June 2020.
Recent Progress on the Dynamic Optimality Conjecture, NYC Discrete Geometry Seminar, April 2019.
Computing extremal quasiconformal mapping, SUNY Binghamton, April 2019.
Multi-finger binary search trees, International Symposium on Algorithms and Computation (ISAAC), Jiaoxi, Taiwan, December 2018.
On Clairvoyance in Binary Search Trees: Recent Progress on the Dynamic Optimality Conjecture, University of Padova, Italy, September 2018.
Distance-sensitive Bloom Filters, University of Edinburgh, August 2017.
Medial axis based routing has constant load balancing factor, 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).