Theoretical Computer Science
, Volume 91
Volume 91, Number 1, 1991
Aravind Srinivasan
,
C. Pandu Rangan
:
Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.
1-21
Peter Buneman
,
Achim Jung
,
Atsushi Ohori
:
Using Powerdomains to Generalize Relational Databases.
23-55
Karel Culik II
,
Simant Dube
:
An Efficient Solution of the Firing Mob Problem.
57-69
Mustapha Arfi
:
Opérations polynomiales et hiérarchies de concaténation.
71-84
Kosaburo Hashiguchi
:
Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height.
85-100
Efim B. Kinber
:
On Complete Sets of Samples for Generalized Regular Expressions.
101-117
David Moews
:
Sum of Games Born on Days 2 and 3.
119-128
Volume 91, Number 2, 1991
Peter Kearney
,
John Staples
:
An Extensional Fixed-Point Semantics for Nondeterministic Data Flow.
129-179
Peter M. W. Knijnenburg
,
Jan van Leeuwen
:
On Models for Propositional Dynamic Logic.
181-203
Walter Vogler
:
Executions: A New Partial-Order Semantics of Petri Nets.
205-238
Andrzej Tarlecki
,
Rod M. Burstall
,
Joseph A. Goguen
:
Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories.
239-264
Wenhui Zhang
:
Cut Elimination and Automatic Proof Procedures.
265-284
Brigitte Rozoy
,
P. S. Thiagarajan
:
Event Structures and Trace Monoids.
285-313
Last update Tue May 21 19:43:46 2013 CET by the
DBLP Team
—
Data released under the
ODC-BY 1.0 license
— See also our
legal information page