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=154
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Guthrie's problem: New equivalences and rapid reductions
Artur Czumaj
,
Alan Gibbons
Theoretical Computer Science
154
(1), 1996, pp. 3-22
On ranomized versus deterministic computation
Marek Karpinski
,
Rutger Verbeek
Theoretical Computer Science
154
(1), 1996, pp. 23-39
A theory of even functionals and their algorithmic applications
Jerzy W. Jaromczyk
,
Grzegorz Świa̧tek
Theoretical Computer Science
154
(1), 1996, pp. 41-56
Products of finite state machines with full coverage
David M. Cohen
,
Michael L. Fredman
Theoretical Computer Science
154
(1), 1996, pp. 57-65
Logical definability on infinite traces
Werner Ebinger
,
Anca Muscholl
Theoretical Computer Science
154
(1), 1996, pp. 67-84
An algebraic characterization of frontier testable tree languages
Thomas Wilke
Theoretical Computer Science
154
(1), 1996, pp. 85-106
Deciding true concurrency equivalences on safe, finite nets
Lalita Jategaonkar
,
Albert R. Meyer
Theoretical Computer Science
154
(1), 1996, pp. 107-143
P,NP
,Co-
NP
and weak systems of arithmetic
Claude Sureson
Theoretical Computer Science
154
(2), 1996, pp. 145-163
Two linear time Union-Find strategies for image processing
Christophe Fiorio
,
Jens Gustedt
Theoretical Computer Science
154
(2), 1996, pp. 165-181
Pattern systems
Victor Mitrana
,
Gheorge Păn
,
Grzegorz Rozenberg
,
Arto Salomaa
Theoretical Computer Science
154
(2), 1996, pp. 183-201
Multiple matching of parameterized patterns
Ramana M. Idury
,
Alejandro A. Schäffer
Theoretical Computer Science
154
(2), 1996, pp. 203-224
Sorting strings and constructing digital search trees in parallel
Joseph F. Jájá
,
Kwan Woo Ryu
,
Uzi Vishkin
Theoretical Computer Science
154
(2), 1996, pp. 225-245
Characterization and complexity of uniformly nonprimitive labeled 2-structures
J. Engelfriet
,
T. Harju
,
A. Proskurowski
,
G. Rozenberg
Theoretical Computer Science
154
(2), 1996, pp. 247-282
On the information rate of secret sharing schemes
Carlo Blundo
,
Alfredo De Santis
,
Luisa Gargano
,
Ugo Vaccaro
Theoretical Computer Science
154
(2), 1996, pp. 283-306
Effective category and measure in abstract complexity theory
Cristian Calude
,
Marius Zimand
Theoretical Computer Science
154
(2), 1996, pp. 307-327
Confluence for graph transformations
N. Lafaye de Micheaux
,
C. Rambaud
Theoretical Computer Science
154
(2), 1996, pp. 329-348
\sigma
-game,
\sigma^+
-game and two-dimensional additive cellular automata
Rana Barua
,
S. Ramakrishnan
Theoretical Computer Science
154
(2), 1996, pp. 349-366
Optimal advice
Lane A. Hemaspaandra
,
Leen Torenvliet
Theoretical Computer Science
154
(2), 1996, pp. 367-377
A direct characterization of completion
S. Ramesh
,
Bommadevara N. Srinivas
Theoretical Computer Science
154
(2), 1996, pp. 379-385
On a combinatorial property of Sturmian words
J. Justin
,
G. Pirillo
Theoretical Computer Science
154
(2), 1996, pp. 387-394