default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 341
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 - Joe 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
- Zdenek Tronícek, Ayumi Shinohara:
The size of subsequence automaton. 379-384 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-28 23:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
