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=99
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
Virgil-Emil Căzănescu
,
Gheorghe Ştefănescu
Theoretical Computer Science
99
, 1992, pp. 1-63
Completions of perpetual logic programs
James Hein
Theoretical Computer Science
99
, 1992, pp. 65-78
A structure to decide reachability in Petri nets
J.L. Lambert
Theoretical Computer Science
99
, 1992, pp. 79-104
Processes and formalisms for unbounded choice
Wim H. Hesselink
Theoretical Computer Science
99
, 1992, pp. 105-119
Strong fairness and ultra metrics
Lutz Priese
,
Doris Nolte
Theoretical Computer Science
99
, 1992, pp. 121-140
Monads and algebras in the semantics of partial data types
Philip S. Mulry
Theoretical Computer Science
99
, 1992, pp. 141-155
Nested annealing: A provable improvement to simulated annealing
Sanguthevar Rajasekaran
,
John H. Reif
Theoretical Computer Science
99
, 1992, pp. 157-176
Alphabetic tree relations
Symeon Bozapalidis
Theoretical Computer Science
99
, 1992, pp. 177-211
Constructing compact rectilinear planar layouts using canonical representation of planar graphs
J. Nummenmaa
Theoretical Computer Science
99
, 1992, pp. 213-230
On the rank of the subsets of a free monoid
Jean Néraud
Theoretical Computer Science
99
, 1992, pp. 231-241
On space-bounded synchronized alternating Turing machines
Oscar H. Ibarra
,
Nicholas Q. Trân
Theoretical Computer Science
99
, 1992, pp. 243-264
Efficient simplicity testing of automata
Shuhua Zhang
Theoretical Computer Science
99
, 1992, pp. 265-278
Logarithmic advice classes
José L. Balcázar
,
Uwe Schöning
Theoretical Computer Science
99
, 1992, pp. 279-290
On the decidability of the equivalence problem for partially commutative rational power series
Stefano Varricchio
Theoretical Computer Science
99
, 1992, pp. 291-299
A characterization of exponential-time languages by alternating context-free grammars
Oscar H. Ibarra
,
Tao Jiang
,
Hui Wang
Theoretical Computer Science
99
, 1992, pp. 301-313
Tseitin's formulas revisited
Jean-Denis Fouks
Theoretical Computer Science
99
, 1992, pp. 315-326
Puissances de mots et reconnaissabilité des points fixes d'une substitution
Brigitte Mossé
Theoretical Computer Science
99
, 1992, pp. 327-334
A parallel algorithm for minimum weighted colouring of triangulated graphs
Chinh T. Hoàng
Theoretical Computer Science
99
, 1992, pp. 335-344