Stanisław P. Radziszowski


Department of Computer Science
Rochester Institute of Technology
Rochester, NY 14623

email, office bldg. 70B room 3657
phones (585) 475-5193 * fax (585) 475-4935

publications by time or subject, combinatorial computing
projects/theses of MS advisees, topics/problems to work on

up to: CS faculty * CS department * College of Computing * RIT * Rochester NY

Fall 2014 Semester

Office hours: MW 10am-11am, 6:30pm-7:30pm, or send email

Current Courses

CSCI 462: Introduction to Cryptography, MWF 9:00pm - 9:50pm, room 70-1620
CSCI-662: Foundations of Cryptography, MW    5:00pm - 6:15pm, room 70-2690

Semester Courses

CSCI-662: Foundations of Cryptography, last offering Fall 2013
CSCI-665: Foundations of Algorithms, last offering Fall 2013

Past Quarter Courses

VCSS-380: Introduction to CS Theory, last offering Spring 2009
VCSG-700: Foundations of CS Theory, last offering Winter 2005/2006
VCSG-704/VCSS-481: Complexity and Computability, last offering Spring 2001
VCSG-705/VCSS-482: Cryptography I, last offering Winter 2012/2013
VCSG-706: Cryptography II, last offering Spring 2013
VCSG-709/VCSS-590: Xtreme Theory, last offering Spring 2004
VCSG-800: Algorithms, last offering Spring 2013
VCSG-801: Topics in Advanced Algorithms, Combinatorial Computing, last offering Fall 2011
VCSG-893: MS Project/Thesis Seminar, last offering Winter 2008/2009
4040-840: Security and Trust, Hashing, taught jointly with Prof. Hans-Peter Bischof, last offering Winter 2012/2013

defended theses and projects * main results * publications by (time | subject) * resume (ps | pdf) * long ago * now * Primes are in P-time * graph theory White Pages * gallery of Combinatorial People * CS-RIT Colloquia Series * pronunciation of Polish names * tigered Mobius strip * logo * logo * PaPiS

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 massive 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 R(3,3,3,3) <= 62. And more ...

Computational Ramsey Theory page.

My other favorite field are computations in the design theory. We know that 4-(12,6,6) designs do not exist. Many people for a long time were trying to decide whether 2-(22,8,4) designs exist. One related project used more than a century of cpu time. In Spring 2006 we learned that it does not exist. Check the complete list of my publications for other papers (most of them in postscript and/or pdf).

From 1991 to 2009, I was organizing the CS Colloquia Series ( html | ps | tiny-ps | tiny-pdf best viewed with 1600% zoom ).
Lectures on Combinatorial Computing and Cryptography in Gdańsk, November 22-26, 2010.

Mini CV

I was born in Gdańsk, Poland. In 1980, I have earned Ph.D. from the Institute of Informatics at the University of Warsaw. During 1980-1984 I worked in IIMAS at the National Autonomous University of Mexico ( UNAM ) in Mexico City, and since the Fall of 1984 at the RIT.

* * *

P-time algorithm for recognizing primes