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=74
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Word problems over traces which are solvable in linear time
Volker Diekert
Theoretical Computer Science
74
, 1990, pp. 3-18
Successive approximation in parallel graph algorithms
Donald Fussell
,
Ramakrishna Thurimella
Theoretical Computer Science
74
, 1990, pp. 19-35
A first order logic for partial functions
Antonio Gavilanes-Franco
,
Francisca Lucio-Carrasco
Theoretical Computer Science
74
, 1990, pp. 37-69
Decidability of a temporal logic problem for Petri nets
Petr Janc̑ar
Theoretical Computer Science
74
, 1990, pp. 71-93
Dynamic planar point location with optimal qury time
Franco P. Preparata
,
Roberto Tamassia
Theoretical Computer Science
74
, 1990, pp. 95-114
If deterministic and nondeterministic space complexities are equal for
\log\log n
, then they are also equal for
\log n
Andrzej Szepietowski
Theoretical Computer Science
74
, 1990, pp. 115-119
Un modèle asynchrone pour les systèmes distribués
Paul Gastin
Theoretical Computer Science
74
, 1990, pp. 121-162
Automata represented by products of soliton automata
F. Gécseg
,
H. Jürgensen
Theoretical Computer Science
74
, 1990, pp. 163-181
Deterministic optimal and expedient move-to-rear list organizing strategies
B. John Oommen
,
E.R. Hansen
,
J.I. Munro
Theoretical Computer Science
74
, 1990, pp. 183-197
On priority in cosy
Felicja Okulicka
Theoretical Computer Science
74
, 1990, pp. 199-216
Robust machines accept easy sets
Juris Hartmanis
,
Lane A. Hemachandra
Theoretical Computer Science
74
, 1990, pp. 217-225
Completeness of resolution revisited
Marc Bezem
Theoretical Computer Science
74
, 1990, pp. 227-237
SnS
can be modally characterized
Hans Hüttel
Theoretical Computer Science
74
, 1990, pp. 239-248
An easy priority-free proof of a theorem of Friedberg
Martin Kummer
Theoretical Computer Science
74
, 1990, pp. 249-251
The parallel numerical method of mechanical theorem proving
Jingzhong Zhang
,
Lu Yang
,
Mike Deng
Theoretical Computer Science
74
, 1990, pp. 253-271
Algebraic simplification in computer algebra: An analysis of bottom-up algorithms
Rafael Casas
,
María-Inés Fernández-Camacho
,
Jean-Marc Steyaert
Theoretical Computer Science
74
, 1990, pp. 273-298
An efficient algorithm for edge coloring planar graphs with
\Delta
colors
Xin He
Theoretical Computer Science
74
, 1990, pp. 299-312
Lower bounds to the complexity of symmetric Boolean functions
L. Babai
,
P. Pudlák
,
V. Rödl
,
E. Szemeredi
Theoretical Computer Science
74
, 1990, pp. 313-323
Relations among mod-classes
Ulrich Hertrampf
Theoretical Computer Science
74
, 1990, pp. 325-328
A polynomial algorithm for solving systems of two linear diophantine equations
Jean-François Romeuf
Theoretical Computer Science
74
, 1990, pp. 329-340
Sur les codes zigzag et leur décidabilité
M. Anselmo
Theoretical Computer Science
74
, 1990, pp. 341-354
On the complexity of algorithms on recursive trees
Jerzy Szymański
Theoretical Computer Science
74
, 1990, pp. 355-361