Spectral graph theory, probabilistic methods in combinatorics, coding theory, random geometric graphs
- Two-batch liar games over a general bounded channel, with K. Nyman, submitted.
- Random geometric graph diameter in the unit ball, with J.L. Martin and C.H. Yan, Algorithmica, 47 (2007), 421-438.
- The Renyi-Ulam pathological liar game with a fixed number of lies, with V. Ponomarenko and C.H. Yan, J. Combin. Theory Ser. A, 112 (2005), 328-336.
- Asymmetric binary covering codes, with J.N. Cooper and A.B. Kahng, J. Combin. Theory Ser. A 100 (2002), 232--249.
- A chip-firing game and Dirichlet eigenvalues, with F.R.K. Chung, Discrete Math. 257 (2002), 341-355.
|
| |

10 W. 32nd Street
Engineering 1 Room 105C
Chicago, IL 60616
312.567.5336
312.567.3135 fax

http://math.iit.edu/~rellis/
Office Hours: See personal webpage
|
|
|
| |