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=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear speed-up theorem for cellular automata
J. Mazoyer
,
N. Reimen
Theoretical Computer Science
101
, 1992, pp. 59-98
A survey of space complexity
Pascal Michel
Theoretical Computer Science
101
, 1992, pp. 99-132
Formulas, regular languages and Boolean circuits
Pierre Péladeau
Theoretical Computer Science
101
, 1992, pp. 133-141
The functional dimension of inductive definitions
Michel de Rougemont
Theoretical Computer Science
101
, 1992, pp. 143-158
Traps characterize home states in free choice systems
Eike Best
,
Jörg Desel
,
Javier Esparza
Theoretical Computer Science
101
, 1992, pp. 161-176
Towards a theory of parallel algorithms on concrete data structures
Stephen Brookes
,
Shai Geva
Theoretical Computer Science
101
, 1992, pp. 177-221
Experimenting with process equivalence
Bard Bloom
,
Albert R. Meyer
Theoretical Computer Science
101
, 1992, pp. 223-237
From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
F.S. de Boer
,
J.N. Kok
,
C. Palamidessi
,
J.J.M.M. Rutten
Theoretical Computer Science
101
, 1992, pp. 239-263
Causal automata
Jeremy Gunawardena
Theoretical Computer Science
101
, 1992, pp. 265-288
A compositional axiomatization of Statecharts
J.J.M. Hooman
,
S. Ramesh
,
W.P. de Roever
Theoretical Computer Science
101
, 1992, pp. 289-335
Defining conditional independence using collapses
Shmuel Katz
,
Doron Peled
Theoretical Computer Science
101
, 1992, pp. 337-359
Multiplication, division, and shift instructions in parallel random access machines
Jerry L. Trahan
,
Michael C. Loui
,
Vijaya Ramachandran
Theoretical Computer Science
100
, 1992, pp. 1-44
Charaterizing complexity classes by higher type primitive recursive definitions
Andreas Goerdt
Theoretical Computer Science
100
, 1992, pp. 45-66
On noncounting regular classes
Aldo de Luca
,
Stefano Varricchio
Theoretical Computer Science
100
, 1992, pp. 67-104
Pinwheel scheduling with two distinct numbers
Robert Holte
,
Louis Rosier
,
Igor Tulchinsky
,
Donald Varvel
Theoretical Computer Science
100
, 1992, pp. 105-135
Effective subdirect decomposition: A case study
Daniel Benninger
,
Jürg Schmid
Theoretical Computer Science
100
, 1992, pp. 137-156
On the necessity of Occam algorithms
Raymond Board
,
Leonard Pitt
Theoretical Computer Science
100
, 1992, pp. 157-184
A distributed selection algorithm and its expected communication complexity
Nicola Santoro
,
Jeffrey B. Sidney
,
Stuart J. Sidney
Theoretical Computer Science
100
, 1992, pp. 185-204
Polynomial-time 1-Turing reductions from \#PH to \#P
Seinosuke Toda
,
Osamu Watanabe
Theoretical Computer Science
100
, 1992, pp. 205-221
Distributed loop network with minimum transmission delay
Paul Erdös
,
D. Frank Hsu
Theoretical Computer Science
100
, 1992, pp. 223-241
Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet
Helmut Prodinger
Theoretical Computer Science
100
, 1992, pp. 243-251
The complexity of computing symmetric functions using threshold circuits
Paul Beame
,
Erik Brisson
,
Richard Ladner
Theoretical Computer Science
100
, 1992, pp. 253-265
Final algebras, cosemicomputable algebras and degrees of unsolvability
Lawrence S. Moss
,
José Meseguer
,
Joseph A. Goguen
Theoretical Computer Science
100
, 1992, pp. 267-302
Intersection types for combinatory logic
Mariangiola Dezani-Ciancaglini
,
J. Roger Hindley
Theoretical Computer Science
100
, 1992, pp. 303-324
Foundations of a theory of synchronous systems
Miklós Bartha
Theoretical Computer Science
100
, 1992, pp. 325-346
Seiten
<
1
2
3
4
5
6
7
8
9
>