Vibhav Gogate is a Professor and Associate Head of Research at University of Texas at Dallas, specializing in machine learning and artificial intelligence. His research focuses on probabilistic graphical models, statistical relational learning, and integrating deep learning with graphical models. Professor Gogate has received numerous awards including the NSF CAREER Award (2017), Outstanding Researcher Award (2022, 2017), and Best Paper awards at top AI conferences. His research funding includes projects from NSF and DARPA. Education: PhD, University of California, Irvine MS, University of Maine BS, University of Mumbai Recent Publications: His research spans probabilistic inference, tractable models, and neural network approaches for efficient reasoning, with publications in NeurIPS, AAAI, UAI, and AISTATS. Recent work focuses on scalable inference methods and explainable AI systems for complex domains. Research Funding: Secured over $8M in grants from DARPA and NSF for projects in explainable AI and probabilistic reasoning. Teaching: Regularly teaches graduate and undergraduate courses in Machine Learning, Artificial Intelligence, and Advanced Statistical Methods.
Dr. Dmytro Matsypura is an Associate Professor in the Discipline of Business Analytics at the University of Sydney Business School. He holds a BA (Hons) from Kyiv Polytechnic Institute (KPI), an MS (Hons) from KPI, and a PhD from the University of Massachusetts Amherst. His research focuses on optimization methodologies, network science, and their applications in finance, transportation, ecology, and graph theory. He is a recipient of multiple teaching awards, including the Wayne Lonergan Outstanding Teaching Award (Early Career) in 2010. Education: PhD in Management Science, University of Massachusetts Amherst (2006) MS (Hons) in Information Systems, Kyiv Polytechnic Institute (2000) BA (Hons) in Business Administration, Kyiv Polytechnic Institute (1998) Research Interests: Dr. Matsypura’s work spans operations research and management science, with a focus on mathematical optimization and network science. His methodological contributions include developing efficient optimization algorithms, while his applied research addresses real-world challenges in finance, engineering, and ecology. Notable applications include wildfire fuel management, portfolio margining, and credit card fraud detection via graph-based models. Awards and Recognition: Teaching Excellence Award (2008, 2013, 2018) Wayne Lonergan Outstanding Teaching Award (Early Career) (2010) Grants and Projects: Current projects include Bushfire Analytics: Optimization of Fuel Reduction (2023, ARC Discovery Project). His research frequently integrates interdisciplinary collaborations, such as applying graph theory to biomedical problems and cybersecurity. Labs/Teams: Active in the Sydney Environment Institute, contributing to projects at the intersection of analytics and sustainability. Collaborates with industry on fraud detection and supply chain optimization.
Prof. Igors Gorbovickis is an Associate Professor of Mathematics at the Department of Mathematics, School of Computer Science and Engineering, Constructor University (formerly Jacobs University Bremen). His research focuses on complex dynamical systems, including topics such as renormalization theory, bifurcation analysis, Julia sets, and applications to mathematical physics. He also contributes to discrete geometry, particularly exploring conjectures like the Kneser-Poulsen problem. His work bridges pure mathematics with interdisciplinary applications, emphasizing rigorous analysis of nonlinear systems and geometric configurations. Key areas of investigation include critical point accumulations, Hausdorff dimension estimates, and equidistribution phenomena in parameter spaces. Recent publications highlight advancements in understanding chaotic systems, circle maps, and the interplay between algebraic structures and dynamical behavior. Prof. Gorbovickis collaborates internationally, with co-authored papers appearing in journals like Advances in Mathematics , Ergodic Theory and Dynamical Systems , and Nonlinearity . His office is located at Research I, Room 128 on the Constructor University campus in Bremen, Germany.
Laura Anderson is an Associate Professor in the Department of Mathematics at Binghamton University. She holds a Ph.D. from MIT (1994) and has been affiliated with Binghamton since 2001. Her research focuses on Combinatorics and Topology, with a specialization in matroid theory, hyperplane transversals, and topological combinatorics. She teaches advanced courses such as Introduction to Combinatorics (Math 511) and Discrete Mathematics (Math 314). Her academic contributions include groundbreaking work on oriented matroids, combinatorial Grassmannians, and hyperfield applications. Anderson has advised multiple Ph.D. students, including Olakunle Abawonse, Ulysses Alvarez, and Leandro Junes, whose theses explore topics like matroid extensions and tropical phased matroids. She actively participates in academic conferences, co-organizing the Binghamton University Graduate Conference in Algebra and Topology (BUGCAT). Anderson’s research integrates algebraic topology with discrete mathematics, addressing geometric realizations, hyperfield structures, and topological invariants. Her pedagogical innovations include experimenting with flipped classroom methods in calculus education. She maintains an active presence in academic service, contributing to journal reviews and editorial work in combinatorial geometry.
David Perkinson is a Professor of Mathematics at Reed College, where he holds a position in the Department of Mathematics. His research focuses on combinatorics, algebraic geometry, and discrete mathematics, with a particular emphasis on sandpile models, graph theory, and matroid theory. He is the author of the textbook *Divisors and Sandpiles: An Introduction to Chip-Firing*, which explores the combinatorial theory of chip-firing on graphs. Perkinson has also developed software tools like the Sandpile Java App, which visualizes and analyzes the Abelian Sandpile Model. He organizes the Cascade Lectures in Combinatorics (CALICO), a series of conferences funded by the National Science Foundation, aimed at fostering collaboration among researchers in combinatorics. His work bridges discrete mathematics with algebraic geometry, emphasizing connections between graph theory and geometric structures. Perkinson teaches advanced courses in analysis and contributes to the academic community through his research on topics such as divisor theory on graphs, sandpile groups, and combinatorial game theory. His recent publications (2015–2024) address matroid theory, sandpile dynamics, and applications of algebraic methods to discrete systems.
Vera Fischer is an Associate Professor and Privatdozent in the Department of Mathematics at the Faculty of Mathematics, University of Vienna. She has been an active researcher since 2008, with a strong publication record in mathematical logic and set theory. Her research centers on set-theoretic combinatorics , focusing on cardinal characteristics of the continuum, forcing, definability, and structures such as maximal almost disjoint families, cofinitary groups, and independent families. She investigates foundational questions in independence, spectra of combinatorial objects, and the interplay between definability and generic extensions. Her work often involves constructing models to separate cardinal invariants or to realize specific spectra under forcing. The recent publications show a consistent trend in combinatorial set theory , with a focus on tower spectra, tight families, mad families, and their behavior under various forcing notions like Cohen and Sacks forcing. Her research frequently explores the definability and destructibility of combinatorial families, often in collaboration with leading researchers such as Corey B. Switzer, Stefan Geschke, and Saharon Shelah. FWF START Prize, 2017 Förderungspreis der ÖMG, 2018 Förderungspreis, 2018 She leads and participates in research projects such as Comparing the Real Line to Combinatorics of the Uncountable and A Sacks-like model with large continuum , indicating active grant funding and supervision of research activities. She also organizes academic events like Colloquium Logicum and engages in public outreach on topics like infinity. Her research is conducted within the Set Theory Group at the University of Vienna, where she collaborates with other logicians and contributes to the academic community through publications, conferences, and mentorship.
John MacLaren Walsh is a Professor in the Department of Electrical and Computer Engineering at Drexel University, where he leads the Adaptive Signal Processing and Information Theory Research Group. He holds BS, MS, and PhD degrees from Cornell University, all completed under Dr. C. Richard Johnson, Jr. His research spans information theory, network coding, distributed computing, and machine learning applications in patent analysis. His work focuses on: Bounding entropic vectors and their impact on communication networks Rate region computation for network coding and distributed storage Information theory for distributed function computation Machine learning-enhanced patent processing systems Publications emphasize entropy geometry, network coding complexity, distributed algorithms, and patent analysis, with consistent themes of optimization and combinatorial methods. Recent work (2016-2019) shows increased focus on probabilistic supports and computational efficiency in network coding. Awards: 2011 NSF CAREER Award for 'Entropy Geometry in Variational Inference Signal Processing' He has advised PhD students on topics like entropy region mapping, network coding, and distributed control. Key grants include NSF CAREER and AFOSR funding for wireless network overhead control. He directs the Adaptive Signal Processing and Information Theory Research Group, which develops algorithms for network coding, distributed storage, and patent analysis systems.
Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.
Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.
Prof. Dr. Ieke Moerdijk is a distinguished Professor of Mathematics at the Mathematical Institute of Utrecht University, part of the Faculty of Science. Previously, he held positions at Radboud University (2011–2016) and has been affiliated with institutions like the University of Chicago, Cambridge, and the University of Amsterdam, where he earned his PhD in Mathematics (1985, Cum Laude). His research focuses on algebraic and differential topology, homotopy theory, and applications of topological structures to mathematical logic. He is renowned for co-authoring influential books such as Sheaves in Geometry and Logic (with S. Mac Lane) and Introduction to Foliations and Lie Groupoids (with J. Mrcun). Moerdijk has received prestigious awards including the Spinoza Prize (2012) and the Descartes-Huygens Prize (2011), and is a member of the KNAW and Academia Europaea. His current research emphasizes the theory of dendroidal sets and homotopy operads. He has held visiting positions at institutions like Cambridge, McGill, and Sydney. His academic contributions span editorships, teaching, and supervising numerous students. Moerdijk’s work bridges foundational mathematics with advanced categorical and topological frameworks, influencing areas from algebraic geometry to logic. Education: Bachelor’s/Master’s in Mathematics, Philosophy, and Linguistics at University of Amsterdam PhD in Mathematics, University of Amsterdam (1985) Awards: Spinoza Prize (2012), Descartes-Huygens Prize (2011) Member of KNAW (2006), Academia Europaea (2014) Huygens Fellowship (1986), PIONIER Grant (1995) Research Interests: Algebraic topology, homotopy theory, operads, category theory, and mathematical logic. Moerdijk’s publications include foundational works on dendroidal sets and simplicial methods, with recent contributions addressing ∞-operads and univalent completion. His research often explores connections between algebraic structures and topological spaces, with applications to higher category theory.
Daniel Grier is an Assistant Professor jointly appointed in the Computer Science and Engineering and Mathematics departments at the University of California, San Diego (UCSD). His research focuses on quantum complexity theory , particularly exploring near-term quantum computing paradigms and proving quantum advantage over classical systems. He holds a Ph.D. from MIT and was previously a postdoctoral fellow at the University of Waterloo’s Institute for Quantum Computing. Education: Ph.D. in Computer Science, MIT B.S. in Computer Science and Mathematics, University of South Carolina Research Interests: Grier’s work bridges theoretical computer science and quantum computing, emphasizing algorithm design, complexity class separations, and foundational questions about quantum supremacy. He studies how low-depth quantum circuits, boson sampling, and other near-term technologies can achieve computational tasks classically deemed intractable. Recent Article Trends: His publications explore efficient quantum state learning (e.g., classical shadows), hardness results for quantum sampling problems (e.g., bipartite Gaussian boson sampling), and circuit lower bounds (e.g., depth-2 QAC circuits). These contributions highlight his focus on rigorously defining quantum computational advantages. Awards: None explicitly listed in the text. Advising & Grants: Advises at least one student, Jackson Morris. His research is supported by grants exploring quantum complexity and algorithm design. Teaches advanced courses on quantum complexity theory, computability, discrete mathematics, and quantum computing fundamentals. Labs/Teams: Maintains an active lab focused on quantum complexity theory, collaborating with colleagues on topics like interactive protocols and shallow quantum circuits.
Manish Verma is Professor of Operations Management and Associate Dean, Graduate Studies at the DeGroote School of Business, McMaster University. His academic journey began with an MBA and PhD in Business Administration with Operations Management/Management Science specialization from Desautels Faculty of Management at McGill University. Dr. Verma's research focuses on multimodal transportation of dangerous goods, risk assessment, network design and planning in transportation, humanitarian logistics, green supply chain management, and disruption/resilience in transportation systems. His current research engagements center on safety and security issues in freight transportation and humanitarian logistics, funded by NSERC and SSHRC grants. He has been frequently approached by media to comment on railroad accidents involving dangerous goods. An analysis of his recent publications reveals a strong emphasis on hazardous materials transportation risk management, with significant contributions to rail-truck intermodal systems, hazmat risk modeling using value-at-risk methodologies, and emergency response planning for transportation networks. His work bridges theoretical operations research with practical transportation safety applications. $245K research grant for rail safety research from Government of Canada As an educator, Dr. Verma has taught courses including Predictive Analytics for Managers, Network Design Issues in Freight Transportation, and Management Science Research Issues. His scholarly impact is evidenced by publications in leading journals such as Transportation Research Part E, European Journal of Operational Research, and Safety Science. He actively contributes to real-world transportation safety through media commentary and research that informs policy decisions regarding dangerous goods transportation.
Ivan Dokmanic is an Assistant Professor at the Coordinated Science Laboratory (CSL) within the University of Illinois . His research bridges signal processing , machine learning , and applied inverse problems , with a focus on acoustics, biomedical imaging, and distance geometry. Current Role : Assistant Professor, CSL Email : dokmanic@illinois.edu Research Interests : Dokmanic explores machine learning applications in inverse problems , particularly distance geometry for molecular imaging and acoustics . His work includes unlabeled sensing , where distances between points are known but their arrangement is not. This has implications for powder diffraction , indoor localization , and echo modeling . Article Trends : His recent publications emphasize distance geometry in machine learning , acoustic signal processing , and inverse problem theory . Key areas include molecular imaging , audio encryption , and sensor positioning . Collaborative work spans medical imaging , cyberphysical systems , and geometric invariants . 2016 Google Faculty Award NSF Grant (1 year, $157,079) Students and Grants : Dokmanic mentors PhD students like Puoya, Shuai, and Anadi. His research is funded by the National Science Foundation , Google , VISA , and nVidia .
Hannah Hoganson is an NSF Postdoctoral Fellow in the Department of Mathematics at the University of Maryland, mentored by Christian Rosendal after previously holding a Brin Postdoctoral Fellowship under Lei Chen. Her research bridges geometric group theory, low-dimensional topology, and descriptive set theory, with a focus on mapping class groups of infinite-type surfaces and topological groups. Her educational background includes a PhD from the University of Utah (2022) advised by Ken Bromberg, and prior graduate studies at Miami University where she investigated Thompson's groups. She has taught multiple calculus courses at UMD and the University of Utah, receiving exceptional student evaluations for her clarity and supportive teaching style. Hoganson's research explores the coarse geometry of mapping class groups, connections between topological groups and descriptive set theory, and geometric structures on infinite-type surfaces. Her work often combines algebraic, geometric, and topological methods to address fundamental questions about group actions and classification problems in low-dimensional topology. Her recent publications demonstrate a strong trend toward interdisciplinary approaches, integrating geometric group theory with descriptive set theory to analyze infinite-type mapping class groups and Polish groups. Key themes include geometric finiteness, coarse boundedness, and the interplay between algebraic structures and topological dynamics in infinite settings. NSF Postdoctoral Fellowship (DMS-2303365) Brin Postdoctoral Fellowship Hoganson has advised an undergraduate reading course in geometric group theory (Spring 2024) and served as a mentor for REU students at SUMSRI. Her current research is supported by NSF grant DMS-2303365, which funds her postdoctoral work on geometric and topological aspects of infinite-type surfaces and groups. She actively collaborates with researchers including George Domat, Sanghoon Kwak, and Robbie Lyman across multiple projects. She co-organizes the University of Maryland Geometry and Topology Seminar and has co-led specialized workshops including the Big Mapping Class Groups log cabin workshop in Young, AZ (2024) and the AWM special session on Women in Groups, Geometry and Dynamics (2023), fostering collaborative research environments in geometric topology.
Quanquan Liu is an Assistant Professor of Computer Science at Yale University. His research focuses on algorithms for large data, dynamic and distributed graph algorithms, parallel computing, differential privacy, and Byzantine-resilient systems. He holds a PhD in Computer Science from MIT's Theory Group and has held postdoctoral positions at Northwestern University and MIT. Education: PhD in Computer Science, MIT (Advisors: Erik Demaine and Julian Shun) MEng in Computer Science, MIT B.S. in Computer Science and Math, MIT (Advisor: David Karger) Research Interests: Theory and practice of algorithms for large-scale data, dynamic/distributed graph algorithms, parallel and high-performance computing, differential privacy, and Byzantine-resilient algorithms. Recent Highlights: His work includes practical differentially private graph algorithms, efficient parallel algorithms for graph problems, and fair course allocation mechanisms. Notably, he received the Best Paper Award at SPAA 2022 for parallel dynamic graph algorithms. Service: PC member for PPoPP, ESA, SPAA, and ALENEX Coach for USA Computing Olympiad (USACO) and Northwestern's ICPC team Current Group: Advising PhD students Felix Zhou and Pranay Mundra, and Master's student Jinghua Sun.
