Stanisław P. Radziszowski (born June 7, 1953) is a
Polish-
American
American(s) may refer to:
* American, something of, from, or related to the United States of America, commonly known as the "United States" or "America"
** Americans, citizens and nationals of the United States of America
** American ancestry, pe ...
mathematician and
computer scientist
A computer scientist is a person who is trained in the academic study of computer science.
Computer scientists typically work on the theoretical side of computation, as opposed to the hardware side on which computer engineers mainly focus (al ...
, best known for his work in
Ramsey theory.
Radziszowski was born in
Gdańsk
Gdańsk ( , also ; ; csb, Gduńsk;Stefan Ramułt, ''Słownik języka pomorskiego, czyli kaszubskiego'', Kraków 1893, Gdańsk 2003, ISBN 83-87408-64-6. , Johann Georg Theodor Grässe, ''Orbis latinus oder Verzeichniss der lateinischen Benen ...
,
Poland, and received his PhD from the Institute of Informatics of the
University of Warsaw in 1980. His thesis topic was "Logic and Complexity of Synchronous Parallel Computations". From 1976 to 1980 he worked as a visiting professor in various universities in
Mexico City. In 1984, he moved to the
United States, where he took up a position in the Department of Computer Science at the
Rochester Institute of Technology.
Radziszowski has published many papers in
graph theory, Ramsey theory,
block design
In combinatorial mathematics, a block design is an incidence structure consisting of a set together with a family of subsets known as ''blocks'', chosen such that frequency of the elements satisfies certain conditions making the collection of bl ...
s,
number theory and
computational complexity
In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) ...
.
In a 1995 paper with
Brendan McKay he determined the
Ramsey number
In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. To demonstrate the theorem for two colours (say ...
R(4,5)=25.
[ His survey of Ramsey numbers, last updated in March 2017, is a standard reference on the subject and published at the Electronic Journal of Combinatorics.]
References
External links
Radziszowski's survey of small Ramsey numbers
Home Page
Sound file of Radziszowski speaking his own name (au format)
{{DEFAULTSORT:Radziszowski, Stanislaw
1953 births
Living people
Polish academics
Polish mathematicians
Polish computer scientists
Rochester Institute of Technology faculty
Combinatorialists
University of Warsaw alumni