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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Depth of proofs, depth of cut-formulas and complexity of cut formulas
Wenhui Zhang
Theoretical Computer Science
129
(1), 1994, pp. 193-206
Clans and regions in 2-structures
A.H. Deutz
,
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
129
(2), 1994, pp. 207-262
Canonical positions for the factors in paperfolding sequences
Jean-Paul Allouche
,
Mireille Bousquet-Mélou
Theoretical Computer Science
129
(2), 1994, pp. 263-278
On the effects of noise and speed on computations
Bernard Delyon
,
Oded Maler
Theoretical Computer Science
129
(2), 1994, pp. 279-291
An efficient parallel algorithm for the single function coarsest partition problem
Joseph F. Jájá
,
Kwan Woo Ryu
Theoretical Computer Science
129
(2), 1994, pp. 293-307
One-way functions and the isomorphism conjecture
K. Ganesan
Theoretical Computer Science
129
(2), 1994, pp. 309-321
The complexity of optimizing finite-state transducers
Craig A. Rich
,
Giora Slutzki
Theoretical Computer Science
129
(2), 1994, pp. 323-336
The inference of tree languages from finite samples: An algebraic approach
Timo Knuutila
,
Magnus Steinby
Theoretical Computer Science
129
(2), 1994, pp. 337-367
Tiling and local rank properties of the Morse sequence
S. Ferenczi
Theoretical Computer Science
129
(2), 1994, pp. 369-383
Variations on a game of Gale (II): Markov strategies
Marion Scheepers
Theoretical Computer Science
129
(2), 1994, pp. 385-396
An algorithm for dynamic subset and intersection testing
D.M. Yellin
Theoretical Computer Science
129
(2), 1994, pp. 397-406
Exponentiation using canonical recoding
ömer Eg̑eciog̑lu
,
Çetin Kaya Koç
Theoretical Computer Science
129
(2), 1994, pp. 407-417
Nonerasing Turing machines: A frontier between a decidable halting problem and universality
M. Margenstern
Theoretical Computer Science
129
(2), 1994, pp. 419-424
Clock construction in fully asynchronous parallel systems and PRAM simulation
Yonatan Aumann
,
Michael O. Rabin
Theoretical Computer Science
128
(1-2), 1994, pp. 3-30
Methods for message routing in parallel machines
Tom Leighton
Theoretical Computer Science
128
(1-2), 1994, pp. 31-62
Tentative and definite distributed computations: An optimistic approach to network synchronization
J. Garofalakis
,
P. Spirakis
,
B. Tampakas
,
S. Rajsbaum
Theoretical Computer Science
128
(1-2), 1994, pp. 63-74
MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
Gilad Koren
,
Dennis Shasha
Theoretical Computer Science
128
(1-2), 1994, pp. 75-97
A compositional framework for fault tolerance by specification transformation
Doron Peled
,
Mathai Joseph
Theoretical Computer Science
128
(1-2), 1994, pp. 99-125
A trace-based compositional proof theory for fault tolerant distributed systems
Henk Schepers
,
Jozef Hooman
Theoretical Computer Science
128
(1-2), 1994, pp. 127-157
A semantic characterisation for faults in replicated systems
Padmanabhan Krishnan
Theoretical Computer Science
128
(1-2), 1994, pp. 159-177
Guarded repair of dependable systems
Hermann de Meer
,
Kishor S. Trivedi
,
Mario Dal Cin
Theoretical Computer Science
128
(1-2), 1994, pp. 179-210
Markov analysis of multiple-disk prefetching strategies for external merging
Vinay Sadananda Pai
,
Alejandro A. Schäffer
,
Peter J. Varman
Theoretical Computer Science
128
(1-2), 1994, pp. 211-239
Tolerating faults in a mesh with a row of spare nodes
Jehoshua Bruck
,
Robert Cypher
,
Ching-Tien Ho
Theoretical Computer Science
128
(1-2), 1994, pp. 241-252
A formal derivation of the decidability of the theory SA
C. Hosono
,
Y. Ikeda
Theoretical Computer Science
127
(1), 1994, pp. 1-23
Synchronized tree automata
Kai Salomaa
Theoretical Computer Science
127
(1), 1994, pp. 25-51
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>