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=326
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds and the hardness of counting properties
Lane A. Hemaspaandra
,
Mayur Thakur
Theoretical Computer Science
326
(1-3), 2004, pp. 1-28
On maximal instances for the original syntenic distance
Cedric Chauve
,
Guillaume Fertin
Theoretical Computer Science
326
(1-3), 2004, pp. 29-43
Small Turing machines and generalized busy beaver competition
Pascal Michel
Theoretical Computer Science
326
(1-3), 2004, pp. 45-56
On the complexity of fixed parameter clique and dominating set
Friedrich Eisenbrand
,
Fabrizio Grandoni
Theoretical Computer Science
326
(1-3), 2004, pp. 57-67
Limiting distributions for additive functionals on Catalan trees
James Allen Fill
,
Nevin Kapur
Theoretical Computer Science
326
(1-3), 2004, pp. 69-102
Characterization of networks supporting multi-dimensional linear interval routing schemes
Yashar Ganjali
,
MohammadTaghi Hajiaghayi
Theoretical Computer Science
326
(1-3), 2004, pp. 103-116
Random generation of
2\times 2\times \cdot \cdot \cdot \times 2\times J
contingency tables
Tomomi Matsui
,
Yasuko Matsui
,
Yoko Ono
Theoretical Computer Science
326
(1-3), 2004, pp. 117-135
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Hans-Joachim Böckenhauer
,
Dirk Bongartz
,
Juraj Hromkovic̑
,
Ralf Klasing
,
Guido Proietti
,
Sebastian Seibert
,
Walter Unger
Theoretical Computer Science
326
(1-3), 2004, pp. 137-153
Complexity of pairwise shortest path routing in the grid
Teofilo F. Gonzalez
,
David Serena
Theoretical Computer Science
326
(1-3), 2004, pp. 155-185
Computability in linear algebra
Martin Ziegler
,
Vasco Brattka
Theoretical Computer Science
326
(1-3), 2004, pp. 187-211
On average sequence complexity
Svante Janson
,
Stefano Lonardi
,
Wojciech Szpankowski
Theoretical Computer Science
326
(1-3), 2004, pp. 213-227
Linear-time computation of local periods
Jean-Pierre Duval
,
Roman Kolpakov
,
Gregory Kucherov
,
Thierry Lecroq
,
Arnaud Lefebvre
Theoretical Computer Science
326
(1-3), 2004, pp. 229-240
On representations of positive integers in the Fibonacci base
Marcia Edson
,
Luca Q. Zamboni
Theoretical Computer Science
326
(1-3), 2004, pp. 241-260
On distance constrained labeling of disk graphs
Jiȓí Fiala
,
Aleksei V. Fishkin
,
Fedor Fomin
Theoretical Computer Science
326
(1-3), 2004, pp. 261-292
Least-recently-used caching with dependent requests
Predrag R. Jelenković
,
Ana Radovanović
Theoretical Computer Science
326
(1-3), 2004, pp. 293-327
The Chilean highway problem
Marcos Kiwi
,
Alexander Russell
Theoretical Computer Science
326
(1-3), 2004, pp. 329-342
Optimal graph exploration without good maps
Anders Dessmark
,
Andrzej Pelc
Theoretical Computer Science
326
(1-3), 2004, pp. 343-362
Authenticated key agreement in dynamic peer groups
Xun Yi
Theoretical Computer Science
326
(1-3), 2004, pp. 363-382
The complexity of computing the MCD-estimator
Thorsten Bernholt
,
Paul Fischer
Theoretical Computer Science
326
(1-3), 2004, pp. 383-398
Performance evaluation for energy efficient topologic control in ad hoc wireless networks
Minming Li
,
Shawn L. Huang
,
Xiaoming Sun
,
Xiao Huang
Theoretical Computer Science
326
(1-3), 2004, pp. 399-408
Rotation sequences and edge-colouring of binary tree pairs
Alan Gibbons
,
Paul Sant
Theoretical Computer Science
326
(1-3), 2004, pp. 409-418
On the ultimate complexity of factorials
Qi Cheng
Theoretical Computer Science
326
(1-3), 2004, pp. 419-429
Cross-monotonic cost sharing methods for connected facility location games
Stefano Leonardi
,
Guido Schäfer
Theoretical Computer Science
326
(1-3), 2004, pp. 431-442