-
1
-
On range searching with semialgebraic sets
-
14
-
Graph layout problems
-
24
-
Parallel recognition and ranking of context-free languages
-
37
-
On the expansion of combinatorial polytopes
-
50
-
Neural networks and complexity theory
-
62
-
Theory of computation over stream algebras, and its applications
-
81
-
Methods in parallel algorithmcs
-
82
-
On the complexity of small description and related topics
-
95
-
Weak parallel machines: A new class of physically feasible parallel machine models
-
112
-
The complexity of graph connectivity
-
133
-
A perfect parallel dictionary
-
142
-
Some remarks on the test complexity of iterative logic arrays
-
153
-
The degree structure of 1-L reductions
-
162
-
Promise problems and access to unambiguous computation
-
172
-
On the complexity of incremental computation
-
181
-
Rational transductions and complexity of counting problems
-
191
-
Negation elimination in equational formulae
-
200
-
Object interaction
-
209
-
Strong normalization of substitutions
-
218
-
Probabilistic and pluralistic learners with mind changes
-
227
-
Parallel complexity of iterated morphisms and the arithmetic of small numbers
-
236
-
On computational power of weighted finite automata
-
246
-
The shuffle exchange network has a Hamiltonian path
-
255
-
Poset properties of complex traces
-
264
-
A threshold for unsatisfiability
-
275
-
Dataflow semantics for Petri nets
-
284
-
About boundedness for some datalog and DATALOG<Superscript>neg</Superscript> programs
-
298
-
Merging and sorting strings in parallel
-
307
-
Characterization of context-pree languages by erasing automata
-
315
-
Insertion and deletion of words: Determinism and reversibility
-
327
-
Small universal one-state linear operator algorithm
-
336
-
Mobility in the CC-paradigm
-
346
-
The emptiness problem for intersections of regular languages
-
355
-
On finite automata with limited nondeterminism (extended abstract)
-
364
-
Definitions and comparisons of local computations on graphs
-
374
-
Efficient unidimensional universal cellular automaton
-
383
-
Inferring a tree from walks
-
392
-
Almost every set in exponential time is P-bi-immune
-
401
-
A functorial semantics for observed concurrency
-
412
-
Modelling concurrency with semi-commutations
-
421
-
Decision problems for cellular automata and their semigroups
-
430
-
On the nature of events
-
442
-
New parallel algorithms for convex hull and triangulation in 3-dimensional space
-
451
-
Two simple characterizations of well-founded semantics
-
463
-
Fully abstract semantics for higher order communicating systems
-
472
-
Superposable Trellis Automata
-
483
-
Maintaining proximity in higher dimensional spaces
-
494
-
Characterizing regular languages with polynomial densities
-
504
-
A strategy for speeding-up the computation of characteristic sets
-
511
-
One-rule trace-rewriting systems and confluence
