— Richard Geary B.Sc. (Leicester)
Postgraduate Student in Computer Science
G1 Informatics Building|
Department of Informatics,
University of Leicester,
T: +44 (0) 116 252 3904
E: rfg2 'at' mcs.le.ac.uk
- Algorithms and data structures
- Succinct data structures for representing trees
- Compact in-memory representation of XML
- XML compression
- Efficient XPath query algorithms
I am currently researching both static and dynamic succinct data structures to represent ordinal trees, and applying these techniques to the problem of efficiently representing XML documents in computer memory.
I am a member of the Algorithms and complexity group here in the Department of Computer Science.
My PhD supervisor is Professor Rajeev Raman.
- R. Geary, R. Raman and V. Raman.
- Succinct ordinal trees with level-ancestor queries. Proc. ACM:SIAM Symposium on Discrete Algorithms (SODA 2004).
- R. Geary, N. Rahman, R. Raman and V. Raman.
- A simple optimal representation for balanced parentheses. Proc. Combinatorial Pattern Matching, 15th Annual Symposium (CPM 2004).