Volume 341,
Numbers 1-3,
5 September 2005
- Karl Auinger, Benjamin Steinberg:
Constructing divisions into power groups.
1-21
- Eden Chlamtac, Uriel Feige:
Improved approximation of the minimum cover time.
22-38
- Yan-Cheng Chang, Chi-Jen Lu:
Oblivious polynomial evaluation and oblivious neural learning.
39-54
- 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
- Cheng-Nan Lai, Gen-Huey Chen:
Strong Rabin numbers of folded hypercubes.
196-215
- 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
- Maurice H. ter Beek, Carlos Martín-Vide, Victor Mitrana:
Synchronized shuffles.
263-275
- Giuseppe Pirillo:
Inequalities characterizing standard Sturmian and episturmian words.
276-292
- Valérie Berthé, Srecko Brlek, Philippe Choquette:
Smooth words over arbitrary alphabets.
293-310
- 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
Notes
Copyright © Fri Mar 12 17:33:12 2010
by Michael Ley (ley@uni-trier.de)
