Stanisław P. Radziszowski
Professor
Department of Computer Science
Rochester Institute of Technology
Rochester, NY 14623
email spr@cs.rit.edu,
bldg. 70B room 3657, phone (585) 4755193
publications by time or
subject,
combinatorial computing
theses/projects of MS advisees,
topics/problems to work on
up to:
CS faculty *
CS department *
College of Computing *
RIT *
Rochester NY
Summer 2024, term 2238
Office hours

on
zoom (must prearrange time),
or by email spr@cs.rit.edu
Current Courses

none
Recent Courses

CSCI462:
Introduction to Cryptography,
last taught Fall 2023

CSCI661: Foundations of CS Theory,
last taught Spring 2024

CSCI662:
Foundations of Cryptography,
last taught Fall 2023

CSCI665:
Foundations of Algorithms,
last taught Spring 2017

CSCI761:
Topics in Algorithms  Combinatorial Computing,
last taught Spring 2021

CSCI762:
Advanced Cryptography,
last taught Spring 2020

CSCI764:
QuantumResistant Cryptography,
jointly with Prof. Borrelli, last taught Spring 2024
Other Past Courses
 VCSS380: Introduction to CS Theory,
last taught Spring 2009
 VCSG704/VCSS481:
Complexity and Computability,
last taught Spring 2001
 VCSG709/VCSS590: Xtreme Theory,
last taught Spring 2004
 VCSG801: Advanced Algorithms,
Combinatorial Computing,
last taught Fall 2011
 VCSG893: MS Project/Thesis Seminar,
last taught Winter 2008/2009

4040840: Security and Trust,
Hashing,
taught jointly with Prof. HansPeter Bischof,
last taught Winter 2012/2013
main results *
publications by (time 
subject) *
resume (ps  pdf) *
student theses and projects *
long ago * now *
Primes are in Ptime *
gallery of
Combinatorial People *
CSRIT Colloquia Series *
pronunciation of Polish names *
tigered Mobius strip *
logo *
logo *
PaPiS *
Lec
What am I doing?
My main interest is in
combinatorial computing  solving classical
problems in combinatorics, graph theory and design theory, usually
with the help of long and/or tricky computations.
Bounds on Ramsey numbers are my favorite. The survey of
Small Ramsey Numbers
is a regularly updated living article in Dynamic Surveys
of the
Electronic Journal of Combinatorics.
Jointly with
Brendan McKay,
we have computed the Ramsey number
R(4,5)=25 (paper/picture)
and improved upper bounds for R(5,5) and R(4,6).
For multicolor numbers, a joint work with Susan Fettes and Richard Kramer
led to a new upper bound for
R(3,3,3,3).
My longtime collaboration on Ramsey and Folkman problems
with Xiaodong Xu led to many of the publications
listed here, most of them
cited in a great book by Xiaodong et al. entitled
Ramsey Theory.
See also:
Computational Ramsey Theory at RIT page,
House of Graphs
containing many interesting Ramsey graphs, designed
and maintained by
Jan Goedgebeur at the University of Ghent.
My other favorite field is computational design theory,
for example claims like that
4(12,6,6) designs do not exist,
and 2(22,8,4) designs do
not exist. And for teaching,
look at the lectures on
Combinatorial Computing and Cryptography in Gdańsk.
From 1991 to 2009, I was organizing the CS Colloquia Series
(html 
ps 
tinyps 
tinypdf best viewed with 1000% zoom).
Mini CV
I was born in Gdańsk,
Poland, in 1953.
I earned a Ph.D. in mathematics and computer science in 1980,
advised by
Antoni Kreczmar and
Andrzej Salwicki,
at the
Institute of Informatics at the
University of Warsaw.
During the years 19801984 I worked in
IIMAS
at the National Autonomous University
of Mexico (UNAM) in Mexico City,
and since the Fall of 1984 at the
RIT.
Zapal swieczke zamiast przeklinac ciemnosc.
* * *
Ptime algorithm for recognizing primes