default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 58
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. Theor. Comput. Sci. 58: 81-101 (1988) - 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 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 A. Doshi:
An Efficient Parallel Algorithm for Updating Minimum Spanning Trees. 379-397
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-08 00:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
