جست‌وجوی استاد و پژوهشگر

Gilbert Bernsteinمشاهده پروفایل

استادیار

• Human-Centered Computing
• Interaction with the Physical World
• Software & Hardware Systems
• +۱۰ مورد دیگر

Gilbert Bernstein is an Assistant Professor at the University of Washington in the Computer Science & Engineering department within the Paul G. Allen School of Computer Science & Engineering . He specializes in Computer Graphics and Programming Languages , with a focus on high-performance domain-specific languages (DSLs). Postdoctoral scholar at UC Berkeley and MIT with Jonathan Ragan-Kelley PhD from Stanford University under Pat Hanrahan His research spans Human-Centered Computing , Interaction with the Physical World , and Software & Hardware Systems , including projects in: Compiler design for knitting machines using knot theory Differentiable rendering of neural signed distance fields Hardware DSLs for accelerator programming Geometric pattern completion for quilting Responsive web retargeting His recent publications demonstrate expertise in combining Mathematical Modeling with Language Design for applications in Graphics , Simulation , and Fabrication .

• Computer Engineering
• Computer Science
• Program Synthesis
• +۵ مورد دیگر

Xiaokang Qiu is an Associate Professor in the Elmore Family School of Electrical and Computer Engineering at Purdue University. His research focuses on program synthesis, formal verification, and hardware/software design with an emphasis on automated reasoning and system resilience. He holds a leadership role in advancing techniques for scalable verification of hardware systems and developing efficient program synthesis methods. His research interests include program synthesis, formal methods, hardware design, and algorithm optimization. He explores applications in concurrent systems, network protocols, and safety-critical systems, often integrating machine learning and automated reasoning approaches. Recent work trends show a focus on leveraging large language models for invariant generation, optimizing network and hardware systems through formal methods, and advancing recursive algorithm verification. His publications span topics from concurrent programming to runtime verification frameworks for autonomous systems. Xiaokang Qiu’s contributions include over 20 peer-reviewed articles since 2004, with recent highlights in 2025-2024 addressing cutting-edge challenges in program synthesis and hardware verification. He maintains an active research lab focusing on resilient autonomous systems and compiler optimizations. Office: BHEE 329 | Email: xkqiu@purdue.edu | Website: https://engineering.purdue.edu/~xqiu/

Wojciech Szpankowskiمشاهده پروفایل

استاد

• Bioinformatics and Computational Biology
• Theory of Computing
• Algorithms
• +۵ مورد دیگر

Wojciech Szpankowski is the Saul Rosen Distinguished Professor of Computer Science at Purdue University, with a courtesy appointment in Electrical and Computer Engineering. He holds a Ph.D. and M.S. in Electrical and Computer Engineering from Gdansk University of Technology (1980 and 1970, respectively). His career includes visiting roles at institutions such as McGill University, Stanford, and INRIA. He directs the NSF-funded Center for Science of Information, focusing on extending information theory to modern data challenges. Szpankowski is an IEEE Fellow, Erskine Fellow, and recipient of the Humboldt Research Award (2010). His research spans algorithms, information theory, bioinformatics, and analytic combinatorics. Key contributions include work on data compression, network analysis, and quantum computing. He authored *Average Case Analysis of Algorithms on Sequences* (2001) and co-launched the interdisciplinary Institute for Science of Information (2008). His recent work addresses fundamental limits in machine learning, quantum algorithms, and privacy-preserving systems. Research Interests: Bioinformatics, algorithm analysis, quantum computing, graph theory, and information-theoretic limits of learning. His work often bridges theory and applications, such as analyzing biological networks and developing efficient compression methods for dynamic data. Awards: IEEE Fellow Erskine Fellowship Humboldt Research Award (2010) Grants & Labs: Director of the NSF Science & Technology Center for Science of Information. Active in interdisciplinary projects, including temporal network analysis and quantum information theory.

Madhu Sudanمشاهده پروفایل

استاد

• Theories of Computation and Communication
• Coding Theory
• Property Testing
• +۵ مورد دیگر

Madhu Sudan is the Gordon McKay Professor of Computer Science at Harvard University's John A. Paulson School of Engineering and Applied Sciences (SEAS), where he also serves as Director of Graduate Studies. He holds a B.Tech. from IIT Delhi (1987) and a Ph.D. from UC Berkeley (1992). Prior to Harvard, he was at MIT (1997–2015), IBM Research (1992–1997), and Microsoft Research (2009–2015). His research focuses on the theories of computation and communication, with notable contributions to probabilistically checkable proofs (PCP theorem), list-decoding algorithms for error-correcting codes, and sublinear-time algorithms. Education: B.Tech., Indian Institute of Technology Delhi, 1987 Ph.D., University of California, Berkeley, 1992 Research Interests: Communication and computing under errors Coding theory and its applications Property testing and sublinear algorithms Algebraic methods in computation Awards and Honors: Nevanlinna Prize (2002) IEEE Hamming Medal (2016) Member, National Academy of Sciences (2017) Infosys Prize in Mathematical Sciences (2018) Fellow of ACM, IEEE, and AMS Teaching and Service: Current courses: Algebra and Computation , Coding Theory Directed Graduate Studies in Computer Science at Harvard Editorial roles: Foundations and Trends in Theoretical Computer Science , Theory of Computing Research Groups: Member of Harvard's Theory of Computation group, collaborating on projects in coding theory, complexity theory, and distributed computing.

Stefan Steinerbergerمشاهده پروفایل

استاد

• Analysis
• Applied Mathematics
• Combinatorics
• +۵ مورد دیگر

Stefan Steinerberger is a Professor in the Department of Mathematics at the University of Washington, Seattle. He holds a PhD from the University of Bonn (2013) and specializes in Analysis, with research interests spanning Partial Differential Equations, Spectral Theory, Harmonic Analysis, and applications to Data Science and Mathematical Physics. His work often bridges theoretical and applied mathematics, addressing problems in geometry, combinatorics, and numerical methods. Education: PhD in Mathematics, University of Bonn, 2013 Research Interests: Steinerberger’s research focuses on Analysis, with emphasis on PDEs, Spectral Theory, and Harmonic Analysis. He explores interdisciplinary connections, such as applying analytic techniques to graph theory, optimization, and data science. Specific themes include eigenvalue estimates, dynamical systems, and the interplay between geometry and combinatorial structures. Awards & Recognition: While specific awards are not listed, his extensive publication record and affiliations with prestigious journals indicate significant contributions to the field. His work frequently appears in top-tier journals like Advances in Mathematics , Journal of Functional Analysis , and SIAM Journal on Discrete Mathematics . Teaching & Outreach: He teaches courses in the Department of Mathematics and is involved in outreach initiatives such as the Washington Experimental Mathematics Lab (WXML) and the UW Math Circle. His courses and research often emphasize problem-solving and real-world applications. Labs/Teams: Active in collaborations across mathematical disciplines, including work with researchers in combinatorics, probability, and numerical analysis. He maintains a personal website with resources on his research, teaching, and open problems.

William Yun Chenمشاهده پروفایل

استادیار

• Algebra
• Algebraic Geometry
• Number Theory
• +۶ مورد دیگر

William Yun Chen is an Assistant Professor in the Department of Mathematics at the University of Illinois at Urbana-Champaign (UIUC). He holds additional campus affiliations within the College of Liberal Arts & Sciences. Prior to UIUC, he was an NSF Postdoctoral Fellow at Columbia University and McGill University, and a Member at the Institute for Advanced Study (IAS). He earned his PhD in 2016 from Penn State under Winnie Li's supervision, specializing in arithmetic geometry. His research focuses on the interplay between group theory, algebraic geometry, and number theory, particularly through monodromy actions of étale fundamental groups. His work includes moduli interpretations of noncongruence modular curves, integrality properties of noncongruence modular forms, and studies of tamely ramified covers of the projective line. Recent contributions address Nielsen equivalence classes of finite groups and Bourgain-Gamburd-Sarnak conjectures on Markoff triples. He also explores arithmetic monodromy actions and exceptional sequences in braid groups. Chen’s publications appear in prestigious journals like Annals of Mathematics, Algebra and Number Theory, and Mathematische Annalen. He actively supervises research seminars, including a 2024 reading seminar on Katz-Mazur’s Arithmetic moduli of elliptic curves . His teaching spans courses like Applied Linear Algebra, Number Theory, and Calculus at UIUC, Rutgers, Columbia, and Penn State. Chen maintains a code repository for computing moduli stacks of elliptic curves with nonabelian level structures, generating data on finite groups and their geometric properties. His photography, showcased on his personal site, complements his academic pursuits.

LianTao Wangمشاهده پروفایل

استاد

• Theoretical Particle Physics
• Higgs Physics
• Dark Matter
• +۱ مورد دیگر

LianTao Wang is Professor in the Department of Physics, Enrico Fermi Institute, and Kavli Institute for Cosmological Physics at the University of Chicago. His theoretical research focuses on particle physics phenomenology beyond the Standard Model. Professor Wang investigates fundamental puzzles including electroweak symmetry breaking, dark matter identity, and cosmological asymmetries. His work connects theoretical frameworks with experimental searches at facilities like the Large Hadron Collider. Current studies examine Higgs boson properties, axion dark matter detection strategies, and primordial gravitational wave signatures from the early universe.

• Quantum Computing
• Topological Quantum Computation
• Tensor Networks
• +۳ مورد دیگر

Andreas Bauer is a Research Fellow at the Department of Mechanical Engineering , Massachusetts Institute of Technology , focusing on quantum computing and topological phases of matter. His work bridges theoretical physics and computational methods, with an emphasis on fault-tolerant systems and tensor networks. Research Focus: Topological quantum computation, quantum error correction, tensor networks, and condensed matter physics. Email: andib@mit.edu

Alexander Bargمشاهده پروفایل

استاد

• Coding Theory
• Cryptography
• Combinatorics
• +۵ مورد دیگر

Dr. Alexander Barg is a Professor of Electrical and Computer Engineering (ECE) at the University of Maryland, College Park, with affiliate appointments in Computer Science, Mathematics, and the Institute for Systems Research. He holds a Ph.D. from the Russian Academy of Sciences (1987). His research focuses on coding theory, quantum codes, information theory, and distributed storage systems. He has advised numerous graduate students and postdocs, contributing to advancements in error-correcting codes and quantum computing. His work spans theoretical foundations and applications, including smoothing of codes, quantum code design, and recoverable storage systems. He has authored over 200 publications and serves on editorial boards of leading journals like IEEE Transactions on Information Theory and Foundations and Trends® in Communications and Information Theory . He teaches graduate and undergraduate courses on information theory, coding, and probability. Research highlights include contributions to classical and quantum coding bounds, LDPC codes, and polar codes. His grants and awards reflect sustained NSF support for projects on discrepancy theory, energy optimization, and distributed storage.

Jiahui Chenمشاهده پروفایل

استادیار

• Topological Data Analysis
• Machine Learning
• Computational Biophysics
• +۴ مورد دیگر

Jiahui Chen is an Assistant Professor in the Department of Mathematical Sciences at the University of Arkansas, Fayetteville. He holds a PhD in Computational and Applied Mathematics from Southern Methodist University (2019). Prior to his current position, he was a Visiting Assistant Professor at Michigan State University under Prof. Guo-Wei Wei's group. His research focuses on topological and geometrical data analysis, machine learning algorithms, and their applications in biomolecular modeling. Key areas include protein-protein interaction analysis, mutation impact prediction, and fast numerical methods like the Poisson-Boltzmann equation, Treecode, and Fast Multipole Method. He has contributed to studies on SARS-CoV-2 variants, vaccine-breakthrough mutations, and antibody resistance using topological methods and deep learning. His work combines numerical algorithms with parallel computing, emphasizing GPU acceleration and algorithm optimization. Chen has collaborated on projects involving persistent homology, Hodge Laplacians, and algebraic topology for biomolecular analysis. He maintains an active GitHub profile with repositories like persistent_homology_visualizer and TABI_solver , showcasing his computational tools.

• Commutative Algebra
• Algebraic Number Theory

Jared Kettinger is a Lecturer in the Department of Mathematical and Statistical Sciences within the College of Science at Clemson University, serving as Graduate Teacher of Record and Graduate Student Seminar Coordinator. He teaches undergraduate courses including Business Calculus and Calculus of One Variable sequences. His educational background includes: B.S. in Mathematics from Grove City College (2021) B.A. in Economics from Grove City College (2021) M.S. in Mathematical Sciences from Clemson University (2024) His research centers on Commutative Algebra—studying ring structures, ideals, and modules fundamental to algebraic geometry—and Algebraic Number Theory, which explores number fields with applications in cryptography and coding theory. These fields represent core algebraic disciplines requiring advanced abstract reasoning. No scientific awards were documented in the available information. Mr. Kettinger has not advised any graduate students per the provided records, and no research grants are referenced. His current responsibilities appear focused on teaching coordination and course instruction within the department's undergraduate programs. There are no mentions of laboratory affiliations, research teams, or collaborative projects in the source material.

• Coding Theory
• Post-Quantum Cryptography
• Quantum Error Correction
• +۲ مورد دیگر

Felice Manganiello is an Associate Professor and Associate Director for Mathematics and Statistics Education in Clemson University's College of Science, Department of Mathematical and Statistical Sciences. His research specializes in coding theory with applications to quantum computing, cryptography, and secure communications. His work bridges theoretical mathematics and practical implementations in information security and distributed systems. Research interests include the development of quantum-resistant cryptographic systems, error-correcting codes for quantum computing, and secure multiparty computation protocols. Recent publications focus on constructing specialized codes for quantum fault tolerance, developing zero-knowledge proof systems, creating efficient batch coding schemes for distributed storage, and designing secure computation methods for matrix operations. His work demonstrates consistent innovation in applying algebraic structures to solve contemporary challenges in information security and network communications.

Beth A Novickمشاهده پروفایل

مدرس

• Combinatorial Optimization
• Discrete Mathematics
• Graph Theory
• +۷ مورد دیگر

Beth A Novick is a Principal Lecturer in the Department of Mathematical and Statistical Sciences at Clemson University, part of the College of Science. She holds a Ph.D. in Operations Research from Carnegie Mellon University (1990) and completed a postdoctoral fellowship at the University of Waterloo's Department of Combinatorics and Optimization (1990–91). Her primary research focuses on combinatorial optimization, discrete mathematics, graph theory, and related areas including median graphs, metric dimension, and reconfiguration graphs. She has been affiliated with Clemson University since 1992. Her research interests encompass integer programming, algebraic graph theory, matroids, and closure systems. Notable contributions include studies on reconfiguration graphs of shortest paths and geometric interpretations of threshold dimensions. She is a member of the American Mathematical Society and Women in Combinatorics. Teaching responsibilities include courses such as Linear Algebra and Graph Theory. No scientific awards or grants are explicitly listed in the provided information. Her work spans theoretical advancements in discrete mathematics and applications in graph-based optimization problems.

• Arithmetic Groups
• Geometric Group Theory
• p-adic Lie Groups
• +۲ مورد دیگر

Benjamin Klopsch is Professor of Mathematics and Head of the Algebra and Number Theory group at Heinrich-Heine-Universität Düsseldorf. His research explores asymptotic and geometric group theory with applications to number theory. Research Areas: Algebraic properties of arithmetic groups, zeta functions of algebraic structures, combinatorial problems in coding theory, and representation growth of p-adic Lie groups. Leadership: Organizes the Advanced Seminar on Group Theory and co-directs the DFG-GRK 2240 graduate school. Serves as editor for Archiv der Mathematik and Journal of Group Theory. Teaching: Offers courses on representations of finite groups, local fields, and geometric group theory for undergraduate and graduate students.

• Applied Topology
• Sheaf Theory
• Category Theory
• +۵ مورد دیگر

Justin M. Curry is a tenured Associate Professor in the Department of Mathematics and Statistics at the University at Albany SUNY. His research focuses on developing theoretical foundations for Topological Data Analysis (TDA) using sheaf theory and category theory. He completed his PhD at the University of Pennsylvania under Robert Ghrist and held a postdoc at Duke University. Recent activities include sabbaticals at the University of Oxford, VU Amsterdam, and the Max Planck Institute for Mathematics in the Sciences (MPI MiS). Education: PhD in Mathematics from University of Pennsylvania (2014) Visiting Associate at the Institute for Advanced Study (2009-2011) Research interests span applied topology with emphasis on algebraic and geometric models for space communications, topological deep learning, and inverse problems in TDA. Notable collaborations include NASA's TIMAEUS project (2020-2025) and contributions to the IEEE Aerospace Conference. His work bridges pure mathematics and engineering applications, particularly in distributed space networks and topological signal processing. Recent publications (2021–2024) explore decorated Reeb spaces, universal ℓ^p-metrics on merge trees, and topological attributed graphs for shape discrimination. He has delivered invited lectures at venues like the International Conference on Machine Learning (ICML) and the Max Planck Institute. Awards: NSF CRII Award (2020), NSF Grant for Enriched Topological Summaries (2019) Advising 5 PhD students and leading the NASA-funded TIMAEUS initiative ($650k), his lab integrates categorical methods with geometric deep learning frameworks. Current work includes algebraic models for space communication protocols and sheaf-theoretic approaches to shape space construction. Labs/Teams: Active member of the ATiA (Applied Topology and Inverse Problems) research group and collaborator with NASA's DTN (Disruption Tolerant Networking) working group.