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=58
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
D. Arques
,
J. Françon
,
M.T. Guichet
,
P. Guichet
Theoretical Computer Science
58
, 1988, pp. 3-16
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo A polynomial, part I: The algebra
G[u]/<Q(u)^l>, l>1
Amir Averbuch
,
Zvi Galil
,
Shmuel Winograd
Theoretical Computer Science
58
, 1988, pp. 17-56
A tradeoff between search and update time for the implicit dictionary problem
Allan Borodin
,
Faith E. Fich
,
Friedhelm Meyer auf der Heide
,
Eli Upfal
,
Avi Wigderson
Theoretical Computer Science
58
, 1988, pp. 57-68
On the intersection of stacks and queues
Franz J. Brandenburg
Theoretical Computer Science
58
, 1988, pp. 69-80
Counting with rational functions
C. Choffrut
,
M.P. Schutzenberger
Theoretical Computer Science
58
, 1988, pp. 81-101
Finite biprefix sets of paths in a graph
Clelia De Felice
Theoretical Computer Science
58
, 1988, pp. 103-128
Complexity classes without machines: On complete languages for UP
Juris Hartmanis
,
Lane A. Hemachandra
Theoretical Computer Science
58
, 1988, pp. 129-142
Further results on digital search trees
Peter Kirschenhofer
,
Helmut Prodinger
Theoretical Computer Science
58
, 1988, pp. 143-154
Knowledge, belief and time
Sarit Kraus
,
Daniel Lehmann
Theoretical Computer Science
58
, 1988, pp. 155-174
Decompositions of nondeterministic reductions
Klaus-Jörn Lange
Theoretical Computer Science
58
, 1988, pp. 175-181
Synthesis and equivalence of concurrent systems
Björn Lisper
Theoretical Computer Science
58
, 1988, pp. 183-199
On recognizable subsets of free partially commutative monoids
Y. Métivier
Theoretical Computer Science
58
, 1988, pp. 201-208
Min cut is
NP
-complete for edge weighted trees
B. Monien
,
I.H. Sudborough
Theoretical Computer Science
58
, 1988, pp. 209-229
Etude syntaxique des parties reconnaissables de mots infinis
Jean-Pierre Pecuchet
Theoretical Computer Science
58
, 1988, pp. 231-248
A timed model for communicating sequential processes
G.M. Reed
,
A.W. Roscoe
Theoretical Computer Science
58
, 1988, pp. 249-261
On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
Louis E. Rosier
,
Hsu-Chun Yen
Theoretical Computer Science
58
, 1988, pp. 263-324
An improved algorithm for transitive closure on acyclic digraphs
Klaus Simon
Theoretical Computer Science
58
, 1988, pp. 325-346
A generalization of Owicki-Gries's Hoare logic for a concurrent while language
Colin Stirling
Theoretical Computer Science
58
, 1988, pp. 347-359
Semigroups and languages of dot-depth two
Howard Straubing
Theoretical Computer Science
58
, 1988, pp. 361-378
An efficient parallel algorithm for updating minimum spanning trees
Peter Varman
,
Kshitij Doshi
Theoretical Computer Science
58
, 1988, pp. 379-397