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) 475-5193

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 2019

Office hours: send email

Current Courses

Math/CS REU-NSF program mentor, CS area, daily

Recent Courses

CSCI-462: Introduction to Cryptography, last taught Fall 2018
CSCI-662: Foundations of Cryptography, last taught Fall 2018
CSCI-665: Foundations of Algorithms, last taught Spring 2017
CSCI-761: Topics in Advanced Algorithms - Combinatorial Computing, last taught Spring 2019
CSCI-762: Advanced Cryptography, last taught Spring 2018

Other Past Courses

VCSS-380: Introduction to CS Theory, last taught Spring 2009
VCSG-700: Foundations of CS Theory, last taught Winter 2005/2006
VCSG-704/VCSS-481: Complexity and Computability, last taught Spring 2001
VCSG-709/VCSS-590: Xtreme Theory, last taught Spring 2004
VCSG-801: Advanced Algorithms, Combinatorial Computing, last taught Fall 2011
VCSG-893: MS Project/Thesis Seminar, last taught Winter 2008/2009
4040-840: Security and Trust, Hashing, taught jointly with Prof. Hans-Peter 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 P-time * gallery of Combinatorial People * CS-RIT 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 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 at RIT page. House of Graphs containing many interesting Ramsey graphs, designed and maintained by Jan Goedgebeur at the University of Ghent. Lectures on Combinatorial Computing and Cryptography in Gdańsk.

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

Mini CV

I was born in Gdańsk, Poland. In 1980, I 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.

Zapal swieczke zamiast przeklinac ciemnosc.




* * *




P-time algorithm for recognizing primes