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=401
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Convergence of the diffusion method for weighted torus graphs using Fourier analysis
Gregory Karagiorgos
,
Nikolaos M. Missirlis
Theoretical Computer Science
401
(1-3), 2008, pp. 1-16
A relation between trinucleotide comma-free codes and trinucleotide circular codes
Christian J. Michel
,
Giuseppe Pirillo
,
Mario A. Pirillo
Theoretical Computer Science
401
(1-3), 2008, pp. 17-26
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions
Lane A. Hemaspaandra
,
Jörg Rothe
,
Amitabh Saxena
Theoretical Computer Science
401
(1-3), 2008, pp. 27-35
Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
David A. Cohen
,
Martin C. Cooper
,
Peter G. Jeavons
Theoretical Computer Science
401
(1-3), 2008, pp. 36-51
Optimizing deletion cost for secure multicast key management
Zhi-Zhong Chen
,
Ze Feng
,
Minming Li
,
Frances Yao
Theoretical Computer Science
401
(1-3), 2008, pp. 52-61
Complexity of unique list colorability
Dániel Marx
Theoretical Computer Science
401
(1-3), 2008, pp. 62-76
A near optimal scheduler for on-demand data broadcasts
Hing-Fung Ting
Theoretical Computer Science
401
(1-3), 2008, pp. 77-84
Online scheduling of equal-processing-time task systems
Yumei Huo
,
Joseph Y.-T. Leung
,
Xin Wang
Theoretical Computer Science
401
(1-3), 2008, pp. 85-95
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Janina Brenner
,
Guido Schäfer
Theoretical Computer Science
401
(1-3), 2008, pp. 96-106
Complexity and approximation for precedence constrained scheduling problems with large communication delays
Rodolphe Giroudeau
,
Jean-Claude Konig
,
Farida Kamila Moulai
,
Jérôme Palaysi
Theoretical Computer Science
401
(1-3), 2008, pp. 107-119
A randomized competitive algorithm for evaluating priced AND/OR trees
Eduardo Sany Laber
Theoretical Computer Science
401
(1-3), 2008, pp. 120-130
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
Victor Chepoi
,
Bertrand Estellon
,
Yann Vaxès
Theoretical Computer Science
401
(1-3), 2008, pp. 131-143
The complexity of uniform Nash equilibria and related regular subgraph problems
Vincenzo Bonifaci
,
Ugo Di Iorio
,
Luigi Laura
Theoretical Computer Science
401
(1-3), 2008, pp. 144-152
Seeing the trees and their branches in the network is hard
Iyad A. Kanj
,
Luay Nakhleh
,
Cuong Than
,
Ge Xia
Theoretical Computer Science
401
(1-3), 2008, pp. 153-164
How many runs can a string contain?
Simon J. Puglisi
,
Jamie Simpson
,
W.F. Smyth
Theoretical Computer Science
401
(1-3), 2008, pp. 165-171
Analysis of set-up time models: A metric perspective
Eitan Bachmat
,
Tao Kai Lam
,
Avner Magen
Theoretical Computer Science
401
(1-3), 2008, pp. 172-180
Embedding of meshes in Möbius cubes
Chang-Hsiung Tsai
Theoretical Computer Science
401
(1-3), 2008, pp. 181-190
Reversal complexity revisited
André Hernich
,
Nicole Schweikardt
Theoretical Computer Science
401
(1-3), 2008, pp. 191-205
On bases of identities for the
\omega
-variety generated by locally testable semigroups
José Carlos Costa
,
Conceição Nogueira
Theoretical Computer Science
401
(1-3), 2008, pp. 206-216
Solving difference equations whose coefficients are not transcendental
Manuel Kauers
Theoretical Computer Science
401
(1-3), 2008, pp. 217-227
The complexity of Tarski's fixed point theorem
Ching-Lueh Chang
,
Yuh-Dauh Lyuu
,
Yen-Wu Ti
Theoretical Computer Science
401
(1-3), 2008, pp. 228-235
Setting port numbers for fast graph exploration
David Ilcinkas
Theoretical Computer Science
401
(1-3), 2008, pp. 236-242
Schützenberger's theorem on formal power series follows from Kleene's theorem
Dietrich Kuske
Theoretical Computer Science
401
(1-3), 2008, pp. 243-248