University of Leicester


Publications in Algorithms and Complexity 1999

  1. A.A. Arratia-Quesada, S.R. Chauhan and I.A. Stewart, Hierarchies in classes of program schemes, Journal of Logic and Computation, 9 (1999) 915-957
  2. B. Borchert, D. Kuske and F. Stephan. Existentially first order definable languages and their relation to NP. Theoretical Informatics and Applications 33 (1999), 259-270.
  3. C. M. Campbell, E. F. Robertson, N. Ruskuc and R. M. Thomas, Groups, semigroups and finite presentations, in P. J. Cossey, C. F. Miller III, W. D. Neumann and M. D. Shapiro (editors), Geometric Group Theory Down Under - Proceedings of a Special Year in Geometric Group Theory, Canberra, Australia, 1996, Walter de Gruyter, 1999, pp. 55--69.
  4. S.R. Chauhan and I.A. Stewart, On the power of built-in relations in certain classes of program schemes, Information Processing Letters, 69 (1999) 77-82
  5. P. F. Dietz and R. Raman. Small-rank selection in parallel, with applications to heap construction. J. Algorithms, 30 (1999), pp. 33-51.
  6. M. Droste, D. Kuske and J.K. Truss. On homogeneous semilattices and their automorphism groups. Order 16 (1999), 31-56.
  7. M. Droste and D. Kuske. On recognizable languages in left divisibility monoids. Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Springer LNCS v. 1684 (1999), pp. 246-257.
  8. L. Hella, L. Libkin and J. Nurmonen, Notions of locality and their logical characterizations over finite models, Journal of Symbolic Logic 64 (1999), pp. 1751-1773.
  9. M. Korda and R. Raman. An experimental evaluation of hybrid data structures for predecessor searching. In Proc. 3rd Workshop on Algorithm Engineering, Springer-Verlag LNCS series 1668, pp. 214-228, 1999.
  10. D. Krizanc, F. Luccio and R. Raman. Dynamic interval routing on asynchronous rings. In Proc. the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, pp. 225-232, 1999.
  11. D. Kuske. Symmetries of the partial order of traces. Order 16 (1999), pp. 133-148.
  12. N. Rahman and R. Raman. An analysis of cache effects in distribution sorting algorithms. In Proc. 3rd Workshop on Algorithm Engineering, Springer-Verlag LNCS series LNCS 1668, pp.184-198, 1999.
  13. R Raman. Random sampling techniques in parallel algorithms. In Advances in Randomized Parallel Computing, Panos M. Pardalos and Sanguthevar Rajasekaran eds., Combinatorial Optimization Series v.5, Kluwer Academic, ISBN 0-7923-5714-0, 1999
  14. R. Raman and R. J. Simpson, eds. Combinatorial Algorithms: Proceedings, Tenth Australasian Workshop on Combinatorial Algorithms, Curtin University Press, ISBN 1-86342-802-X, 1999.
  15. I.A. Stewart, Program schemes, arrays, Lindström quantifiers and zero-one laws, Proceedings of 8th Annual Conference of the European Association for Computer Science Logic (ed. J. Flum and M. Rodriguez-Artalejo), Lecture Notes in Computer Science Vol. 1683, Springer-Verlag, Berlin (1999) 374-388: full version to appear in Theoretical Computer Science
  16. I.A. Stewart, A perspective on Lindström quantifiers and oracles, Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language and Information Workshop (ed. J. Väänänen), Lecture Notes in Computer Science Vol. 1754, Springer-Verlag, Berlin (1999) 51-71.
  17. I. A. Stewart and R. M. Thomas, Formal languages and the word problem for groups, in C. M. Campbell, E. F. Robertson, N. Ruskuc and G. C. Smith (editors), Groups St Andrews 1997 in Bath, Volume 2 London Mathematical Society Lecture Note Series 261, Cambridge University Press, 1999, pp. 689--700.
  18. S. Yang and D. Wang. Constraint satisfaction adaptive neural network and efficient heuristics for job-shop scheduling. Proceedings of the 14th World Congress of International Federation of Automatic Control , Beijing, P. R. China, July 1999, Vol. J, pp.175-180.

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