Volume 58, 1988
- Didier Arquès, Jean Françon, M. T. Guichet, P. Guichet:
Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach.
3-16
- Amir Averbuch, Zvi Galil, Shmuel Winograd:
Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial, Part I: The Algeabra G[u] / < Q(u)^l >, l > 1.
17-56
- Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem.
57-68
- Franz-Josef Brandenburg:
On the Intersection of Stacks and Queues.
69-80
- Christian Choffrut, Marcel Paul Schützenberger:
Counting with Rational Functions.
81-101
- Marcel Paul Schützenberger:
Counting with Rational Functions.
81-101
- Clelia de Felice:
Finite Biprefix Sets of Paths in a Graph.
103-128
- Juris Hartmanis, Lane A. Hemachandra:
Complexity Classes without Machines: On Complete Languages for UP.
129-142
- Peter Kirschenhofer, Helmut Prodinger:
Further Results on Digital Search Trees.
143-154
- Sarit Kraus, Daniel J. Lehmann:
Knowledge, Belief and Time.
155-174
- Klaus-Jörn Lange:
Decompositions of Nondeterministic Reductions.
175-181
- Björn Lisper:
Synthesis and Equivalence of Concurrent Systems.
183-199
- Yves Métivier:
On Recognizable Subsets of Free Partially Commutative Monoids.
201-208
- Burkhard Monien, Ivan Hal Sudborough:
Min Cut is NP-Complete for Edge Weighted Treees.
209-229
- Jean-Pierre Pécuchet:
Etude Syntaxique des Parties Reconnaissables de Mots Infinis.
231-248
- George M. Reed, A. W. Roscoe:
A Timed Model for Communicating Sequential Processes.
249-261
- Louis E. Rosier, Hsu-Chun Yen:
On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs.
263-324
- Klaus Simon:
An Improved Algorithm for Transitive Closure on Acyclic Digraphs.
325-346
- Colin Stirling:
A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language.
347-359
- Howard Straubing:
Semigroups and Languages of Dot-Depth Two.
361-378
- Peter J. Varman, Kshitij Doshi:
An Efficient Parallel Algorithm for Updating Minimum Spanning Trees.
379-397
Last update Sat May 18 20:56:53 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
