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=359
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds for restricted read-once parity branching programs
Matthias Homeister
Theoretical Computer Science
359
(1-3), 2006, pp. 1-14
Maximal pattern complexity of two-dimensional words
Teturo Kamae
,
Hui Rao
,
Yu-Mei Xue
Theoretical Computer Science
359
(1-3), 2006, pp. 15-27
A computable version of the Daniell-Stone theorem on integration and linear functionals
Yongcheng Wu
,
Klaus Weihrauch
Theoretical Computer Science
359
(1-3), 2006, pp. 28-42
On the edge-bandwidth of graph products
József Balogh
,
Dhruv Mubayi
,
András Pluhár
Theoretical Computer Science
359
(1-3), 2006, pp. 43-57
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
Yves F. Verhoeven
Theoretical Computer Science
359
(1-3), 2006, pp. 58-68
An efficient algorithm to find a double-loop network that realizes a given L-shape
Chiuyuan Chen
,
James K. Lan
,
Wen-Shiang Tang
Theoretical Computer Science
359
(1-3), 2006, pp. 69-76
Petri net reactive modules
Ferucio Laurenţiu Ţiplea
,
Aurora Ţiplea
Theoretical Computer Science
359
(1-3), 2006, pp. 77-100
Synchronizing groups and automata
Fredrick Arnold
,
Benjamin Steinberg
Theoretical Computer Science
359
(1-3), 2006, pp. 101-110
Newton's method with deflation for isolated singularities of polynomial systems
Anton Leykin
,
Jan Verschelde
,
Ailing Zhao
Theoretical Computer Science
359
(1-3), 2006, pp. 111-122
Improved bounds and schemes for the declustering problem
Benjamin Doerr
,
Nils Hebbinghaus
,
Sören Werth
Theoretical Computer Science
359
(1-3), 2006, pp. 123-132
Multiple points of tilings associated with Pisot numeration systems
Taizo Sadahiro
Theoretical Computer Science
359
(1-3), 2006, pp. 133-147
k
-spine, 1-bend planarity
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Matthew Suderman
Theoretical Computer Science
359
(1-3), 2006, pp. 148-175
A note on dimensions of polynomial size circuits
Xiaoyang Gu
Theoretical Computer Science
359
(1-3), 2006, pp. 176-187
Vertex disjoint paths on clique-width bounded graphs
Frank Gurski
,
Egon Wanke
Theoretical Computer Science
359
(1-3), 2006, pp. 188-199
Algorithmic combinatorics based on slicing posets
Vijay K. Garg
Theoretical Computer Science
359
(1-3), 2006, pp. 200-213
Word assembly through minimal forbidden words
Gabriele Fici
,
Filippo Mignosi
,
Antonio Restivo
,
Marinella Sciortino
Theoretical Computer Science
359
(1-3), 2006, pp. 214-230
Unavoidable sets
Peter M. Higgins
,
Christopher J. Saker
Theoretical Computer Science
359
(1-3), 2006, pp. 231-238
Asymptotic analysis of a leader election algorithm
Christian Lavault
,
Guy Louchard
Theoretical Computer Science
359
(1-3), 2006, pp. 239-254
Averages of automatic sequences
A. Barbé
,
F. von Haeseler
Theoretical Computer Science
359
(1-3), 2006, pp. 255-281
Rationality of the Möbius function of a composition poset
Anders Björner
,
Bruce E. Sagan
Theoretical Computer Science
359
(1-3), 2006, pp. 282-298
Power domination in block graphs
Guangjun Xu
,
Liying Kang
,
Erfang Shan
,
Min Zhao
Theoretical Computer Science
359
(1-3), 2006, pp. 299-305
Automated pattern detection - An algorithm for constructing optimally synchronizing multi-regular language filters
Carl S. McTague
,
James P. Crutchfield
Theoretical Computer Science
359
(1-3), 2006, pp. 306-328
Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm
Markus E. Nebel
Theoretical Computer Science
359
(1-3), 2006, pp. 329-343
Distance bounds of
\epsilon
-points on hypersurfaces
Sonia Pérez-Díaz
,
Juana Sendra
,
J. Rafael Sendra
Theoretical Computer Science
359
(1-3), 2006, pp. 344-368
Completeness in approximation classes beyond APX
Bruno Escoffier
,
Vangelis Th. Paschos
Theoretical Computer Science
359
(1-3), 2006, pp. 369-377
Seiten 1
2
>