Site-wide links

<<   April 2014   >>
Su Mo Tu We Th Fr Sa
w     1 2 3 4 5
w 6 7 8 9 10 11 12
w 13 14 15 16 17 18 19
w 20 21 22 23 24 25 26
w 27 28 29 30      

  Search By:
Date Range:  
Start Date Click Here to open the calendar
End Date   Click Here to open the calendar
include date range

Event Details
Event Name: GCCIS PhD Colloquium Series
Category: Academic/College Events
Sub Category: GCCIS
Description: Computational Study of Ramsey Arrowing

Presentation by:
Stanislaw Radziszowski, Ph.D.

This presentation will have three parts. In the first part I will describe the general area of computational Ramsey theory, and in particular the problem of designing algorithmic techniques to decide whether the Ramsey arrowing operator holds or not. This is my main area of research interests since the early 1990's. The other two parts will contain some details of two recent projects: computation of the Ramsey number R(3,K10-e), the smallest previously open case of this type (joint work Jan Goedgebeur from Ghent University, Belgium), and discovering new connections between Shannon capacity of noisy channels modeled by graphs and classical multicolor Ramsey numbers (joint work with Xu Xiaodong from Nanning, Guangxi Academy of Sciences, China).

Stanislaw Radziszowski is a Professor in the Department of Computer Science at RIT since 1995. He earned Ph.D. from the Institute of Informatics at the University of Warsaw. During the years 1980-1984 he worked in IIMAS at the National Autonomous University of Mexico in Mexico City, and since 1984 at RIT. In the 1990's he held three times visiting positions at the Australian National University in Canberra, and he continuously maintains collaborations with universities in Poland.

His main research interest is in combinatorial computing - solving classical problems in combinatorics, graph theory and design theory, usually with the help of computations. His survey "Small Ramsey Numbers," which is a regularly updated living article at the Electronic Journal of Combinatorics, became a standard reference in this area. He teaches mostly theory oriented courses, including popular courses on cryptography at undergraduate and graduate levels. His recent work on applied cryptography led to joint projects with Computer Engineering Department at RIT.
Schedules: 12/06/2013   (11:00 AM - 12:00 PM)

Contact: Joyce Hart
Phone: 475-6193
Cost: Free