University of Leicester

informatics

Publication Preprints in Algorithms and Complexity

  1. D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman and S. S. Rao. Representing trees of higher degree. Technical Report 2001/46, Department of Maths and Computer Science, University of Leicester. Submitted.
  2. R. Raman, V. Raman and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. Technical Report 2002/16, Department of Mathematics and Computer Science, University of Leicester, 2002. Submitted to a special issue of J. Algorithms, D. Eppstein, ed., devoted to selected papers from SODA 2002.
  3. I. A. Stewart. The complexity of achievement and maintenance problems in agent-based systems. Technical Report 2002/13, Department of Mathematics and Computer Science, University of Leicester, 2002. Submitted.

Author: Naila Rahman (nyr1 at mcs.le.ac.uk), T: +44 (0)116 252 2593.
University of Leicester May 2003. Last modified: 16th September 2004, 11:06:21.
Informatics Web Maintainer. This document has been approved by the Head of Department.