Felix Hausdorff was a German mathematician who is considered to be one of the founders of modern topology and who contributed significantly to set theory, descriptive set theory, measure theory, and functional analysis.
Gregory John Chaitin is an Argentine-American mathematician and computer scientist. Beginning in the late 1960s, Chaitin made contributions to algorithmic information theory and metamathematics, in particular a computer-theoretic result equivalent to Gödel's incompleteness theorem. He is considered to be one of the founders of what is today known as algorithmic complexity together with Andrei Kolmogorov and Ray Solomonoff. Along with the works of e.g. Solomonoff, Kolmogorov, Martin-Löf, and Leonid Levin, algorithmic information theory became a foundational part of theoretical computer science, information theory, and mathematical logic. It is a common subject in several computer science curricula. Besides computer scientists, Chaitin's work draws attention of many philosophers and mathematicians to fundamental problems in mathematical creativity and digital philosophy.
The Rhenish Friedrich Wilhelm University of Bonn is an elite public research university located in Bonn, North Rhine-Westphalia, Germany. It was founded in its present form as the Rhein-Universität on 18 October 1818 by Frederick William III, as the linear successor of the Kurkölnische Akademie Bonn which was founded in 1777. The University of Bonn offers many undergraduate and graduate programs in a range of subjects and has 544 professors. The University of Bonn is a member of the German U15 association of major research-intensive universities in Germany and has the title of "University of Excellence" under the German Universities Excellence Initiative; it is consistently ranked amongst the best German universities in the world rankings and is one of the most research intensive universities in Germany.
A computer scientist is a person who is trained in the academic study of computer science.
Leonid Genrikhovich Khachiyan was a Soviet and American mathematician and computer scientist.
Samuel Standfield Wagstaff Jr. is an American mathematician and computer scientist, whose research interests are in the areas of cryptography, parallel computation, and analysis of algorithms, especially number theoretic algorithms. He is currently a professor of computer science and mathematics at Purdue University who coordinates the Cunningham project, a project to factor numbers of the form bn ± 1, since 1983. He has authored/coauthored over 50 research papers and three books. He has an Erdős number of 1.
Lawrence L. Larmore is an American mathematician and theoretical computer scientist. Since 1994 he has been a professor of computer science at the University of Nevada, Las Vegas (UNLV). Larmore developed the package-merge algorithm for the length-limited Huffman coding problem, as well as an algorithm for optimizing paragraph breaking in linear time. He is perhaps best known for his work with competitive analysis of online algorithms, particularly for the k-server problem. His contributions, with his co-author Marek Chrobak, led to the application of T-theory to the server problem.
Bernhard H. Korte is a German mathematician and computer scientist, a professor at the University of Bonn, and an expert in combinatorial optimization.
The Hausdorff Center for Mathematics (HCM) is a research center in Bonn, formed by the four mathematical institutes of the Rheinische Friedrich-Wilhelms-Universität Bonn, the Max Planck Institute for Mathematics (MPIM), and the Institute for Social and Economic Sciences.
Jens Franke is a German mathematician. He has held a chair at the University of Bonn's Hausdorff Center for Mathematics since 1992. Franke's research has covered various problems of number theory, algebraic geometry and analysis on locally symmetric spaces.
Karl-Theodor "Theo" Sturm is a German mathematician working in stochastic analysis.
Wojciech Rytter is a Polish computer scientist, a professor of computer science in the automata theory group at the University of Warsaw. His research focuses on the design and analysis of algorithms, and in particular on stringology, the study of algorithms for searching and manipulating text.
Peter Scholze is a German mathematician known for his work in arithmetic geometry. He has been a professor at the University of Bonn since 2012 and director at the Max Planck Institute for Mathematics since 2018. He has been called one of the leading mathematicians in the world. He won the Fields Medal in 2018, which is regarded as the highest professional honor in mathematics.
András Sebő is a Hungarian-French mathematician working in the areas of combinatorial optimization and discrete mathematics. Sebő is a French National Centre for Scientific Research (CNRS) Director of Research and the head of the Combinatorial Optimization. group in Laboratory G-SCOP, affiliated with the University of Grenoble and the CNRS.
Catharina Stroppel is a German mathematician whose research concerns representation theory, low-dimensional topology, and category theory. She is a professor of mathematics at the University of Bonn, and vice-coordinator of the Hausdorff Center for Mathematics in Bonn.
Barbara Niethammer is a German mathematician and materials scientist who works as a professor at the Hausdorff Center for Mathematics at the University of Bonn. Her research concerns partial differential equations for physical materials, and in particular the phenomenon of Ostwald ripening by which particles in liquids grow over time.
Angelika Steger is a mathematician and computer scientist whose research interests include graph theory, randomized algorithms, and approximation algorithms. She is a professor at ETH Zurich.
Karpiński is a surname. Notable people with the surname include the Karpiński family, a Polish noble family.
The history of Polish computing (informatics) began during the Second World War with breaking the Enigma machine code by Polish mathematicians. After World War II, work on Polish computers began. Poles made a significant contribution to both the theory and technique of world computing.
