University of Leicester


Publications in Algorithms and Complexity 1998

  1. A. Andersson, T. Hagerup, S. Nilsson and R. Raman. Sorting in linear time? J. Computer and Systems Sciences 57 (1998), pp. 74-93. (STOC '95 special issue, H. N. Gabow, ed.)
  2. B. Borchert, D. Kuske and F. Stephan. Existentially first order definable languages and their relation to NP. Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Springer LNCS v. 1443, pp. 17-28, 1998.
  3. C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Presentations for semigroups - applications to ideals of semigroups, Journal of Pure and Applied Algebra, 124 (1998) 47-64
  4. 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.
  5. M. Droste and D. Kuske. Recognizable and logically definable languages of infinite computations in concurrent automata. International Journal of Foundations of Computer Science 9 (1998), pp. 295-313.
  6. 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.
  7. 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.
  8. D. Kuske. Asynchronous cellular and asynchronous automata for pomsets. CONCUR '98: Concurrency Theory, 9th International Conference Springer LNCS v. 1466, pp. 517-532, 1998.
  9. D. Kuske and R.M. Shortt. Topology for computations of concurrent automata. International Journal of Algebra and Computation 8 (1998), pp. 327-362.
  10. C. Lautemann, T. Schwentick and I.A. Stewart, Positive versions of polynomial time, Information and Computation, 147 (1998) 145-170
  11. N. Rahman and R. Raman. An experimental evaluation of word-level parallelism in sorting algorithms. In 2nd Workshop on Algorithm Engineering, WAE '98-Proceedings, K. Mehlhorn, ed., TR MPI-I-98-1-019, Max Planck Institute for Computer Science, ISSN 0946-011X, 1998, pp. 193-203.
  12. R. Raman. Algorithms beyond compare: exploiting word-level parallelism. In Combinatorial algorithms-9th Australasian Workshop on Combinatorial Algorithms (AWOCA '98), C. S. Iliopoulos ed., 1998, pp. 13-15. (Abstract of invited talk.)
  13. R. Raman. Random sampling techniques in parallel computation. In Parallel and Distributed Processing-Ten IPPS/SPDP Workshops Proceedings, J. Rolim (ed), Springer-Verlag LNCS series v.1388, pp. 351-360, 1998.
  14. N. Ruskuc and R.M. Thomas, Syntactic and Rees indices of subsemigroups, Journal of Algebra 205 (1998) 435-450
  15. K. Zhao, S. Yang and D. Wang. Genetic algorithm and neural network hybrid approach for job-shop scheduling. Proceedings of the IASTED International Conference on Applied Modelling and Simulation , Honolulu, Hawaii, USA, August 1998, pp.110-114.

© University of Leicester 15th December 2000. Last modified: 16th September 2004, 11:07:12.
Informatics Web Maintainer. This document has been approved by the Head of Department.