University of Leicester

informatics

photo of Richard Geary

RESEARCH STUDENT — Richard Geary B.Sc. (Leicester)

Postgraduate Student in Computer Science
G1Informatics Building
Department of Informatics,
University of Leicester,
University Road,
Leicester,
LE1 7RH.

T: +44 (0) 116 252 3904
E: rfg2 'at' mcs.le.ac.uk

Research Interests

  • 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.

Papers

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).

Author: Richard Geary (rfg2 'at' mcs.le.ac.uk), T: +44 (0) 116 252 3904.
University of Leicester 22 November 2004. Last modified: 13th April 2005, 23:17:20.
Informatics Web Maintainer. Any opinions expressed on this page are those of the author.