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

• Cryptography
• Elliptic Curves
• Post-Quantum Cryptography
• +۱ مورد دیگر

Dr. Huseyin Hisil is a Lecturer in Cryptography at the University of Wollongong's School of Computing and Information Technology. His research focuses on asymmetric cryptosystems, including elliptic curve cryptography, hyperelliptic curves, and post-quantum cryptographic solutions. He develops optimized algorithms for multiprecision arithmetic and finite field operations. Recent publications address efficient elliptic curve arithmetic using Karatsuba-friendly primes and Jacobian coordinate systems for genus 2 curves. His work bridges computational number theory with practical cryptographic implementations, enhancing security and performance in next-generation systems. He teaches undergraduate courses including Introduction to Web Technology (CSIT128) and Web Development (CSIT884), while coordinating Professional Capstone Projects (CSIT998). His research group explores cryptographic pairings and algebraic structures relevant to quantum-resistant protocols.

Erin Claire Carsonمشاهده پروفایل

استادیار

• Numerical Linear Algebra
• Parallel Computing
• High-Performance Computing
• +۷ مورد دیگر

Erin Claire Carson is an Assistant Professor at the Department of Numerical Mathematics, Faculty of Mathematics and Physics, Charles University, Prague. A specialist in numerical linear algebra and high-performance computing, she leads the ERC Starting Grant project InEXASCALE focused on exascale algorithms. Her research explores mixed precision arithmetic, communication-avoiding Krylov subspace methods, and stability analysis in finite precision. Ph.D., University of California, Berkeley (2015) Courant Instructor, New York University (2015-2018) Postdoctoral Researcher and PRIMUS Fellow, Charles University (2018-2022) Dr. Carson's work bridges theoretical analysis with practical implementations for supercomputers. Her recent publications include advancements in low-synchronization orthogonalization, silent error detection, and multilevel sampling techniques. She received the 2025 Wilkinson Prize from SIAM for outstanding contributions to numerical analysis. Current trends in her research involve: Exploiting mixed precision arithmetic for algorithm acceleration Developing stable communication-avoiding Krylov methods Optimizing numerical stability in GPU-based solvers Understanding error propagation in multistage refinements Scientific honors: 2025 SIAM Wilkinson Prize in Numerical Analysis and Scientific Computing 2023 ERC Starting Grant recipient 2019-2022 PRIMUS Research Fellow She supervises PhD and Master’s students while teaching advanced courses in numerical linear algebra and high-performance computing. Her work has been featured in WIRED and Forbes Czech Republic for improving supercomputer algorithms.

• Automated Reasoning
• Systolic Computations
• Multiprecision Arithmetic
• +۳ مورد دیگر

Tudor Jebelean is a full professor at the Research Institute for Symbolic Computation (RISC) within Johannes Kepler University (JKU), located in Linz, Austria. His primary affiliation is with RISC, where he leads research in automated reasoning, symbolic computation, and algorithm design. Roles: A.Univ.-Prof. (Universitätsprofessor) at RISC, JKU Research Focus: Automated reasoning, systolic computations, multiprecision arithmetic, and formal methods. Jebelean's work centers on advancing theorem proving systems like Theorema , which integrates computation and deduction for natural-style mathematics. He develops algorithms for sorting, data structure manipulation, and formal verification, often using combinatorial and logic-based techniques. His contributions include the design of systolic architectures for arithmetic operations and the synthesis of algorithms through mechanical proving. Publications highlight his research on automated prover systems, certification of sorting algorithms, and symbolic computation tools. He collaborates extensively with researchers like Isabela Dramnesc and Sorin Stratulat on algorithm synthesis and formal verification. His research bridges theoretical foundations with practical applications in computer science and mathematics education.

Ambros Gleixnerمشاهده پروفایل

استاد

• Mathematical Optimization
• Operations Research
• Computational Mathematics
• +۷ مورد دیگر

Ambros Gleixner is a Professor at HTW Berlin since 2020 and an affiliated researcher at the Zuse Institute Berlin (ZIB) since 2008. His research focuses on computational aspects of mixed-integer linear and nonlinear programming, with emphasis on exact rational arithmetic and algorithm verification. PhD in Mathematics (2015), Technische Universität Berlin Diplom (MSc) in Mathematics (2008), Technische Universität Berlin Vordiplom (BSc) in Mathematics (2004), Universität Bayreuth His work spans mathematical optimization, operations research, and computational mathematics. At ZIB, he leads projects like developing the MINLP solver SCIP , the LP solver SoPlex , and verifying integer programming results through VIPR . Recent publications highlight advancements in exact rational MIP, GPU-parallel algorithms, and energy system optimization. Scientific Awards : MERIT Visiting Scholar at University of Melbourne (2013) Teaching : Offers bachelor's theses in optimization and computational mathematics. Requires students to have attended relevant seminars and possess programming skills. Office hours by email appointment through Ambros.Gleixner@HTW-Berlin.de . Labs & Teams : Principal investigator at ZIB's Mathematical Algorithmic Intelligence division, Research Campus MODAL , and Linear, Integer, and Constraint Programming project.

Charles Weemsمشاهده پروفایل

استاد

• Parallel Computing
• Distributed Systems
• Computer Architecture
• +۷ مورد دیگر

Charles Weems is a Professor of Computer Science at the University of Massachusetts, Amherst, and a pivotal figure in parallel and distributed computing education. He co-authored 28 textbooks and co-led the Center for Parallel and Distributed Computing Curriculum Development and Educational Resources (CDER), whose work influenced the ACM 2013 Curriculum and AP Computer Science Principles course. He received the University Distinguished Teaching Award and contributed to founding a local Waldorf high school, designing a four-year computer science curriculum. His research focuses on parallel architectures and algorithms, notably the development of the Image Understanding Architecture, caches, nonvolatile memory systems, and GPU-based multiprecision arithmetic. He has held leadership roles in the IEEE Technical Committee on Parallel Processing, including co-chairing its diversity and inclusion committee, and expanded workshops at the International Parallel and Distributed Processing Symposium (IPDPS). Awards: 2021 Taylor L. Booth Education Award Senior Member of the IEEE ACM Distinguished Educator

Matiyasevich Yuriمشاهده پروفایل

استاد

• Diophantine equations
• Computability theory
• Algorithms
• +۱ مورد دیگر

Yuri Matiyasevich is a Russian mathematician and computer scientist affiliated with the Steklov Institute of Mathematics (Leningrad/St.Petersburg Branch) since 1980, where he serves as head of the Laboratory of Mathematical Logic. He also holds part-time professorships at Leningrad/St.Petersburg State University (since 2003) and previously at Polytechnical Institute (1980-1981). His research focuses on Diophantine equations, Computability theory, Algorithms, and Decidability problems. Full member, Russian Academy of Sciences (2008) Corresponding member, Bavarian Academy of Sciences (2007) Docteur Honoris Causa, Université Pierre et Marie Curie (2003) Humboldt Research Award (1997) Markov Prize, Academy of Sciences of the USSR (1980) His recent work involves computational approaches to Riemann's zeta function, probabilistic reformulations of graph theory problems, and algorithmic analysis of Diophantine representations. He has published extensively on connections between number theory and computational models, including studies on exponential Diophantine equations and their applications. Notable contributions include definitive solutions to Hilbert's Tenth Problem through Diophantine representations of recursively enumerable sets, and computational experiments supporting the Riemann Hypothesis. His publications span multiple languages and cover intersections between mathematical logic, number theory, and theoretical computer science.