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=233
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Systolic tree
\omega
-languages: The operational and the logical view
Angelo Monti
,
Adriano Peron
Theoretical Computer Science
233
(1-2), 2000, pp. 1-18
New upper bounds to the limitedness of distance automata
Kosaburo Hashiguchi
Theoretical Computer Science
233
(1-2), 2000, pp. 19-32
On the approximation of largest common subtrees and largest common point sets
Tatsuya Akutsu
,
Magnús M. Halldórsson
Theoretical Computer Science
233
(1-2), 2000, pp. 33-50
Undicidability of existential properties in picture languages
D. Robilliard
,
D. Simplot
Theoretical Computer Science
233
(1-2), 2000, pp. 51-74
Characterization of Glushkov automata
Pascal Caron
,
Djelloul Ziadi
Theoretical Computer Science
233
(1-2), 2000, pp. 75-90
On the computational complexity of determining polyatomic structures by X-rays
R.J. Gardner
,
P. Gritzmann
,
D. Prangenberg
Theoretical Computer Science
233
(1-2), 2000, pp. 91-106
On computing graph minor obstruction sets
Kevin Cattell
,
Michael J. Dinneen
,
Rodney G. Downey
,
Michael R. Fellows
,
Michael A. Langston
Theoretical Computer Science
233
(1-2), 2000, pp. 107-127
A small final coalgebra theorem
Yasuo Kawahara
,
Masao Mori
Theoretical Computer Science
233
(1-2), 2000, pp. 129-145
Ergodicity, transitivity, and regularity for linear cellular automata over
Z_m
Gianpiero Cattaneo
,
Enrico Formenti
,
Giovanni Manzini
,
Luciano Margara
Theoretical Computer Science
233
(1-2), 2000, pp. 147-164
Efficient collective communication in optical networks
Jean-Claude Bermond
,
Luisa Gargano
,
Stephan Perennes
,
Adele A. Rescigno
,
Ugo Vaccaro
Theoretical Computer Science
233
(1-2), 2000, pp. 165-189
A probabilistic algorithm for updating files over a communication link
Alexandre V. Evfimievski
Theoretical Computer Science
233
(1-2), 2000, pp. 191-199
Left ternary trees and non-separable rooted planar maps
Alberto Del Lungo
,
Francesco Del Ristoro
,
Jean-Guy Penaud
Theoretical Computer Science
233
(1-2), 2000, pp. 201-215
Langages rationnels définis avec une concaténation non-associative
Christian Germain
,
Jean Pallo
Theoretical Computer Science
233
(1-2), 2000, pp. 217-231
Star free expressions over the reals
Alexander Rabinovich
Theoretical Computer Science
233
(1-2), 2000, pp. 233-245
On the cost of recomputing: Tight bounds on pebbling with faults
Yonatan Aumann
,
Judit Bar-Ilan
,
Uriel Feige
Theoretical Computer Science
233
(1-2), 2000, pp. 247-261
Three-player impartial games
James Propp
Theoretical Computer Science
233
(1-2), 2000, pp. 263-278
On slender 0L languages
T.Y. Nishida
,
A. Salomaa
Theoretical Computer Science
233
(1-2), 2000, pp. 279-286
Source reversal and chip firing on graphs
Eric Goles
,
Erich Prisner
Theoretical Computer Science
233
(1-2), 2000, pp. 287-295
A sublinear parallel algorithm for stable matching
Tomás Feder
,
Nimrod Megiddo
,
Serge A. Plotkin
Theoretical Computer Science
233
(1-2), 2000, pp. 297-308
Zero testing of
p
-adic and modular polynomials
Marek Karpinski
,
Alf van der Poorten
,
Igor Shparlinski
Theoretical Computer Science
233
(1-2), 2000, pp. 309-317
An optimal deterministic algorithm for online
b
-matching
Bala Kalyanasundaram
,
Kirk R. Pruhs
Theoretical Computer Science
233
(1-2), 2000, pp. 319-325