University of Leicester

informatics

Publications in Algorithms and Complexity 2001

  1. C. M. Campbell, E. F. Robertson, N. Ruskuc and R. M. Thomas. Automatic Semigroups. Theoretical Computer Science, 251, pp. 365-391.
  2. S. Dantchev and S. Riis, Tree Resolution proofs of the Weak Pigeon-Hole Principle. Proceedings of the 16th Annual Conference on Computational Complexity (CCC'01), IEEE Computer Society Press, pp. 69-75, 2001.
  3. S. Dantchev and S. Riis. Planar tautologies hard for Resolution. Proceedings of the 42nd IEEE symposium on Foundations of Computer Science (FOCS'01), pp. 220-229, 2001.
  4. M. Droste and D. Kuske. Recognizable languages in divisibility monoids. Mathematical Structures in Computer Science, 11 (2001), 743-770.
  5. M. Droste, D. Kuske, R. McKenzie and R. Pöschel. Complementary closed relational clones are not always Krasner clones. Algebra Universalis, 45 (2001), 155-160.
  6. R.L. Gault and I.A. Stewart, On a hierarchy involving transitive closure logic and existential second-order quantification, Logic Journal of the IGPL 9 (2001) 769-780.
  7. D. Kuske and J.K. Truss. Generic automorphisms of the universal partial order. Proceedings of the AMS 129 (2001), 1939-1948.
  8. D. Kuske. A model-theoretic proof of Büchi-type theorems and first-order logic for N-free pomsets. Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), Springer LNCS 2010, 443-454, 2001.
  9. D. Kuske. Divisibility monoids: presentation, word problem, and rational languages. Proceedings of the 13th International Symposium on Fundamentals of Computation Theory (FCT 2001), Springer LNCS 2138, 227-239, 2001.
  10. D. Kuske. Recognizable sets of N-free pomsets are monadically axiomatizable. Proceedings of the 5th International Conference on Developments in Language Theory (DLT 2001), Springer LNCS 2295, 206-216, 2001.
  11. A. Puricella and I.A. Stewart, A generic greedy algorithm, partially-ordered graphs and NP-completeness, Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), Springer LNCS 2204, pp 306-316, 2001
  12. 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.
  13. N. Rahman and R. Raman. Adapting radix sort to the memory hierarchy. ACM J. Experimental Algorithmics, 6 (2001), Article 7. Special issue devoted to selected papers from ALENEX 2000, A. V. Goldberg and B. M. E. Moret, eds.
  14. R. Raman, V. Raman and S. S. Rao. Succinct dynamic data structures. Proceedings 7th International Workshop on Algorithms and Data Structures (WADS 2001), Springer LNCS 2125, 426-437.
  15. I.A. Stewart, Program schemes, queues, the recursive spectrum and zero-one laws, Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON 2001), Springer LNCS 2108, 39-48, 2001.
  16. S. Yang and D. Wang. A new adaptive neural network and heuristics hybrid aproach for job-shop scheduling. Computers and Operations Research 28 (2001), 21-37.

Author: Rajeev Raman (r.raman at mcs.le.ac.uk), T: +44 (0)116 252 3894.
© University of Leicester February 2001. Last modified: 16th September 2004, 11:06:30.
Informatics Web Maintainer. This document has been approved by the Head of Department.