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

Julianna Tymoczkoمشاهده پروفایل

دانشیار

• Algebraic Geometry
• Algebraic Combinatorics
• Representation Theory
• +۴ مورد دیگر

Julianna Tymoczko is the Louise Wolff Kahn 1931 Professor of Mathematical Sciences and Codirector of the Postbaccalaureate Program at Smith College, where she serves as an Associate Professor of Mathematics in the Department of Mathematics within the School of Mathematics & Statistics. Her office is located in Burton Hall 314, and she maintains regular office hours Monday through Thursday. Ph.D. and M.A. from Princeton University A.B. from Harvard University Professor Tymoczko's research sits at the rich intersection of algebraic geometry and algebraic combinatorics, with particular focus on geometric representations of the symmetric group, modern Schubert calculus, and equivariant cohomology using combinatorial methods. Her work often centers on Hessenberg varieties, a family of subvarieties of the flag variety that includes Springer varieties as special cases. She approaches complex geometric questions through algebraic and combinatorial techniques, studying objects like circles, spheres, and more complicated varieties described as zero sets of polynomial equations. Her extensive publication record shows consistent work on Poincare polynomials for Nilpotent Hessenberg Varieties across various dimensions (GL(2) through GL(9)), demonstrating deep exploration of the topological and combinatorial properties of these spaces. The progression of her work reveals increasing complexity from lower-dimensional cases to higher-dimensional generalizations. Alfred P. Sloan fellow Recipient of National Science Foundation grant support Professor Tymoczko actively contributes to the mathematical community through teaching, research, and service. She currently teaches advanced mathematics courses including Math 300 (Dialogues in Math) and Math 301 (Topics in Math), co-organizes the Algebra/Combinatorics/Geometry seminar at Smith College, and participates regularly in the Valley Geometry Seminar and Representation Theory seminar. Her research is supported by NSF funding, and she frequently presents her work at major conferences including AMS Special Sessions and international venues like McMaster University. Her research program involves detailed study of the connections between geometric structures, combinatorial patterns, and algebraic representations, with particular attention to how these fields inform one another in the study of Hessenberg varieties and related structures.

Karen Gundersonمشاهده پروفایل

دانشیار

• Graph theory
• Combinatorics
• Random graphs
• +۱۰ مورد دیگر

Karen Gunderson is an Associate Professor in the Department of Mathematics at the University of Manitoba's Faculty of Science. Her research spans graph theory, combinatorics, random graphs, percolation, hypergraphs, and extremal combinatorics. Research Focus : Graph theory, combinatorics, random graphs, percolation, hypergraphs, extremal combinatorics Academic Role : Associate Professor, Acting Associate Head Graduate Contact : Karen.Gunderson@umanitoba.ca , karen.gunderson@umanitoba.ca Her work includes bootstrap percolation , random geometric graphs , and extremal hypergraph problems , with applications in network modeling and probabilistic combinatorics. Recent publications focus on adversarial burning densities, Erdos-Ko-Rado robustness, and Turán numbers in switching contexts. Academic Leadership : Co-organizer of the University of Manitoba Combinatorics Seminar and key organizer for the 2023 CanaDAM conference and Movement & Symmetry in Graphs retreat.

• Mathematical Optimization
• Stochastic Processes
• Control Theory
• +۳ مورد دیگر

Rodolfo Antonio Rios Zertuche is a Research Fellow in the Department of Mathematics and Statistics at UiT The Arctic University of Norway, actively contributing to the research groups Applied and Computational Algebra and MASCOT. His work bridges theoretical mathematics with computational applications across optimization and stochastic systems. His research focuses on Mathematical Optimization, Stochastic Processes, and Dynamical Systems, with significant contributions to variational problem relaxations, sums-of-squares hierarchies, and subgradient method dynamics. Recent investigations examine convexity in measure-theoretic frameworks and convergence properties in polynomial optimization. Publications from 2022-2024 reveal a concentrated trend toward optimization theory, particularly in occupation measure relaxations, correlative sparsity convergence rates, and stochastic approximation techniques. These works demonstrate increasing sophistication in handling nonsmooth functions and probabilistic frameworks through measure-theoretic approaches. Rios Zertuche maintains strong international collaborations with researchers from institutions including LAAS-CNRS (Toulouse) and Czech Technical University, evidenced by co-authorships with Didier Henrion and Milan Korda. His involvement in the MASCOT research group supports interdisciplinary projects connecting algebraic methods with computational mathematics.

Nikos Komodakisمشاهده پروفایل

استاد

• Deep Learning
• Computer Vision
• Machine Learning
• +۴ مورد دیگر

Nikos Komodakis is a Professor in the Computer Science Department at the University of Crete, Greece, where he develops efficient, scalable and mathematically well-grounded algorithms for analyzing visual data including static natural images, video, and medical image data. His research spans deep learning, computer vision, machine learning, and artificial intelligence with significant contributions to self-supervised learning, few-shot learning, and knowledge distillation techniques. His work demonstrates a strong theoretical foundation combined with practical applications, particularly in medical imaging. Komodakis has published extensively in top-tier computer vision venues including CVPR, ICCV, ECCV, and IEEE Transactions on Image Processing. His recent publications (2022-2025) show a growing emphasis on medical image analysis applications while maintaining strong contributions to fundamental computer vision problems. Notable contributions include novel approaches for unsupervised representation learning that surpass state-of-the-art methods, effective techniques for knowledge distillation (such as the QUEST framework), and innovative frameworks for few-shot visual learning. Komodakis serves on the editorial boards of prestigious journals including the International Journal of Computer Vision, Computer Vision and Image Understanding Journal, and Computational Intelligence Journal. He has been a frequent area chair for major computer vision conferences including CVPR, ICCV, ECCV, and BMVC. Spyros Gidaris received the Ponts Foundation Best Thesis Prize and the University Paris-Est Best Thesis prize under Komodakis' supervision Sergey Zagoruyko received the AFRIF 2018 Thesis Prize for his PhD work supervised by Komodakis His research group has developed influential techniques including Online Bag-of-Visual-Words Generation for Unsupervised Representation Learning, which surpassed previous state-of-the-art methods. The group maintains active GitHub repositories for many of their publications, demonstrating commitment to reproducible research. Current research directions include advancing medical image analysis through deep learning, improving self-supervised learning frameworks, and developing more efficient neural network architectures.

Włodzimierz Fechnerمشاهده پروفایل

استاد

• Functional Analysis
• Mathematical Inequalities
• Differential Operators
• +۳ مورد دیگر

Włodzimierz Fechner is a Professor at Lodz University of Technology in Poland, affiliated with the Department of Contemporary Mathematical Analysis Applications. His work focuses on functional analysis, inequalities, and operator theory. Key affiliations: Lodz University of Technology (Faculty of Mathematics) His research spans functional equations, convexity properties in metric groups, and fuzzy logic. Recent studies analyze differential operators, probability functions in game theory, and generalizations of classical inequalities. Publications highlight trends in functional inequalities (e.g., Hlawka-type), fuzzy implication functions, and applications to gambling theory. Collaborative works with researchers like Eszter Gselmann and Sebastia Massanet appear in high-impact journals. No explicit awards or grants are mentioned in the provided texts. Full details below cover his academic role, publications, and research contributions.

• Combinatorics
• Algebraic Combinatorics
• Rational Catalan Numbers
• +۵ مورد دیگر

Drew Armstrong is an Associate Professor in the Mathematics Department of the College of Arts and Sciences at the University of Miami. His academic career is centered on combinatorial mathematics with significant contributions to rational Catalan combinatorics and related fields. His research spans several key areas: Rational generalizations of Catalan combinatorics Parking functions and their algebraic connections Associahedra and simplicial complexes Noncrossing and nonnesting partitions Core partitions and their properties Sweep maps and combinatorial algorithms Armstrong's work demonstrates a consistent focus on extending classical combinatorial structures to rational parameters, creating new connections between combinatorics, algebra, and geometry. His publications reveal a progression from classical Catalan combinatorics toward more general rational frameworks, often revealing deeper structural insights through these generalizations. His scholarly contributions have appeared in leading mathematics journals including Advances in Mathematics, Annals of Combinatorics, and Transactions of the American Mathematical Society, reflecting the significance of his work within the mathematical community. As an academic, Armstrong maintains active collaborations with prominent combinatorialists including Victor Reiner, Brendon Rhoades, Nicholas Loehr, and Gregory Warrington, contributing to the vibrant research environment in algebraic combinatorics.

• Quantum Information and Computation
• Quantum Many-Body Systems
• Tensor Networks
• +۷ مورد دیگر

Professor Norbert Schuch is a full Professor of Physics and Mathematics at the University of Vienna, where he leads the Research Group "Quantum Information and Quantum Many-Body Physics" at both the Faculty of Physics and Faculty of Mathematics. He joined the University of Vienna in October 2020 after serving as a tenured Research Group Leader at the Max-Planck-Institute of Quantum Optics in Garching, Germany and as a Lecturer at the Technical University Munich. Prior to that, he held a Tenure-Track-Professor position at the Institute for Quantum Information at RWTH Aachen University. Professor Schuch's research focuses at the intersection of Quantum Information and Computation with the Physics of Complex Quantum Many-Body Systems. His work combines mathematical, physical, and computational approaches to understand quantum correlations in many-body systems. Key research areas include tensor networks (such as Matrix Product States and Projected Entangled Pair States), topological order, entanglement theory, quantum algorithms, and quantum complexity theory. His interdisciplinary approach integrates methods from physics, mathematics, and theoretical computer science to address fundamental questions about quantum systems. His recent publications show a continued focus on tensor network theory and applications, with particular emphasis on topological phases, entanglement structure, quantum algorithms, and computational aspects of quantum many-body systems. His work spans mathematical foundations, physical applications, and computational implementations, demonstrating the cross-disciplinary nature of his research program. As an educator, Professor Schuch teaches courses on Quantum Information, Quantum Computing, and Quantum Algorithms, as well as specialized topics like Entanglement in Quantum Many-Body Systems. He actively supervises PhD students, postdocs, and master's students in his research group, which maintains strong connections with the international quantum information community.

Johannes Knörzerمشاهده پروفایل

پژوهشگر

• Quantum Information
• Quantum Optics
• Condensed Matter Physics
• +۳ مورد دیگر

Johannes Knörzer is a Junior Fellow at the Institute for Theoretical Studies, ETH Zürich, and a researcher in quantum information theory, quantum optics, and condensed matter physics. His work intersects quantum algorithms, quantum machine learning, and quantum simulation. Current position: Junior Fellow at ETH Zürich (2022–Present) Previous roles: Postdoctoral researcher at Max Planck Institute of Quantum Optics (2020–2022) Education: PhD in Quantum Information (2016–2020, LMU Munich & MPQ); BSc & MSc in Physics (2010–2015, Universities of Freiburg & Hamburg) Research Interests Quantum algorithms for ground state preparation and entanglement quantification Quantum optics in relativistic and ultra-strong coupling regimes Condensed matter phenomena in two-dimensional materials and polariton lattices Quantum chemistry applications in electron-electron interactions Scientific Awards Junior Fellowship at ETH Zürich Visiting Fellowship at Harvard University (2018) Collaborations & Grants Collaboration with experimental groups at ETH Zurich (Demler group), Harvard (Lukin group), and MPQ (Cirac group) Contributions to quantum network verification protocols and polariton lattice simulations Participation in international initiatives like #ScienceForUkraine Labs & Research Groups Currently hosted by Eugene Demler’s group at ETH Zurich Previous affiliations with J. Ignacio Cirac’s group at MPQ and Harvard’s Lukin group

Michael J. Lindseyمشاهده پروفایل

استادیار

• Computational Methods
• Numerical Linear Algebra
• Optimization
• +۱۹ مورد دیگر

Michael J. Lindsey is an Assistant Professor in the Department of Mathematics at the University of California, Berkeley, and a Faculty Scientist at Lawrence Berkeley National Laboratory. His research focuses on computational methods driven by Numerical Linear Algebra , Optimization , and Randomization , particularly for High-Dimensional Scientific Computing in quantum many-body problems and applied probability. University : UC Berkeley (Assistant Professor since 2022) Lab Affiliation : Mathematics Group at Lawrence Berkeley National Laboratory Email : lindsey@berkeley.edu His work includes Semidefinite Relaxation for quantum and classical problems, Monte Carlo Sampling techniques, and Tensor Networks for high-dimensional functions. He has pioneered Variational Embedding theory with guaranteed energy bounds and scalable solvers for quantum systems. Recent publications span Quantum Chemistry , Machine Learning , and High-Dimensional Probability , with applications to Electronic Structure , Molecular Dynamics , and Optimal Transport . He received the 2024 Hellman Fellowship and the 2019 SIAM Student Paper Prize . Teaching includes graduate and undergraduate courses in numerical analysis and applied mathematics at UC Berkeley and New York University. He also organizes the HDSC Seminar on high-dimensional scientific computing.

Rafail Ostrovskyمشاهده پروفایل

استاد

• Cryptography
• Theoretical Computer Science
• Algorithms
• +۴ مورد دیگر

Rafail Ostrovsky is a Distinguished Professor of Computer Science and Mathematics at UCLA, holding the Norman E. Friedman Chair in Knowledge Sciences at the Henry Samueli School of Engineering and Applied Science. As Director of the Center for Information and Computation Security, he leads research in cryptography, theoretical computer science, and secure computation with over 350 refereed publications and 15 issued USPTO patents. His primary research focuses on cryptography and theoretical computer science, with significant contributions to private information retrieval, zero-knowledge proofs, secure multi-party computation, and privacy-preserving technologies. His work bridges theoretical foundations with practical applications in network security, data analysis, and cryptographic protocols. Dr. Ostrovsky's research has evolved from fundamental cryptographic primitives to complex systems addressing modern security challenges in distributed environments, with recent work emphasizing efficient secure computation, robust protocols, and privacy-preserving techniques for high-dimensional data. His publication record demonstrates consistent leadership in cryptography, with recent articles focusing on zero-knowledge systems, secure computation protocols, and cryptographic primitives with enhanced security properties. The research trends show increasing emphasis on efficiency, robustness against malicious adversaries, and practical implementations of theoretical cryptographic concepts. 1993 Henry Taub Prize 2017 IEEE Computer Society Edward J. McCluskey Technical Achievement Award 2018 RSA Award for Excellence in Mathematics 2022 W. Wallace McDowell Award (highest award from IEEE Computer Society) Fellow of AAAS, ACM, IEEE, and IACR Foreign member of Academia Europaea Fellow of the National Academy of Inventors Dr. Ostrovsky has held significant leadership roles including chair of the IEEE Technical Committee on Mathematical Foundations of Computing (2015-2018) and chair of the IEEE FOCS 2011 Program Committee. He has served on over 40 international conference program committees and currently serves on editorial boards for Journal of ACM, Algorithmica Journal, and Journal of Cryptology. At UCLA, he teaches foundational courses including Introduction to Cryptography (CS183), Foundations of Cryptography (CS282A/M209A), and Cryptographic Protocols (CS282B/M209B). As Director of the Center for Information and Computation Security, Dr. Ostrovsky leads a multidisciplinary team advancing research in cryptography, network security, and privacy technologies. His group collaborates across computer science, mathematics, and engineering disciplines to develop innovative solutions for contemporary security challenges, with upcoming work focusing on obfuscation, proof systems, and secure computation as evidenced by his scheduled visiting scientist position for Summer 2025.

Sally Cockburnمشاهده پروفایل

استاد

• Set Theory
• Philosophy of Mathematics
• Combinatorial Optimization
• +۴ مورد دیگر

Sally Cockburn is a Professor in the Mathematics and Statistics Department at Hamilton College, where she has been part of the faculty since 1991. Her research spans combinatorial optimization, geometric graph theory, and the philosophical foundations of mathematics. Education: Ph.D. from Yale University, M.Sc. from Queen’s University, M.Sc. from University of Ottawa, B.Sc. (Honors) from Queen’s University Her research focuses on geometric graph homomorphisms and poset structures, with applications in combinatorial optimization and computational complexity. She has explored philosophical questions in mathematics education and developed pedagogical materials for undergraduate courses. Recent publications analyze geometric graph properties (like K2,n and K3,3), NP-hardness, and set theory. These works situate her at the intersection of discrete mathematics and educational innovation. Scientific Awards: Mathematical Association of America Carl B. Allendoerfer Award (2014) Class of 1963 Faculty Fellowship (2005, 1996) Cockburn mentors students through collaborative research, notably guiding Yonghyun Song and Joshua Lesperance. She actively participates in college governance as a faculty secretary and on academic policy committees. As Mellon curricular leader for quantitative reasoning and squash team coach, she integrates academic and athletic leadership.

• Control Systems
• Discrete Event and Hybrid Systems
• Max-Plus Algebra
• +۵ مورد دیگر

Jörg Raisch is a Professor of Control Systems at the Technische Universität Berlin , affiliated with the Faculty IV - Electrical Engineering and Computer Science and the Institute for Energy and Automation Technology . He holds the chair of "Fachgebiet Regelungssysteme" since March 2006. Raisch studied "Technische Kybernetik" (Engineering Cybernetics) at Stuttgart University, Germany, and Control Systems at UMIST, Manchester, UK. He earned his Ph.D. in Chemical Engineering from Stuttgart University, followed by postdoctoral work at the University of Toronto and a DFG fellowship for his habilitation (1998). He established a research group at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg and served as an External Scientific Member since 2002. His research spans control theory , discrete event systems , max-plus algebra , and applications in energy systems and robotics . Recent work focuses on clock drift effects in low-inertia power systems , iterative learning control , and distributed control for microgrids . His publications highlight methodologies for timed event graphs , probabilistic behavioral distances , and wind turbine optimization . From 2007–2013, he represented Germany in the European Control Association (EUCA). He served on editorial boards of journals like Automatica and IEEE Transactions on Control Systems Technology . He held leadership roles in IFAC Technical Committee TC1.3 as Vice-Chair (2014–2017, 2020–present) and Chair (2017–2020) .

• Bioinformatics
• Computational Biology
• Genomics
• +۳ مورد دیگر

Mr. Leonard Bohnenkämper, M.Sc., is a researcher affiliated with the Faculty of Engineering at Bielefeld University . He is actively involved with the Genome Informatics Group and the Center for Biotechnology (CeBiTec) , focusing on computational genomics and genome rearrangement analysis. His work spans algorithm development for genomic distance metrics and natural genome halving. His research interests include: Computational modeling of genome rearrangements Development of algorithms for natural genome analysis Genomic distance metrics and epidemiology applications Bioinformatics tool creation for large-scale genomic datasets Mr. Bohnenkämper contributes to academic infrastructure through his membership in the Institute for Bioinformatics Infrastructure (BIBI) board and management. His work aligns with Bielefeld University's strategic focus on socio-technical systems and interdisciplinary research at the intersection of computer science, biology, and technology. He is involved in: IT support for research groups Academic infrastructure development Training and education in bioinformatics

Daniele Ettore Oteraمشاهده پروفایل

عضو هیئت علمی

• Geometric Group Theory
• Low-dimensional Topology
• Geometric Topology
• +۳ مورد دیگر

Dr. Daniele Ettore Otera is a Senior Researcher at the Institute of Data Science and Digital Technologies (DMSTI) and the Faculty of Mathematics and Informatics of Vilnius University , Lithuania. His work is centered on geometric group theory, low-dimensional topology, and group theory, with a focus on asymptotic topology and topological tameness of groups and manifolds. Education: He earned a Mathematics degree from the University of Palermo (1999), a DEA (Master’s) from Université Paris-Sud 11 (2001), and a co-tutored PhD from both University of Palermo and Université Paris-Sud 11 (2006). Research Interests: Geometric group theory: quasi-isometries, ends of groups, lattices in Lie groups Low-dimensional topology: topological tameness, simple connectivity at infinity, geometric simple connectivity Group theory: subgroup permutability, commutativity degrees, probability in group theory Publications: His recent work spans graph theory, spectral invariants, group actions, and geometric topology, reflecting a deep interdisciplinary approach combining algebra, topology, and combinatorics. Labs & Teams: He is affiliated with the Interdisciplinary Statistical Research Group within DMSTI, contributing to collaborative research in mathematical sciences.

• Digital Signal Processing
• Cryptography
• System Identification
• +۳ مورد دیگر

Kazys Kazlauskas is an Affiliated Scientist at the Image and Signal Analysis Group of the Vilnius University Institute of Data Science and Digital Technologies . His research focuses on Digital Signal Processing , Cryptography , and System Identification , with significant contributions to spectrum estimation , deadzone compensation , and key-dependent S-box generation in encryption systems. Research Trends : His work spans Wiener systems , nonlinear modeling , frequency analysis , and noise reduction , particularly in block cipher systems and adaptive control . Collaborations : Frequent collaborator with Rimantas Pupeikis , Gytis Vaicekauskas , and Robert Smalius , especially in cryptography and signal processing applications. Grants & Projects : No explicit grants are listed, but his involvement in publications suggests participation in institutional research initiatives at Vilnius University.