Publications in Algorithms and Complexity 1994
 C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas,
Fibonacci semigroups, Journal of Pure and Applied Algebra
94 (1994) 4957
 P. F. Dietz and R. Raman.
A constant update time finger search tree.
Information Processing Letters, 52 (1994), pp. 147154.
 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. 514521, 1994.
 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. 202217, 1994.
 R. Raman and U. Vishkin,
Optimal randomized parallel algorithms
for computing the row maxima of a totally monotone matrix.
In Proc. 5th ACMSIAM Symposium on Discrete Algorithms (SODA),
pp. 613621, 1994.
 V.Y. Shavrukov, A smart child of Peano's, Notre Dame
Journal of Formal Logic 35 (1994) 161185
 I.A. Stewart, Monotonicity and the expressibility of NP
operators, Mathematical Logic Quarterly 40 (1994)
132140
 I.A. Stewart, Contextsensitive transitive closure operators,
Annals of Pure and Applied Logic 66 (1994)
277301
 I.A. Stewart, Logical descriptions of monotone NP problems,
Journal of Logic and Computation 4 (1994)
337357
 I.A. Stewart, Deciding whether a planar graph has a cubic
subgraph is NPcomplete, Discrete Mathematics 126
(1994) 349357
 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. 318333, 1994.

