University of Leicester

informatics

Selected Publications

    Edited Works and Book Chapters

  • R. Möhring and R. Raman, eds. Algorithmica, 42:3-4, pp. 199-334, 2005.
  • R. Raman. Data structures for sets (Chapter 33). In D. P. Mehta and S. Sahni, Handbook of Data Structures and Applications, CRC Press, 2004.
  • R. Möhring and R. Raman. Algorithms - ESA 2002, 10th Annual European Symposium on Algorithms, Proceedings, Springer LNCS 2461, 2002.
  • R. Raman and R. J. Simpson. Combinatorial Algorithms: Proceedings, Tenth Australasian Workshop on Combinatorial Algorithms, Curtin University Press, ISBN 1-86342-802-X, 1999.
  • R. Raman. Random sampling techniques in parallel algorithms. In Advances in Randomized Parallel Computing, Panos M. Pardalos, Sanguthevar Rajasekaran eds., Combinatorial Optimization Series v.5, Kluwer Academic, ISBN 0-7923-5714-0, 1999.
  • G. F. Italiano and R. Raman. Advanced topics in data structures. In Handbook of Algorithms, M. J. Atallah ed., CRC Press, ISBN 0-8493-2649-4, 1998.
  • Journals and Refereed Conference Papers

  • O. Delpratt, R. Raman and N. Rahman. Engineering Succinct DOM. In Proc. 11th Intl. Conf. Database Technology (EDBT 2008), ACM International Conference Proceedings Series, v.261, pp. 49-60, 2008. DOI: 10.1145/1353343.1353354.
  • T. Erlebach, M. Hoffmann, D. Krizanc, M. Mihalak and R. Raman. Computing Minimum Spanning Trees with Uncertainty. In Proc. 24th Symposium on Theoretical Aspects of CS (STACS 2008),pp. 277-288, 2008.
  • R. Raman and D. S. Wise. Converting to and from Dilated Integers IEEE Transactions on Computers, 57, pp. 567-573, 2008.
  • R. Raman, V. Raman and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 3 (2007), Article 43, 26pp.
  • R. F. Geary, R. Raman and V. Raman. Succinct ordinal trees with level-ancestor queries. ACM Transactions on Algorithms 2 (2006), pp. 510-534.
    • SODA '04 special issue, J. I. Munro and A. Lopez-Ortiz, eds.
    • Authors final version here.
  • R. F. Geary, N. Rahman, R. Raman and V. Raman. A simple optimal representation for balanced parentheses. Theoretical Computer Science 368 (2006), pp. 231-246.
  • D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman and S. S. Rao. Representing trees of higher degree. Algorithmica, 43 (2005), pp. 275-292.
  • R. Bruce, M. Hoffmann, D. Krizanc and R. Raman. Efficient update strategies for geometric computing with uncertainty. Theory of Computing Systems, 38 (2005), pp. 411-423.
  • Danny Krizanc, Flaminia L. Luccio, and Rajeev Raman. Compact routing schemes for Dynamic Ring Networks. Theory of Computing Systems, 37 (2004), pp. 585-607.
  • R. F. Geary, R. Raman and V. Raman. Succinct ordinal trees with level-ancestor queries. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA04), pp. 1-10, ACM Press, 2004.
  • R. Raman and S. Srinivasa Rao. Succinct dynamic dictionaries and trees. In Proceedings of the 30th International Colloquium on Automata; Languages and Computation (ICALP 2003), LNCS 2719, pp 345-356, 2003.
  • J. I. Munro, R. Raman, V. Raman and S. Srinivasa Rao. Succinct representations of permutations. In Proceedings of the 30th International Colloquium on Automata; Languages and Computation (ICALP 2003), LNCS 2719, pp 357-368, 2003.
  • M. Bender, R. Cole and R. Raman. Exponential structures for efficient cache-oblivious algorithms. In Proceedings of 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), Springer LNCS 2380, 195-207, 2002.
  • T. Hagerup and R. Raman. An efficient quasidictionary. In Proc. 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002). Springer LNCS 2368, 1-18, 2002.
    • This paper is the subject of an invited talk by Torben Hagerup.
  • R. Raman, V. Raman and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 233-242, 2002.Conference version here, Journal version (see below).
  • N. Rahman, R. Cole and R. Raman. Optimised Predecessor Data Structures for Internal Memory. In Proceedings of the 5th International Workshop on Algorithm Engineering (WAE 2001), Springer-Verlag LNCS series 2141, 2001, pp 67-78.
  • N. Rahman and R. Raman. Adapting radix sort to the memory hierarchy. ACM J. Experimental Algorithmics, 6 (2001), Article 7.
    • ALENEX 2000 special issue, A. V. Goldberg and B. M. E. Moret, eds.
  • N. Rahman and R. Raman. An analysis of cache effects in distribution sorting algorithms. ACM J. Experimental Algorithmics, 5 (2000), Article 15.
    • WAE '99 special issue, J. S. Vitter and C. D. Zaroliagis, eds.
  • N. Rahman and R. Raman. Analysing the cache behaviour of non-uniform distribution sorting algorithms. In Proc. 8th Annual European Symposium on Algorithms (ESA), Springer-Verlag LNCS series v. 1879, 2000, pp. 380-391.
  • P. F. Dietz and R. Raman. Small-rank selection in parallel, with applications to heap construction. J. Algorithms, 30 (1999), pp. 33-51.
  • A. Andersson, T. Hagerup, S. Nilsson and R. Raman. Sorting in linear time? J. Computer and Systems Sciences, 57 (1998), pp. 74-93.
    • Special issue devoted to selected papers from the 27th Annual ACM Symposium on Theory of Computing (STOC '95), H. N. Gabow, ed.
  • M. Golin, R. Raman, C. Schwarz and M. Smid. Randomized data structures for the dynamic closest-pair problem. SIAM J. Computing, 24 (1998), pp. 1036-1072. Preliminary version Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 301-310, 1993.
  • T. Crawford, C. S. Iliopoulos and R. Raman. String matching techniques for musical similarity and melodic recognition. Computers and Musicology, 11 (1998), pp. 72-100.
  • M. Kaufmann, R. Raman and J. Sibeyn. Routing on a mesh-connected array of processors with buses. Algorithmica, 18 (1997), pp. 417-444.
    • Special issue devoted to selected papers from the 1st Annual European Symposium on Algorithms (ESA '93), T. Lengauer, ed.
  • R. Raman. Priority queues: small, monotone and trans-dichotomous. In Proc. 4th Annual European Symposium on Algorithms (ESA), Springer-Verlag LNCS series v. 1136, pp. 121-137, 1996.
  • P. F. Dietz, K. Mehlhorn, R. Raman and C. Uhrig. Lower bounds for set intersection queries. Algorithmica 14 (1995), pp. 154-168. Preliminary version in Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 194-201, 1993.
  • R. Raman and U. Vishkin. Optimal randomized parallel algorithms for computing the row maxima of a totally monotone matrix. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 613-621, 1994.
  • S. Chaudhuri, T. Hagerup and R. Raman. Approximate and exact deterministic parallel selection. In Proc. 18th Conference on the Mathematical Foundations of Computer Science (MFCS), Springer-Verlag LNCS series v.711, pp. 352-361, 1993.
  • P. F. Dietz and R. Raman. Persistence, amortization and parallelization: On some combinatorial games and their applications. In Proc. Workshop on Algorithms and Data Structures (WADS), Springer-Verlag LNCS series v.709, pp. 289-301, 1993.
  • T. Hagerup and R. Raman. Fast deterministic approximate and exact sorting. In Proc. 5th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 346-355, 1993.
  • M. Golin, R. Raman, C. Schwarz and M. Smid. Randomized data structures for the dynamic closest-pair problem. In Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 301-310, 1993.
  • T. Hagerup and R. Raman. Waste makes haste: tight bounds for loose parallel sorting. In Proc. 33rd IEEE Conference on Foundations of Computer Science (FOCS), pp. 628-637, 1992.
  • P. F. Dietz and R. Raman. Persistence, amortization and randomization. In Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 77-87, 1991.
  • R. Raman. The power of Collision: randomized parallel algorithms for chaining and integer sorting. In Proc. 10th Annual FSTTCS Conference, Springer-Verlag LNCS series v.472, pp. 161-175, 1990.
  • Other Cited Publications

  • A simpler analysis of Algorithm 65 (Find). SIGACT News, 25(4) (1994), pp. 86-89.
  • R. Raman, Recent results on the single-source shortest paths problem, SIGACT News, 28(2) (1997), pp. 81-87.

Author: Rajeev Raman (r.raman@mcs.le.ac.uk), T: +44 (0)116 252 3894.
© University of Leicester 29th November 2000. Last modified: 18th October 2014, 14:44:49.
Informatics Web Maintainer. This document has been approved by the Head of Department.