Find Academic Supervisors

Ravi TandonView profile

Professor

• Information Theory
• Machine Learning
• Security and Data Privacy
• +12 more

Ravi Tandon is a Professor in the Department of Electrical and Computer Engineering at the University of Arizona, where he holds a Craig M. Berge Faculty Fellowship and a courtesy appointment in Applied Mathematics. He joined the university in 2015 after serving as a Research Assistant Professor at Virginia Tech. Education: PhD in Electrical and Computer Engineering, University of Maryland, College Park, 2010 B.Tech in Electrical Engineering, Indian Institute of Technology (IIT) Kanpur, 2004 Research Interests: His research spans information theory and its applications to wireless networks, machine learning, security, and privacy. He focuses on trustworthy machine learning, privacy-preserving AI, federated learning, secure communications, and private information retrieval. His work aims to develop foundational theories and practical systems for secure, fair, and efficient AI and communication systems. Recent Research Trends: His most recent publications (2023–2025) emphasize trustworthy AI, including fairness-accuracy tradeoffs, robustness, uncertainty quantification, and privacy in generative models and causal inference. He also continues to advance information-theoretic foundations of secure communications and distributed learning. Scientific Awards: NSF CAREER Award (2017) Keysight Early Career Professor Award (2018) Best Paper Award, IEEE GLOBECOM 2011 Advising and Grants: Dr. Tandon actively supervises PhD and MS students, with former students placed at Apple, Google, Meta, NXP, and other leading tech firms. He has led significant research projects, including an NSF SaTC grant on differential privacy in graph mining. His editorial service includes roles at IEEE Transactions on Information Theory, IEEE Transactions on Wireless Communications, and IEEE Transactions on Communications. Labs and Teams: He leads a research group focused on information theory, machine learning, and privacy, collaborating with researchers in computer science, applied mathematics, and industry. His work bridges theoretical foundations with real-world AI and communication system design.

Mark JerrumView profile

Professor

• Combinatorics
• Computational Complexity
• Theoretical Computer Science
• +7 more

Mark Jerrum is a Professor of Mathematics at Queen Mary University of London, part of the School of Mathematical Sciences. His research focuses on combinatorics, computational complexity, and stochastic processes, particularly in the design and analysis of randomized algorithms. He explores the mixing times of Markov chains and computational complexity of counting problems, including partition functions and generating functions, often motivated by statistical physics, constraint satisfaction, and graph polynomials. Notable grants include an EPSRC-funded project on Sampling in Hereditary Classes (EP/S016694/1, 2019–2023). He has contributed to teaching, serving as module organiser for MTH4213 (Numbers, Sets and Functions) in 2023–24. His work bridges theoretical computer science and discrete mathematics, with applications in algorithmic design and probabilistic analysis. Research highlights include advancements in perfect sampling algorithms, approximation algorithms for counting problems, and foundational work on the interplay between statistical physics models and computational complexity. He is affiliated with the Centre for Combinatorics, Algebra and Number Theory, reflecting his interdisciplinary approach to combinatorial and algorithmic challenges.

• Mathematical Optimization
• Algorithmic Game Theory
• Multi-Agent Systems
• +3 more

Max Klimm is an Assistant Professor for Discrete Optimization at Technische Universität Berlin, affiliated with the Department of Mathematics within Faculty II – Mathematics and Natural Sciences. He holds a PhD in Mathematics from TU Berlin (2012) and previously served as an Assistant Professor for Operations Research at Humboldt-Universität zu Berlin (2014–2016) and led the Junior Research Group for Optimization under Uncertainty at the Einstein-Center for Mathematics (2014–2016). His research focuses on algorithmic game theory, mathematical optimization of multi-agent systems in traffic, telecommunications, and economics. Key areas include network flows, congestion games, mechanism design, and infrastructure networks. He actively contributes to academic activities as an associate editor for journals like International Journal of Game Theory and Operations Research Forum , and has served on program committees for conferences such as AAAI, EC, and WINE. Recent work includes studies on evolutionary road network reconstruction, robustness of potential-based flows, and algorithmic solutions for knapsack and assignment problems. His research bridges theoretical foundations with practical applications in transportation and resource allocation.

• Coding and Information Theory
• Cryptography and Cryptanalysis
• Information Security
• +6 more

Associate Professor Serdar Boztas is affiliated with RMIT University's School of Science in Australia. His academic rank is Associate Professor. He is actively involved in teaching Information Theory, Cryptography and Security, Advanced Topics in Cryptography, and Smartcard Cryptosystems. His research interests span Coding and Information Theory, Cryptography, Information Security, Wireless Communications, and Complex Networks. Research highlights include work on Reed-Solomon codes, insider threat detection, and sequence design with applications in cryptography and signal processing. His recent publications focus on error correction, network security, and algorithmic improvements in coding theory. He has supervised PhD projects on Lightweight Encryption and Insider Threat Mitigation, with notable completed projects in malware analysis and cryptographic countermeasures. Service & Engagement: Committee roles in IEEE workshops, international conferences, and advisory boards (e.g., ISC, AAECC, SECIA). Teaching: Courses emphasize Information Theory, Cryptography, and Security applications. Grants & Funding: Active in securing research funding for projects in cybersecurity and communication systems. Boztas' work bridges theoretical foundations with practical applications in information security, network efficiency, and cryptographic systems. His contributions to sequence design and threat detection methodologies are widely recognized in the field.

Ewan DaviesView profile

Assistant Professor

• Graph Theory
• Combinatorics
• Theoretical Computer Science
• +11 more

Ewan Davies is an Assistant Professor in the Department of Computer Science at Colorado State University, where he conducts research at the intersection of combinatorics, theoretical computer science, and statistical physics. He has previously held positions as a Postdoctoral Researcher at CU Boulder, a Research Fellow at the Simons Institute, and a Postdoc at the University of Amsterdam. His educational background includes a Ph.D. in Mathematics from the London School of Economics and Political Science (2013–2017), an M.Math from the University of Cambridge (2012–2013), and a B.A. (Hons) in Mathematics from the University of Cambridge (2009–2012). Davies’s research focuses on probabilistic and extremal combinatorics, particularly in graph coloring, independent sets, partition functions, and spin models such as the hard-core and Potts models. He employs techniques from statistical physics, entropy compression, and the Lovász local lemma to develop algorithmic frameworks for coloring and counting problems. His work often bridges theoretical insights with practical algorithmic implications, especially in the context of approximate counting and sampling. The trends in his recent publications reveal a sustained focus on algorithmic graph theory, with major contributions to list packing, local graph degeneracy, and computational thresholds in spin systems. His work frequently appears in top-tier venues such as FOCS, STOC, ICALP, and journals like Random Structures & Algorithms and SIAM Journal on Computing . He has co-authored numerous papers with leading researchers in the field, including Ross J. Kang, Will Perkins, and Alexandra Kolla. Sampling and Optimization under Global Constraints, NSF Grant #2309707 PhD Prize for Outstanding Academic Performance, London School of Economics Mathematics Department New Teacher Prize, London School of Economics Foundation Scholarship and R.A. Watchman Prize, Jesus College, Cambridge Foundation Scholarship and Sir Harold Spencer Jones Prize, Jesus College, Cambridge Foundation Scholarship and Ware Prize, Jesus College, Cambridge Foundation Exhibition and Bronowski Prize, Jesus College, Cambridge Davies actively mentors students, having supervised multiple undergraduate and graduate research projects in areas such as redistricting and graph coloring. He is also involved in organizing academic workshops, including the upcoming Rocky Mountain Summer Workshop on Algorithms, Probability, and Combinatorics. His research is supported by the National Science Foundation, and he continues to contribute to both theoretical advances and interdisciplinary applications in computer science and mathematics. He leads research on graph structure via local occupancy, regularity inheritance in hypergraphs, and the algorithmic analysis of phase transitions in statistical mechanical models. His work on the occupancy fraction and fractional coloring has provided new insights into longstanding conjectures in graph theory.

• Causal Inference
• Substance Use Disorders
• Public Health
• +3 more

Kara Rudolph is an Assistant Professor of Epidemiology at the Mailman School of Public Health, Columbia University. Her research focuses on causal inference methods to address substance use disorders, public health policy, and environmental health impacts, with affiliations to the Health Analytics Center. Role: Assistant Professor (Epidemiology) University: Columbia University School: Mailman School of Public Health Affiliation: Health Analytics Her work spans causal inference, substance use disorders, and health policy, emphasizing methodological rigor and real-world applications. Recent publications analyze: Effects of policies (e.g., housing vouchers, cannabis laws, opioid regulations) Environmental exposures (e.g., air pollution, unconventional gas development) Methodological advancements (e.g., Riesz representers, SWIGs, mediation analysis) Health disparities (e.g., racial/ethnic differences, underrepresentation in trials) She actively collaborates on Medicaid patient outcomes and longitudinal studies of complex exposures. Her email is kr2854@cumc.columbia.edu.

Yin Tat LeeView profile

Associate Professor

• Convex Optimization
• Convex Geometry
• Spectral Graph Theory
• +5 more

Yin Tat Lee is an Associate Professor at the Paul G. Allen School of Computer Science and Engineering at the University of Washington, where he has been faculty since 2017 (initially as Assistant Professor until 2022). He also holds a position as Senior Principal Researcher at Microsoft AI since 2024, having previously served as Principal Researcher (2022-2024) and Visiting Researcher (2018-2022) at Microsoft Research. His academic career spans prestigious institutions including MIT, where he completed his PhD in Mathematics. 2024-Now: Member of Technical staff / Senior Principal Researcher in Microsoft AI 2022-2024: Principal Researcher in Microsoft Research 2022-Now: Associate Professor in University of Washington 2017-2022: Assistant Professor in University of Washington 2018-2022: Visiting Researcher in Microsoft Research 2016-2017: Postdoc in Microsoft Research Dr. Lee received his PhD in Mathematics from MIT (2012-2016) and his undergraduate degree in Mathematics from the Chinese University of Hong Kong (2008-2012). His exceptional academic journey was recognized with the MIT Presidential Fellowship and the Charles W. and Jennifer C. Johnson Prize. Lee's research fundamentally advances algorithms across multiple domains, particularly in convex optimization, convex geometry, spectral graph theory, and online algorithms. His work bridges continuous and discrete mathematics to develop state-of-the-art algorithms for fundamental problems in computer science and optimization. Notably, he has developed breakthrough approaches for linear programming, maximum flow problems, and optimization in high-dimensional spaces. His research has evolved from foundational theoretical work to more applied areas including differential privacy and connections to machine learning. Analysis of his recent publications reveals a strong trajectory toward practical applications of theoretical optimization, with significant contributions to differentially private machine learning, efficient sampling methods, and connections between optimization theory and deep learning. His work consistently demonstrates how deep theoretical insights can yield practical algorithmic improvements across computer science. Lee's exceptional contributions have been recognized with numerous prestigious awards including the Packard Fellowship, Sloan Research Fellowship, Microsoft Research Faculty Fellowship, A.W. Tucker Prize, and multiple Best Paper Awards at top theoretical computer science conferences (FOCS, SODA, NeurIPS). He has also received the NSF CAREER Award and MIT's Sprowls Award for his doctoral thesis. Packard Fellowship (2020) Sloan Research Fellowship (2020) Microsoft Research Faculty Fellowship (2019) Best Paper Awards at FOCS, SODA, and NeurIPS A.W. Tucker Prize NSF CAREER Award As an advisor, Lee has mentored PhD students including Haotian Jiang, whose work earned a Best Student Paper award at SODA. His research has been supported by significant grants from NSF and Microsoft Research. Lee actively contributes to the academic community through service on program committees for FOCS, SODA, and other major conferences, as well as organizing workshops on continuous approaches to discrete optimization. He has also taught graduate courses including Theory of Optimization and Continuous Algorithms and undergraduate courses on algorithms. Lee's work bridges theoretical computer science and practical applications, with his recent research expanding into differential privacy for machine learning and connections between optimization theory and deep learning. His collaborative work spans institutions including MIT, Microsoft Research, and the University of Washington, reflecting his position at the intersection of theoretical and applied computer science.

• Graph Algorithms
• Convex Optimization
• Fine-Grained Complexity Theory
• +3 more

Rasmus Kyng is an Assistant Professor at the Department of Computer Science, ETH Zurich, since Fall 2019. He focuses on developing fast algorithms for graph problems, convex optimization, and structured linear equations, with a specialization in fine-grained complexity theory and dynamic graph algorithms. Assistant Professor, Department of Computer Science, ETH Zurich (2019–present) Postdoc, Theory of Computation Group, Harvard (2018–2019) Research Fellow, Simons Institute, UC Berkeley (Fall 2017) His research explores the intersection of graph algorithms, optimization, and complexity, particularly through dynamic graph data structures, sparsification, and applications in machine learning. Recent work includes breakthroughs in almost-linear time algorithms for network flow problems. Key trends in his publications include: Advancements in dynamic graph algorithms and data structures Applications of convex optimization to graph theory Connections between matrix theory and algorithmic efficiency Derandomization techniques for algorithmic speed Expander graph-based oblivious routing Sparsification and low-congestion vertex sparsifiers Scientific recognition includes the FOCS Best Paper Award (2022), ICBS Frontiers of Science Award (2022), and the Machtey Award for Best Student Paper (2017). His group mentors PhD candidates and postdocs, including Ming Ding , Federico Soldà , Simon Meierhans , Aurelio Sulser , and Wuwei Yuan . Research is supported by Swiss National Science Foundation grants (project no. 200021 204787, starting grant no. TMSGI2 218022).

Jesper Lykke JacobsenView profile

Professor

• Statistical Physics
• Disordered Systems
• Conformal Field Theory
• +4 more

Jesper Lykke Jacobsen is a Professor of Theoretical Physics at the Laboratory of Theoretical Physics (LPTENS) within the Department of Physics at École Normale Supérieure (ENS) in Paris. He is also affiliated with Sorbonne University and holds membership in the prestigious Institut Universitaire de France, recognizing his significant contributions to theoretical physics. His educational background includes advanced studies in theoretical physics with focus on algebra, integrability, and exactly solvable models, as well as statistical field theory. His doctoral thesis addressed the Potts model with random couplings, while his habilitation thesis expanded on related topics in statistical physics. Jacobsen's research spans multiple areas of theoretical physics, with particular emphasis on statistical physics , disordered systems , conformal field theory , and exactly solvable models . His work often bridges mathematical rigor with physical insights, particularly in the study of critical phenomena, phase transitions, and geometrical models. His research has applications across condensed matter physics, polymer physics, and quantum systems. Analysis of his recent publications reveals strong trends in geometrical critical phenomena, with particular focus on percolation theory, Potts models, and graph polynomials. His work frequently employs conformal field theory techniques to understand critical behavior in two-dimensional systems, with notable contributions to understanding logarithmic correlations and exact solutions for lattice models. Member of Institut Universitaire de France (IUF) Professor Jacobsen has supervised numerous PhD students, including Romain, Etienne, and others visible in thesis defense photos from 2013 and 2019. His research group includes prominent physicists such as Hubert Saleur, Yacine Ikhlef, and Romain Couvreur. He has been actively involved in organizing research workshops at institutions like Les Houches and the Henri Poincaré Institute, fostering international collaboration in statistical physics and conformal field theory. His laboratory work focuses on theoretical investigations of critical phenomena using advanced mathematical techniques. The research environment at LPTENS supports his work on exactly solvable models and their applications to understanding complex physical systems.

• string algorithms
• data structures
• graph algorithms
• +5 more

Shay Golan is a Senior Lecturer in the Computer Science department at Ariel University, where he teaches core algorithms and data structures courses. Previously, he held postdoctoral positions at Reichman University, Haifa University (hosted by Shay Mozes and Oren Weimann), and was a Fulbright Postdoctoral Fellow at UC Berkeley's EECS department (hosted by Jelani Nelson). He earned his Ph.D. in Computer Science from Bar-Ilan University under the supervision of Ely Porat and Tsvi Kopelowitz. Dr. Golan's primary research focuses on string algorithms with emphasis on streaming, small space, and dynamic settings. His work spans multiple subfields including data structures, graph algorithms, and discrete algorithms. He has made significant contributions to pattern matching, edit distance problems, and string compression techniques, with applications extending to bioinformatics for DNA sequence analysis. His recent publication trajectory (2022-2026) reveals a strong focus on string algorithmic challenges across multiple dimensions: theoretical complexity analysis (LZ77 compression, string covers), specialized string problems (2D string matching, hairpin structures), graph algorithm applications (planar graph distance oracles), and bioinformatics implementations (DNA minimizers). His work consistently appears in top theoretical computer science venues including STOC, SODA, and CPM, demonstrating both theoretical depth and practical relevance. Fulbright Postdoctoral Fellow at UC Berkeley As an educator, Dr. Golan has consistently taught foundational computer science courses including Algorithms 1, Algorithms 2, Data Structures, and Computability since 2016. His research is supported through collaborations with leading institutions including Reichman University, Haifa University, and UC Berkeley. He maintains active research partnerships with prominent computer scientists including Itai Boneh, Ely Porat, and Tsvi Kopelowitz. Dr. Golan participates in the broader theoretical computer science community through conference presentations and workshop participation, with recorded talks available for several of his publications. His work bridges theoretical computer science with practical applications, particularly in computational biology and genomic sequence analysis.

V. ArvindView profile

Professor

• Computational Complexity Theory
• Structural Complexity
• Randomized Computation
• +5 more

V. Arvind is a Professor in the Theoretical Computer Science faculty at the Institute of Mathematical Sciences (IMSc) , Chennai. His research is centered on computational complexity theory, with a focus on structural complexity, randomized and algebraic computation, and quantum information and computation. He explores the deep connections between theoretical computer science and mathematics. Institution: Institute of Mathematical Sciences (IMSc), Chennai School: Theoretical Computer Science Academic Rank: Professor Arvind's research interests include computational complexity, structural complexity theory, algebraic computation, derandomization, and quantum computing. He is particularly interested in the interplay between mathematical structures and computation. His work often bridges theoretical computer science with algebra, combinatorics, and logic. His recent publications, primarily expository articles in the EATCS Bulletin’s Computational Complexity Column, cover a wide range of topics such as robust oracle machines, the Alon-Roichman theorem, noncommutative arithmetic circuits, graph isomorphism, and quantum computation. These works reflect trends in foundational complexity theory, algebraic methods in computation, and the exploration of quantum models. The articles emphasize structural insights, lower bounds, and connections to mathematical disciplines. Professional Service and Editorial Roles: Associate Editor, ACM Transactions on Computation Theory Editor, EATCS Computational Complexity Column (since June 2011) Editorial Board Member, International Journal of Computer Mathematics (2009–2013) Co-organizer, ICM Satellite Conference on Algebraic and Probabilistic Aspects of Combinatorics and Computing Program Committee Member for WALCOM 2014, STACS 2012, COCOON 2009, FSTTCS (multiple years, including chair roles), CCC 2006, INDOCRYPT (2002, 2005), and others Teaching: Arvind has taught advanced courses including Computational Complexity, Algorithms, Algebra and Computation, and Discrete Mathematics, often based on foundational texts and notes from leading experts. Lecture notes from his courses have been compiled by students and collaborators. Collaborations: He has an extensive list of co-authors, including prominent researchers such as Manindra Agrawal, Eric Allender, Johannes Köbler, Meena Mahajan, Jacobo Torán, and Ramprasad Saptharishi, indicating strong collaborative research networks in complexity theory and algorithms.

Nathan KleinView profile

Assistant Professor

• Approximation Algorithms
• Combinatorial Optimization
• Graph Algorithms
• +5 more

Nathan Klein is an Assistant Professor in the Department of Computer Science at Boston University, within the College of Arts and Sciences. He previously held a postdoctoral position at the Institute for Advanced Study in the School of Mathematics and completed his PhD at the University of Washington under the supervision of Anna Karlin and Shayan Oveis Gharan. His primary research lies in approximation algorithms, with a strong focus on graph problems such as the Traveling Salesperson Problem (TSP). He specializes in rounding techniques for linear programming relaxations, particularly randomized and iterative rounding methods. His work often targets improvements in approximation factors and integrality gaps for fundamental combinatorial optimization problems. The recent publications highlight a consistent theme: advancing the theoretical understanding of TSP and related graph optimization problems. Key contributions include improved approximation bounds using max entropy algorithms, dual analysis techniques, and new rounding frameworks. His research bridges theoretical computer science and discrete mathematics, with applications in network design and algorithmic foundations. Scientific Awards: No awards explicitly mentioned in the text. Nathan Klein advises graduate students and postdocs, including Zhuan Khye Koh. He has taught advanced courses such as CS 530: Advanced Algorithms, CS 237: Probability in Computing, and a specialized topics course on Rounding Techniques in Approximation Algorithms. His research is supported by his academic appointments and likely external grants, though specific grants are not listed. He maintains an active research program with a focus on open problems in TSP and LP rounding. He is involved in teaching and mentoring, with a structured curriculum emphasizing the 'Relax and Round' framework for approximation algorithms. His course materials reflect a deep engagement with both foundational and cutting-edge topics in algorithm design.

Alexander R. BlockView profile

Assistant Professor

• Cryptography
• Coding Theory
• SNARKs
• +7 more

Dr. Alexander R. Block is an Assistant Professor at the University of Illinois at Chicago (UIC) , specializing in Cryptography and Coding Theory . He focuses on the concrete security and space-efficiency of SNARKs, error-correcting codes , and locally decodable codes . Before UIC, he was a postdoctoral researcher at Georgetown University and University of Maryland , advised by Justin Thaler and Jonathan Katz. His PhD from Purdue University (2022) was supervised by Jeremiah Blocki. His research bridges theoretical and applied aspects, including field-agnostic SNARKs (CRYPTO 2024) with expand-accumulate codes, Fiat-Shamir security analysis of FRI protocols (ASIACRYPT 2023), and memory-hard puzzles in the standard model (SCN 2022). He has contributed to insertion-deletion error codes (CCC 2023) and secure computation with leaky correlations (TCC 2018, CRYPTO 2017). Dr. Block has received multiple scientific awards , including the Emil Stefanov Fellowship (2021) and Purdue Three Minute Thesis Competition Finalist (2022). His teaching includes courses like UIC's CS 505 - Computability and Complexity Theory (Spring 2025), where he emphasizes interactive proofs and zero-knowledge systems . He actively serves on program committees for CRYPTO , EUROCRYPT , and ZKProof Workshop , and has reviewed for leading journals and conferences.

Giona CasiraghiView profile

Researcher

• Network Science
• Complex Systems
• Data Science
• +4 more

Giona Casiraghi is a Senior Researcher at ETH Zurich specializing in network science and complex systems, with a primary focus on resilience modeling in social organizations and data-driven network analysis. His work bridges theoretical advances in statistical network models with practical applications in supply chain management, open-source software ecosystems, and online social dynamics. His research interests center on developing quantitative methods for analyzing complex systems, particularly through the generalized hypergeometric ensemble of random graphs (gHypEG). Casiraghi's work spans multiple disciplines including network science, statistical physics, data science, and resilience theory, with particular expertise in temporal network analysis, multi-edge networks, and zero-inflation models for sparse networks. His research group develops the ghypernet R package , providing open-source tools for network regression and inference. Analysis of his recent publications reveals a strong trend toward applying network science to real-world resilience problems, particularly in pharmaceutical supply chains and social organizations. His 2025 Science paper on US tariffs threatening medicine supply chains exemplifies this practical turn, while his methodological work on zero-inflated network models (PNAS Nexus 2025) demonstrates continued theoretical innovation. Casiraghi frequently collaborates with Frank Schweitzer and others in the Systems Group at ETH Zurich, producing interdisciplinary work that bridges computer science, economics, and social science. Casiraghi's research has significant implications for understanding how social organizations withstand shocks and how supply chains can be made more resilient to disruptions. His work on the gHypEG framework provides foundational tools for network scientists across multiple disciplines, while his applied research offers concrete insights for policymakers and industry practitioners dealing with complex system failures. He has contributed to numerous projects examining online migration after community bans, developer productivity in open-source projects, and reconstruction of social relations from interaction data. His research methodology typically combines large-scale data analysis with advanced statistical modeling, often developing new network analysis techniques to address specific research questions.

Jason CantarellaView profile

Professor

• Geometry
• Topology
• Geometric Knot Theory
• +3 more

Jason Cantarella is a Professor in the Mathematics Department at the University of Georgia. His research focuses on geometric knot theory, particularly the shapes of random curves and polygons. He teaches Differential Geometry of Curves and Surfaces (MATH 4250) every spring and specializes in the Multivariable Mathematics (MATH 3500-3510) course sequence. His research interests center on geometric properties of random polygons and knots, using differential, algebraic, and symplectic geometry of polygon spaces. Dr. Cantarella is particularly interested in questions like how likely it is that a random curve is knotted or what can be expected from a random diagram of a random space curve. His work bridges pure mathematics with applications in polymer physics and molecular biology. His recent publications show a strong focus on random polygons, topological polymers, geometric probability, and computational methods for analyzing knotting phenomena. There's a clear progression from theoretical foundations to algorithm development and practical applications, particularly in understanding the statistical properties of knotted structures in physical systems. Dr. Cantarella leads a research group that includes graduate students Tom Needham, Michael Berglund, and Harrison Chapman, as well as postdoctoral fellow Clayton Shonkwiler. He collaborates with faculty members Jason Parsley and Matt Mastin at UGA, and internationally with researchers including Tetsuo Deguchi at Ochanomizu University, the Uehara group at Kyoto University, and Clayton Shonkwiler of Colorado State University. He has developed several computational tools including Octrope (for polygonal tube radius calculation), plCurve (polygon library), Ridgerunner (knot tightening software), and Tsnnls (sparse non-negative least squares solver). These tools have enabled significant advances in the computational study of geometric knot theory and random polygon spaces.