-
1
-
The complexity of manipulating hierarchically defined sets of rectangles
-
16
-
The transformational machine: Theme and variations
-
33
-
Probabilistic two-way machines
-
46
-
A survey of some recent results on computational complexity in weak theories of arithmetic
-
61
-
A survey on oracle techniques
-
78
-
Time and space bounded complexity classes and bandwidth constrained problems
-
94
-
Representations of graphs by means of products and their complexity
-
103
-
Parsing strategies: A concise survey
-
121
-
The art of dynamizing
-
132
-
Fast parallel computation of polynomials using few processors
-
140
-
Generalizations of Petri nets
-
156
-
Partial match retrieval in implicit data structures
-
162
-
A characterization of Floyd-provable programs
-
172
-
Semantics of CSP via translation into CCS
-
183
-
More about the "geography" of context-free languages
-
193
-
On the power of algebraic specifications
-
205
-
An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
-
216
-
On the complexity of word problems in certain Thue systems
-
224
-
On the transformation of derivation graphs to derivation trees
-
234
-
Pushdown automata with restricted use of storage symbols
-
242
-
Structured nets
-
252
-
Retraceability, repleteness and busy beaver sets
-
262
-
Combining T and level-N
-
271
-
On realization and implementation
-
281
-
Multiplicative complexity of a bilinear form over a commutative ring
-
287
-
Making dynamic logic first-order
-
296
-
Partial interpretations of program schemata
-
304
-
Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata
-
314
-
Another hierarchy defined by multihead finite automata
-
321
-
An extension of Rabin's complete proof concept
-
327
-
How to find invariants for coloured Petri nets
-
339
-
Relationships between probabilistic and deterministic tape complexity
-
347
-
Grammatical levels of the position restricted grammars
-
360
-
A general framework for comparing sequential and parallel rewriting
-
369
-
A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit
-
379
-
Codings of nonnegative integers
-
389
-
The maximum k-flow in a network
-
398
-
On the constructive description of graph languages accepted by finite automata
-
410
-
Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries
-
418
-
Maximum flow in planar networks
-
423
-
Probabilistic combinatorial optimization
-
433
-
Time-processor trade-offs for universal parallel computers
-
442
-
Negative results on the size of deterministic right parsers
-
452
-
Key-equivalence of functional dependency statements systems
-
463
-
On representation of dynamic algebras with reversion
-
473
-
A framework for studying grammars
-
483
-
On existence of complete predicate calculus in metamathematics without exponentiation
-
491
-
On structural similarity of context-free grammars
-
499
-
Axioms for the term-wise correctness of programs
-
508
-
Complexity and entropy
-
515
-
Axiomatic semantics of indirect addressing
-
524
-
Testing of join dependency preserving by a modified chase method
-
534
-
A starvation-free solution of the dining philosophers' problem by use of interaction systems
-
544
-
Admissible representations of effective cpo's
-
554
-
Preserving total order in constant expected time
-
563
-
Constructive category theory (No. 1)
-
578
-
Two pebbles don't suffice
