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=341
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructing divisions into power groups
K. Auinger
,
B. Steinberg
Theoretical Computer Science
341
(1-3), 2005, pp. 1-21
Improved approximation of the minimum cover time
Eden Chlamtac
,
Uriel Feige
Theoretical Computer Science
341
(1-3), 2005, pp. 22-38
Oblivious polynomial evaluation and oblivious neural learning
Yan-Cheng Chang
,
Chi-Jen Lu
Theoretical Computer Science
341
(1-3), 2005, pp. 39-54
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
Clemens Heuberger
,
Rajendra Katti
,
Helmut Prodinger
,
Xiaoyu Ruan
Theoretical Computer Science
341
(1-3), 2005, pp. 55-72
Oracles for vertex elimination orderings
J. Sawada
Theoretical Computer Science
341
(1-3), 2005, pp. 73-90
Uniform test of algorithmic randomness over a general space
Peter Gács
Theoretical Computer Science
341
(1-3), 2005, pp. 91-137
Some properties of one-pebble Turing machines with sublogarithmic space
Atsuyuki Inoue
,
Akira Ito
,
Katsushi Inoue
,
Tokio Okazaki
Theoretical Computer Science
341
(1-3), 2005, pp. 138-149
An improved model-based method to test circuit faults
Xiaochun Cheng
,
Dantong Ouyang
,
Jiang Yunfei
,
Chengqi Zhang
Theoretical Computer Science
341
(1-3), 2005, pp. 150-161
Continuity and computability of reachable sets
Pieter Collins
Theoretical Computer Science
341
(1-3), 2005, pp. 162-195
Strong Rabin numbers of folded hypercubes
Cheng-Nan Lai
,
Gen-Huey Chen
Theoretical Computer Science
341
(1-3), 2005, pp. 196-215
Topology matters: Smoothed competitiveness of metrical task systems
Guido Schäfer
,
Naveen Sivadasan
Theoretical Computer Science
341
(1-3), 2005, pp. 216-246
Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems
Blanca Cases
,
Manuel Alfonseca
Theoretical Computer Science
341
(1-3), 2005, pp. 247-262
Synchronized shuffles
Maurice H. ter Beek
,
Carlos Martín-Vide
,
Victor Mitrana
Theoretical Computer Science
341
(1-3), 2005, pp. 263-275
Inequalities characterizing standard Sturmian and episturmian words
Giuseppe Pirillo
Theoretical Computer Science
341
(1-3), 2005, pp. 276-292
Smooth words over arbitrary alphabets
Valérie Berthé
,
Srec̑ko Brlek
,
Philippe Choquette
Theoretical Computer Science
341
(1-3), 2005, pp. 293-310
Results on multiples of primitive polynomials and their products over
GF(2)
Subhamoy Maitra
,
Kishan Chand Gupta
,
Ayineedi Venkateswarlu
Theoretical Computer Science
341
(1-3), 2005, pp. 311-343
On composition and lookahead delegation of e-services modeled by automata
Zhe Dang
,
Oscar H. Ibarra
,
Jianwen Su
Theoretical Computer Science
341
(1-3), 2005, pp. 344-363
A robust algorithm for bisecting a triconnected graph with two resource sets
Hiroshi Nagamochi
,
Kengo Iwata
,
Toshimasa Ishii
Theoretical Computer Science
341
(1-3), 2005, pp. 364-378
The size of subsequence automaton
Zdenȇk Troníc̑ek
,
Ayumi Shinohara
Theoretical Computer Science
341
(1-3), 2005, pp. 379-384
The approximability of the weighted Hamiltonian path completion problem on a tree
Quincy Wu
,
Chin Lung Lu
,
Richard Chia-Tung Lee
Theoretical Computer Science
341
(1-3), 2005, pp. 385-397
Probabilistic analysis of algorithms for the Dutch national flag problem
Wei-Mei Chen
Theoretical Computer Science
341
(1-3), 2005, pp. 398-410
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Ruo-Wei Hung
,
Maw-Shang Chang
Theoretical Computer Science
341
(1-3), 2005, pp. 411-440