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=156
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Applications quasi affines: Pavages par images réciproques
Philippe Nehlig
Theoretical Computer Science
156
(1-2), 1996, pp. 1-38
Binary search trees constructed from nondistinct keys with/without specified probabilities
Rainer Kemp
Theoretical Computer Science
156
(1-2), 1996, pp. 39-70
Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
Pál Gyenizse
,
Sándor Vágvölgyi
Theoretical Computer Science
156
(1-2), 1996, pp. 71-97
Geometric arguments yield better bounds for threshold circuits and distributed computing
Matthias Krause
Theoretical Computer Science
156
(1-2), 1996, pp. 99-117
Finite automata and ordinals
Nicolas Bedon
Theoretical Computer Science
156
(1-2), 1996, pp. 119-144
Stochastically costed tree automata: Turakainen's theorem
Olympia Louscou-Bozapalidou
Theoretical Computer Science
156
(1-2), 1996, pp. 145-158
Sur la topologie d'un plan arithmétique
Jean Françon
Theoretical Computer Science
156
(1-2), 1996, pp. 159-176
Static correctness of hierarchical procedures
Michael I. Schwartzbach
Theoretical Computer Science
156
(1-2), 1996, pp. 177-201
A general construction of hyperuniverses
Marco Forti
,
Furio Honsell
Theoretical Computer Science
156
(1-2), 1996, pp. 203-215
A unified constructive network model for problem-solving
Yoshikane Takahashi
Theoretical Computer Science
156
(1-2), 1996, pp. 217-261
New values in domineering
Yonghoan Kim
Theoretical Computer Science
156
(1-2), 1996, pp. 263-280
Language not recognizable in real time by one-way cellular automata
Véronique Terrier
Theoretical Computer Science
156
(1-2), 1996, pp. 281-287
An algebraic characterization of observational equivalence
André Arnold
,
Ilaria Castellani
Theoretical Computer Science
156
(1-2), 1996, pp. 289-299
On the ordering of sparse linear systems
Giovanni Manzini
Theoretical Computer Science
156
(1-2), 1996, pp. 301-313
New lower bounds on the cost of binary search trees
Roberto De Prisco
,
Alfredo De Santis
Theoretical Computer Science
156
(1-2), 1996, pp. 315-325