University of Leicester

informatics

Publications in Algorithms and Complexity 2000

  1. C. M. Campbell, E. F. Robertson, N. Ruskuc and R. M. Thomas, Direct products of automatic semigroups, Journal of the Australian Mathematical Society 69A (2000), 19--24.
  2. M. Droste, P. Gastin and D. Kuske. Asynchronous cellular automata for pomsets. Theoretical Computer Science 247 (2000), pp. 1-38.
  3. M. Edjvet, G. Rosenberger, M. Stille and R. M. Thomas, On certain finite generalized tetrahedron groups, in M. D. Atkinson, N. D. Gilbert, J. Howie, S. A. Linton and E. F. Robertson (editors), Computational and Geometric Aspects of Modern Algebra London Mathematical Society Lecture Note Series 275, Cambridge University Press, pp. 54--65, 2000.
  4. L. Hella and J. Nurmonen, Vectorization hierarchies of some graph quantifiers, Archive for Mathematical Logic, vol. 39(3), pp. 183-207, 2000.
  5. S. Hölldobler and D. Kuske. The boundary between decidable and undecidable fragments of the fluent calculus. International Conference on Logic for Programming and Automated Reasoning 2000, Springer LNCS v.1955 (2000), 436-450.
  6. D. Kuske. Emptiness is decidable for asynchronous cellular machines. CONCUR 2000 - Concurrency Theory, 11th International Conference, Springer LNCS 1877, pp. 536-551, 2000.
  7. D. Kuske. Infinite series-parallel pomsets: logic and languages. Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Springer LNCS v.1853, pp. 648-662, 2000.
  8. D. Kuske, R. Morin. Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. CONCUR 2000 - Concurrency Theory, 11th International Conference, Springer LNCS 1877, pp. 426-441, 2000.
  9. J. Nurmonen, Counting modulo quantifiers on finite structures, Information and Computation, 160(2000), pp. 62-87.
  10. D. W. Parkes and R. M. Thomas, Syntactic monoids and word problems, Arabian J. Science Engineering 25 (2000), pp. 81 - 94.
  11. T. Radzik and S. Yang. Experimantal evaluation of algorithmic solutions for generalized network flow models. 17th International Symposium of Mathematical Programming , USA, August 2000.
  12. N. Rahman and R. Raman. Adapting radix sort to the memory hierarchy. In Proc. 2nd Workshop on Algorithm Engineering and Experiments (ALENEX 2000), 2000.
  13. N. Rahman and R. Raman. An analysis of cache effects in distribution sorting algorithms. ACM J. Experimental Algorithmics, 5 (2000), Article 15. Special issue devoted to selected papers from WAE '99, J. S. Vitter and C. D. Zaroliagi s, eds.
  14. N. Rahman and R. Raman. Analysing the cache behaviour of non-uniform distribution sorting algorithms. In Proc. 8th Annual European Symposium on Algorithms (ESA '00), Springer-Verlag LNCS v. 1879 (M. S. Paterson ed.), pp. 380--391, 2000.
  15. S. Yang and D. Wang. Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling. IEEE Trans. on Neural Networks, 11(2) (2000), pp. 474-486.

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