University of Leicester

informatics

Publications in Algorithms and Complexity 1994

  1. C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Fibonacci semigroups, Journal of Pure and Applied Algebra 94 (1994) 49-57
  2. P. F. Dietz and R. Raman. A constant update time finger search tree. Information Processing Letters, 52 (1994), pp. 147-154.
  3. P. F. Dietz and R. Raman. Very fast optimal parallel algorithms for heap construction. In Proc. 6th IEEE Symposium on Parallel and Distributed Processing (SPDP), pp. 514-521, 1994.
  4. D. Kuske. Nondeterministic automata with concurrency relations and domains. In Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Proceedings, Springer LNCS v.787, pp. 202-217, 1994.
  5. 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.
  6. V.Y. Shavrukov, A smart child of Peano's, Notre Dame Journal of Formal Logic 35 (1994) 161-185
  7. I.A. Stewart, Monotonicity and the expressibility of NP operators, Mathematical Logic Quarterly 40 (1994) 132-140
  8. I.A. Stewart, Context-sensitive transitive closure operators, Annals of Pure and Applied Logic 66 (1994) 277-301
  9. I.A. Stewart, Logical descriptions of monotone NP problems, Journal of Logic and Computation 4 (1994) 337-357
  10. I.A. Stewart, Deciding whether a planar graph has a cubic subgraph is NP-complete, Discrete Mathematics 126 (1994) 349-357
  11. I.A. Stewart, Incorporating generalized quantifiers and the least fixed point operator, Proceedings of Computer Science Logic (ed. E. Boerger, Y. Gurevich and K. Meinke), Springer LNCS v.832, pp. 318-333, 1994.

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