| Robert B. Ellis |
|
| Assistant Professor, Applied Mathematics, IIT | |
|
|
|
Research Interests[spectral] graph theory, combinatorics,
coding theory methods, algorithm design & analysis |
Spring `08 Teaching |
Applied Mathematics E1 Bldg., Rm. 208 Chicago, IL 60616
Office: E1 105C
|
Selected Research Papers (complete listing)1. Variance of the subgraph count for Erdos-Renyi graphs (pdf) submitted (w/James P. Ferry). 2. Two-batch liar games on a general bounded channel (pdf slides), submitted (w/K. Nyman). 3. The Renyi-Ulam pathological liar game with a fixed number of lies (arXiv pdf), J. Combin. Theory Ser. A 112 (2005), 328-336 (w/V. Ponomarenko and C.H. Yan). 4. Random geometric graph diameter in the unit ball, Algorithmica 47 (2007), 421-438 (arXiv pdf) (with J.L. Martin and C.H. Yan). The original publication is available at www.springerlink.com. 5. Asymmetric binary covering codes (arXiv pdf), J. Combin. Theory Ser. A 100 (2002), 232--249 (2002) (w/J.N. Cooper, A.B. Kahng). 6. A chip-firing game and Dirichlet eigenvalues (pdf), Discrete Math. 257 (2002), 341-355 (w/F.R.K. Chung). |
||
Samples of Research Interests1. The Probabilistic Method meets combinatorial coding theory: · Asymmetric binary covering codes (ppt slides) (arXiv), JCTA 100, 2002 (with Joshua Cooper and Andrew B. Kahng). · Improved upper bounds (paper #261) on radius 1 cases by David Applegate, Eric Rains, and Neil Sloane · New upper bounds on code sizes by Geoff Exoo and Esa Seuranen · Improved density upper bound by Michael Krivelevich, Benny Sudakov, and Van Vu · Corresponding density of normal binary covering codes (arXiv) (R.B. Ellis) · Torus hitting times and Green's functions (html, images) 2. Torus hitting times and Green's functions (html, images) 3. Hearing the shape of a graph via its spectrum (html, images, wav) |
||
|
Copyright Disclaimer |
||
|
|
||
