University of Leicester

informatics

Publications in Algorithms and Complexity 1995

  1. A. Andersson, T. Hagerup, S. Nilsson and R. Raman. Sorting in linear time? In Proc. 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 427-436, 1995.
  2. F. Bracho, M. Droste and D. Kuske. Dependence orders for computations of concurrent automata In STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Springer LNCS v.900, pp. 467-478, 1995.
  3. C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Semigroup and group presentations, Bulletin of the London Mathematical Society 27 (1995) 46-50
  4. C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Rewriting a semigroup presentation, International Journal of Algebra and Computation 5 (1995) 81-103
  5. C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Reidemeister-Schreier type rewriting for semigroups, Semigroup Forum 51 (1995) 47-62
  6. C.M. Campbell, E.F. Robertson, N. Ruskuc, R.M. Thomas and Y. Unlu, On certain one-relator products of semigroups, Communications in Algebra 23 (1995) 5207-5219
  7. C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, On semigroups defined by Coxeter type presentations, Proceedings of the Royal Society of Edinburgh 125A (1995) 1063-1075
  8. C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Semigroup presentations and minimal ideals, Combinatorial and Geometric Group Theory (ed. A.J. Duncan, N.D. Gilbert and J. Howie), London Mathematical Society Lecture Note Series 204, Cambridge University Press, pp. 29-42, 1995
  9. P. F. Dietz, K. Mehlhorn, R. Raman and C. Uhrig. Lower bounds for set intersection queries. Algorithmica 14 (1995), pp. 154-168.
  10. M. Droste and D. Kuske. Automata with concurrency relations - a survey. In P. Gastin, A. Petit (editors), Workshop on algebraic and syntactic aspects of concurrency, LITP 95/48, pp. 119-140, 1995.
  11. M. Golin, R. Raman, C. Schwarz and M. Smid. Simple randomized algorithms for closest pair problems. Nordic Journal on Computing 2 (1995), pp. 3-27.
  12. J. Howie, V. Metaftsis and R.M. Thomas, Finite generalized triangle groups, Transactions of the American Mathematical Society 347 (1995) 3613-3623
  13. J. Howie, V. Metaftsis and R.M. Thomas, Triangle groups and their generalisations, Groups-Korea 1994 (ed. A.C. Kim and D.L. Johnson), Walter de Gruyter (1995) 135-147
  14. E.F. Robertson, R.M. Thomas and C.I. Wotherspoon, A class of inefficient groups with symmetric presentation, Groups-Korea 1994 (ed. A.C. Kim and D.L. Johnson), Walter de Gruyter (1995) 277-284
  15. R. Raman and U. Vishkin. A parallel algorithm for a database operation and a database operation for parallel algorithms. In Proc. 8th International Parallel Processing Symposium (IPPS), 1995.
  16. I.A. Stewart, Complete problems for monotone NP, Theoretical Computer Science 145 (1995) 147-157
  17. I.A. Stewart, Completeness for path-problems via logical reductions, Information and Computation 121 (1995) 123-134
  18. I.A. Stewart, Reachability in some classes of acyclic Petri nets, Fundamenta Informaticae 23 (1995) 91-100
  19. I.A. Stewart and B.C. Thompson, On the intersections of longest cycles in a graph, Experimental Mathematics 4 (1995) 41-48
  20. R.M. Thomas, Group presentations where the relators are proper powers, Groups '93-Galway/St Andrews, Volume 2 (ed. C.M. Campbell, T.C. Hurley, E.F. Robertson, S.J. Tobin and J.J. Ward), London Mathematical Society Lecture Notes 212, Cambridge University Press (1995) 549-560

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