Abstract is missing.
- Space complexity of alternating Turing machinesMaris Alberts. 1-7
- A unifying theorem for algebraic semantics and dynamic logicsHajnal Andréka, Irène Guessarian, István Németi. 8-17
- On some non-uniform complexity measuresJosé L. Balcázar, Josep Díaz, Joaquim Gabarró. 18-27
- Fast parallel vertex colouringFrank Bauernöppel, Hermann Jung. 28-35
- Muller automata and bi-infinite wordsDanièle Beauquier. 36-43
- On formal languages, probabilities, paging and decoding algorithmsJoffroy Beauquier, Loÿs Thimonier. 44-52
- On the restriction of some NP-complete graph problems to permutation graphsAndreas Brandstädt, Dieter Kratsch. 53-62
- Fast parallel calculation of the rank of matrices over a field of arbitrary characteristicAlexander L. Chistov. 63-69
- Algorithms solving path systemsBogdan S. Chlebus. 70-79
- Decidability of confluence for ground term rewriting systemsMax Dauchet, Sophie Tison. 80-89
- Lower bounds on the complexity of 1-time only branching programsPaul E. Dunne. 90-99
- On coordinated rewritingAndrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg. 100-111
- Elements of a general theory of combinatorial structuresPhilippe Flajolet. 112-127
- A language theoretic approach to serialization problem in concurrent systemsMarie-Paule Flé, Gérard Roucairol. 128-145
- Logic programming and substitutionsGudmund Skovbjerg Frandsen. 146-158
- A lower bound on the oscillation complexity of context-free languagesThomas Gundermann. 159-166
- Depth efficient transformations of arithmetic into Boolean circuitsHermann Jung. 167-174
- Free cost measures of treesRainer Kemp. 175-190
- Discrete extremal problems on coveringA. D. Korshunov. 191-207
- Parallel algorithms for connected components in a graphVáclav Koubek, Jana Krsnakova. 208-217
- Statistical testing of finite sequences based on algorithmic complexityIvan Kramosil. 218-226
- Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version)Klaus Kriegel, Stephan Waack. 227-233
- Clustering to minimize the sum of volumes of convex hulls of clusters is NP-completeMirko Krivánek, Jaroslav Morávek. 234-241
- Linear comparison complexity of the n-cube membership problemMirko Krivánek, Jaroslav Morávek. 242-248
- String grammars with disconnectingKlaus-Jörn Lange, Emo Welzl. 249-256
- Array processing machinesJan van Leeuwen, Jirí Wiedermann. 257-268
- A fast heuristic for covering polygons by rectanglesChristos Levcopoulos. 269-278
- On the decidability of the theory of free groups (in Russian)G. S. Makanin. 279-284
- Products of group languagesStuart W. Margolis, Jean-Eric Pin. 285-299
- The complexity of embedding graphs into binary treesBurkhard Monien. 300-309
- On some topological properties of logic programsM. A. Nait Abdallah. 310-319
- Recent results on continuous ordered algebrasEvelyn Nelson. 320-330
- Are lower bounds on the complexity lower bounds for universal circuitsR. G. Nigmatullin. 331-340
- Probabilistic algorithms in group theoryJohn H. Reif. 341-350
- Recent results on codesChristophe Reutenauer. 351-360
- A multiparameter analysis of the boundedness problem for vector addition systemsLouis E. Rosier, Hsu-Chun Yen. 361-370
- About two-way transducersBrigitte Rozoy. 371-379
- Parallel time O(log n) recognition of unambiguous CFLsWojciech Rytter. 380-389
- On colour critical graphsHorst Sachs. 390-401
- Generalized Thue-Morse sequencesPatrice Séébold. 402-411
- Tree-partite graphs and the complexity of algorithmsDetlef Seese. 412-421
- A quadratic regularity test for non-deleting macro S grammarsHelmut Seidl. 422-430
- Continuous abstract data types: basic machinery and resultsAndrzej Tarlecki, Martin Wirsing. 431-441
- On the length of single dynamic tests for monotone Boolean functionsValery A. Vardanian. 442-449
- Enumerative combinatorics and algebraic languagesGérard Viennot. 450-464
- On several kinds of space-bounded on-line multicounter automataLutz Voelkel. 465-473
- Iterated linear control and iterated one-turn pushdownsHeiko Vogler. 474-483
- On the Boolean closure of NPGerd Wechsung. 485-493
- The critical complexity of all (monotone) Boolean functions and monotone graph propertiesIngo Wegener. 494-502
- Degeneration of Shimura surfaces and a problem in coding theoryTh. Zink. 503-511
- Quantifiers in combinatory PDL: completeness, definability, incompletenessSolomon Passy, Tinko Tinchev. 512-519
- Partial ordering derivations for CCSPierpaolo Degano, Rocco De Nicola, Ugo Montanari. 520-533
- Intersecting two polyhedra one of which is convexKurt Mehlhorn, Klaus Simon. 534-542