جستجوی استاد راهنمای دانشگاهی

• 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.

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.