GaHyun Park

According to our database, GaHyun Park authored at least 8 papers between 2000 and 2009.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of three.

2009

Profiles of Tries.

GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski

SIAM J. Comput., 2009

Multiple choice tries and distributed hash tables.

Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski

Random Struct. Algorithms, 2009

2008

Profile of Tries.

GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Analysis of Randomized Protocols for Conflict-Free Distributed Access.

Gopal Pandurangan, GaHyun Park

Algorithmica, 2007

2006

Profile of tries

GaHyun Park

PhD thesis, 2006

2005

Towards a complete characterization of tries.

GaHyun Park, Wojciech Szpankowski

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Brief announcement: analysis of a randomized contention-resolution protocol for distributed access.

Gopal Pandurangan, GaHyun Park

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2000

Network-Based Scientific Computing.

Elias N. Houstis, Ann Christine Catlin, Ganesh Balakrishnan, Nitesh Dhanjani, GaHyun Park, John R. Rice, Spyros Lalis, Manolis Stamatogiannakis, Catherine E. Houstis

Proceedings of the Architecture of Scientific Software, 2000