Theoretical Computer Science, Volume 341
Volume 341, Numbers 1-3, 5 September 2005
- Clemens Heuberger, Rajendra S. Katti, Helmut Prodinger, Xiaoyu Ruan: The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography. 55-72
- J. Sawada: Oracles for vertex elimination orderings. 73-90
- Péter Gács: Uniform test of algorithmic randomness over a general space. 91-137
- Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki: Some properties of one-pebble Turing machines with sublogarithmic space. 138-149
- Xiaochun Cheng, Dantong Ouyang, Yunfei Jiang, Chengqi Zhang: An improved model-based method to test circuit faults. 150-161
- Pieter Collins: Continuity and computability of reachable sets. 162-195
- Guido Schäfer, Naveen Sivadasan: Topology matters: Smoothed competitiveness of metrical task systems. 216-246
- Blanca Cases, Manuel Alfonseca Moreno: Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems. 247-262
- Giuseppe Pirillo: Inequalities characterizing standard Sturmian and episturmian words. 276-292
- Subhamoy Maitra, Kishan Chand Gupta, Ayineedi Venkateswarlu: Results on multiples of primitive polynomials and their products over GF(2). 311-343
- Zhe Dang, Oscar H. Ibarra, Jianwen Su: On composition and lookahead delegation of e-services modeled by automata, . 344-363
- Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii: A robust algorithm for bisecting a triconnected graph with two resource sets. 364-378
- Quincy Wu, Chin Lung Lu, Richard Chia-Tung Lee: The approximability of the weighted Hamiltonian path completion problem on a tree. 385-397
- Wei-Mei Chen: Probabilistic analysis of algorithms for the Dutch national flag problem. 398-410
- Ruo-Wei Hung, Maw-Shang Chang: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . 411-440
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team