Glenn Hurlbert

Arizona State University

Papers

1

Total Citations

42

H-Index

1

About

Glenn Hurlbert is a mathematician whose work bridges discrete mathematics, combinatorics, and theoretical computer science, with a particular focus on combinatorial designs and graph theory. He is best known for his seminal contributions to the de Bruijn Torus problem, a generalization of de Bruijn sequences to two dimensions, which has applications in coding theory, cryptography, and positional sensing. His 1993 paper, "On the de Bruijn Torus problem," with 42 citations, remains a foundational reference in the field, introducing novel constructions and existence proofs that have influenced subsequent research in combinatorial arrays. Hurlbert's broader impact extends to the study of graph pebbling, a model for resource allocation and network reliability, where his work on pebbling numbers and thresholds has provided key insights. His research is characterized by elegant combinatorial arguments and practical applications, earning him recognition as a leading figure in discrete mathematics. With a career spanning decades, Hurlbert has also contributed to mathematics education and mentorship, shaping the next generation of combinatorial researchers.

Research Focus

Key Achievements

1
H-Index
1
Papers
42
Total Citations
42
Avg Citations/Paper
🏆 Most Cited Paper
On the de Bruijn Torus problem
42 citations · 1993
📈 Most Prolific Year: 1993 (1 Papers)
🤝 Key Collaborators: 1
🏛 Institutions: Arizona State University

Top Papers

  1. 1
    On the de Bruijn Torus problem
    42 citations · 1993

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago