Publications in Algorithms and Complexity 1997
 A.A. ArratiaQuesada and I.A. Stewart, Generalized Hex and
logical characterizations of polynomial space, Information
Processing Letters 63 (1997) 147152
 Y.A. Ashir, I.A. Stewart and A. Ahmed, Communication
algorithms in kary ncube interconnection networks,
Information Processing Letters 61 (1997) 4348
 Y.A. Ashir and I.A. Stewart, On embedding cycles in kary
ncubes, Parallel Processing Letters 7 (1997)
4955
 Y.A. Ashir and I.A. Stewart, Embeddings of cycles, meshes and
tori in faulty kary ncubes, Proceedings of International
Conference on Parallel and Distributed Systems
(ICPADS'97), IEEE Computer Society Press (1997)
429435
 F. Bracho, M. Droste and D. Kuske.
Representation of computations of concurrent automata by dependence orders. Theoretical Computer Science 174 (1997), pp. 6796.
 M. Edjvet and R.M. Thomas, The groups (l, m  n, k),
Journal of Pure and Applied Algebra 114 (1997)
175208
 M. Kaufmann, R. Raman and J. Sibeyn.
Routing on a meshconnected array of processors with buses.
Algorithmica, 18 (1997), pp. 417444.
(ESA '93 special issue, T. Lengauer, ed.).
 V.Y. Shavrukov, Interpreting reflexive theories in finitely
many axioms, Fundamenta Mathematicae 152 (1997)
99116
 V.Y. Shavrukov, Undecidability in diagonalizable algebras,
Journal of Symbolic Logic 62 (1997) 79116
 V.Y. Shavrukov, Isomorphisms of diagonalizable algebras,
Theoria, 63 (1997), 210221.
 I.A. Stewart, Regular subgraphs in graphs and rooted graphs,
and definability in monadic secondorder logic, Mathematical
Logic Quarterly 43 (1997) 121
 I.A. Stewart, Logics with zeroone laws that are not
fragments of boundedvariable infinitary logic, Mathematical
Logic Quarterly 43 (1997) 158178
 I.A. Stewart, On locating cubic subgraphs in boundeddegree
connected bipartite graphs, Discrete Mathematics
163 (1997) 319324

