Chris GauthierDickey: Vita

Bio

Chris GauthierDickey received his Ph.D. from the University of Oregon where he was the recipient of a National Science Foundation Graduate Research Fellowship in 2003. His research is centered around peer-to-peer networking and secure consistency, and he is one of the few researchers doing work in computer games. His current research is focused on the measurement and modeling of large-scale multiplayer games and peer-to-peer voice communications over the network. He also teaches networking, security, and game development courses in the Department of Computer Science.

Education

Ph.D. in Computer Science, University of Oregon, 2007.
B.S. in Computer Science, University of Oregon, 2001.

Awards and Grants

NSF DUE (Co-PI), Collaborative Research: A Partnership for Developing the IA Workforce (Award #0911991), $299k, 2009-2011
WIRED Grant (Co-PI), Colorado, $410k, 2008-2009
NSF Graduate Research Fellow, 2002-2005

Courses Taught

Secure Memory Models, Winter 2009
Unix Tools, Fall 2008
Distributed Stream Processing, Fall 2008
Introduction to Computer Science III, Spring 2008
Game Programming I, Spring 2008, Sprint 2009
Computer Networking, Winter 2007, Winter 2008
Networks and Games, Spring 2007, Winter 2008

Publications

G. Papp and C. GauthierDickey, A Location Aware P2P Voice Communication Protocol for Networked Virtual Environments, To appear in The 16th ACM Symposium on Virtual Reality Software and Technology, Kyoto, Japan, November 2009.
G. Papp and C. GauthierDickey, Characterizing and Modeling Multiparty Voice Communication for Multiplayer Games, 19th ITC Specialist Seminar on Network Usage and Traffic, October, 2008
C. GauthierDickey and C. Grothoff, Bootstrapping of Peer-to-Peer Networks, DAS-P2P, August 2008
G. Papp and C. GauthierDickey, Characterizing Multiparty Voice Communications for Multiplayer Games (extended abstract), ACM Sigmetrics, June 2008
N. Evans, C. GauthierDickey, and C. Grothoff, Routing in the Dark: Pitch Black, ACSAC 2007, December 2007.
D. Pittman and C. GauthierDickey, A Measurement Study of Virtual Populations in Massively Multiplayer Online Games, Proceedings of ACM Netgames, September 2007.
C. GauthierDickey, V. Lo, D. Zappala, Using N-Trees for Scalable Event Ordering in Peer-to-Peer Games, Proceedings of ACM NOSSDAV, June 2005.
V. Lo, D. Zhou, Y. Liu, C. GauthierDickey, J. Li, Scalable Supernode Selection in Peer-to-Peer Overlay Networks, HotP2P, July, 2005.
C. GauthierDickey, D. Zappala, V. Lo, A Fully Distributed Architecture for Massively Multiplayer Online Games, Proceedings of ACM NetGames, August 2004.
C. GauthierDickey, D. Zappala, V. Lo, J. Marr, Low-Latency Cheat-Proof Event Ordering for Peer-to-Peer Games, Proceedings of ACM NOSSDAV, June 2004. [25.3% (24/95)]
D. Zappala, V. Lo, C. GauthierDickey, The Multicast Address Allocation Problem: A Theoretical Framework and Performance Evaluation, Special Issue of Computer Networks, Elsevier Science, Volume 45, Issue 1, pages 55-73, May 2004.
V. Lo, D. Zappala, C. GauthierDickey, and T. Singer, A Theoretical Framework for the Multicast Address Allocation Problem, Proceedings of Global Internet, at Globecom 2002. [19.7% (28/142)]
D. Zappala, C. GauthierDickey, V. Lo, Modeling the Multicast Address Allocation Problem, Proceedings of Global Internet, at Globecom 2002. [19.7% (28/142)]

Technical Reports

D. Zappala, C. GauthierDickey, V. Lo, Low-Latency and Cheat-proof Event Ordering for Distributed Games, Tech Report CIS-TR-2004-2, June 2004.

Paper reviews

ACM Siggraph, 2004
ACM NOSSDAV, 2005
ACM Sigcomm, 2006
IFIP Networking, 2006
ACM Transactions on Networking, 2006-2007 (2 papers)
Elsevier Computer Networks, 2006-2007 (2 papers)
ACM Transactions on Parallel and Distributed Systems, 2009