Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=131
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the relative merits of path dissolution and the method of analytic tableaux
Neil V. Murray
,
Erik Rosenthal
Theoretical Computer Science
131
(1), 1994, pp. 1-28
Term graph rewriting and garbage collection using opfibrations
R. Banach
Theoretical Computer Science
131
(1), 1994, pp. 29-94
Stratified least fixpoint logic
Kevin J. Compton
Theoretical Computer Science
131
(1), 1994, pp. 95-120
Realizability interpretation of generalized inductive definitions
Satoshi Kobayashi
,
Makoto Tatsuta
Theoretical Computer Science
131
(1), 1994, pp. 121-138
Program composition via unification
Limor Fix
,
Nissim Francez
,
Orna Grumberg
Theoretical Computer Science
131
(1), 1994, pp. 139-179
GSOS and finite labelled transition systems
Luca Aceto
Theoretical Computer Science
131
(1), 1994, pp. 181-195
A kind of logical compilation for knowledge bases
Philippe Mathieu
,
Jean-Paul Delahaye
Theoretical Computer Science
131
(1), 1994, pp. 197-218
A specification-oriented semantics for the refinement of real-time systems
David Scholefield
,
Hussein Zedan
,
He Jifeng
Theoretical Computer Science
131
(1), 1994, pp. 219-241
On the solvability of domino snake problems
Yael Etzion-Petruschka
,
David Harel
,
Dale Myers
Theoretical Computer Science
131
(2), 1994, pp. 243-269
A finiteness condition for rewriting systems
Craig C. Squier
,
Friedrich Otto
,
Yuji Kobayashi
Theoretical Computer Science
131
(2), 1994, pp. 271-294
Dynamic dictionary matching with failure functions
Ramana M. Idury
,
Alejandro A. Schäffer
Theoretical Computer Science
131
(2), 1994, pp. 295-310
Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
Ernst L. Leiss
Theoretical Computer Science
131
(2), 1994, pp. 311-330
Analog computation via neural networks
Hava T. Siegelmann
,
Eduardo D. Sontag
Theoretical Computer Science
131
(2), 1994, pp. 331-360
Drawing graphs in two layers
Peter Eades
,
Sue Whitesides
Theoretical Computer Science
131
(2), 1994, pp. 361-374
Join sizes, urn models and normal limiting distributions
Danièle Gardy
Theoretical Computer Science
131
(2), 1994, pp. 375-414
Randomization, derandomization and antirandomization: Three games
J. Spencer
Theoretical Computer Science
131
(2), 1994, pp. 415-429
Reachability is decidable in the numbers game
K. Eriksson
Theoretical Computer Science
131
(2), 1994, pp. 431-439
A note on the complexity of deciding bisimilarity of normed unary processes
Dung T. Huynh
,
Lu Tian
Theoretical Computer Science
131
(2), 1994, pp. 441-448
On the orbits of the product of two permutations
A. Bergey
,
R. Cori
Theoretical Computer Science
131
(2), 1994, pp. 449-461
Complexity of the hamiltonian cycle in regular graph problem
C. Picouleau
Theoretical Computer Science
131
(2), 1994, pp. 463-473
A matrix extension of Winograd's inner product algorithm
N. Anderson
,
D. Manley
Theoretical Computer Science
131
(2), 1994, pp. 475-477