nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An improved model-based method to test circuit faults
|
Cheng, Xiaochun |
|
2005 |
341 |
1-3 |
p. 150-161 12 p. |
artikel |
2 |
A robust algorithm for bisecting a triconnected graph with two resource sets
|
Nagamochi, Hiroshi |
|
2005 |
341 |
1-3 |
p. 364-378 15 p. |
artikel |
3 |
Author index
|
|
|
2005 |
341 |
1-3 |
p. 441-442 2 p. |
artikel |
4 |
Constructing divisions into power groups
|
Auinger, K. |
|
2005 |
341 |
1-3 |
p. 1-21 21 p. |
artikel |
5 |
Continuity and computability of reachable sets
|
Collins, Pieter |
|
2005 |
341 |
1-3 |
p. 162-195 34 p. |
artikel |
6 |
Editorial board v-ix
|
|
|
2005 |
341 |
1-3 |
p. v-ix nvt p. |
artikel |
7 |
Improved approximation of the minimum cover time
|
Chlamtac, Eden |
|
2005 |
341 |
1-3 |
p. 22-38 17 p. |
artikel |
8 |
Inequalities characterizing standard Sturmian and episturmian words
|
Pirillo, Giuseppe |
|
2005 |
341 |
1-3 |
p. 276-292 17 p. |
artikel |
9 |
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
|
Hung, Ruo-Wei |
|
2005 |
341 |
1-3 |
p. 411-440 30 p. |
artikel |
10 |
Oblivious polynomial evaluation and oblivious neural learning
|
Chang, Yan-Cheng |
|
2005 |
341 |
1-3 |
p. 39-54 16 p. |
artikel |
11 |
On composition and lookahead delegation of e -services modeled by automata
|
Dang, Zhe |
|
2005 |
341 |
1-3 |
p. 344-363 20 p. |
artikel |
12 |
Oracles for vertex elimination orderings
|
Sawada, J. |
|
2005 |
341 |
1-3 |
p. 73-90 18 p. |
artikel |
13 |
Probabilistic analysis of algorithms for the Dutch national flag problem
|
Chen, Wei-Mei |
|
2005 |
341 |
1-3 |
p. 398-410 13 p. |
artikel |
14 |
Results on multiples of primitive polynomials and their products over GF(2)
|
Maitra, Subhamoy |
|
2005 |
341 |
1-3 |
p. 311-343 33 p. |
artikel |
15 |
Smooth words over arbitrary alphabets
|
Berthé, Valérie |
|
2005 |
341 |
1-3 |
p. 293-310 18 p. |
artikel |
16 |
Some properties of one-pebble Turing machines with sublogarithmic space
|
Inoue, Atsuyuki |
|
2005 |
341 |
1-3 |
p. 138-149 12 p. |
artikel |
17 |
Strong Rabin numbers of folded hypercubes
|
Lai, Cheng-Nan |
|
2005 |
341 |
1-3 |
p. 196-215 20 p. |
artikel |
18 |
Synchronized shuffles
|
ter Beek, Maurice H. |
|
2005 |
341 |
1-3 |
p. 263-275 13 p. |
artikel |
19 |
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
|
Heuberger, Clemens |
|
2005 |
341 |
1-3 |
p. 55-72 18 p. |
artikel |
20 |
The approximability of the weighted Hamiltonian path completion problem on a tree
|
Wu, Quincy |
|
2005 |
341 |
1-3 |
p. 385-397 13 p. |
artikel |
21 |
The size of subsequence automaton
|
Troníček, Zdeněk |
|
2005 |
341 |
1-3 |
p. 379-384 6 p. |
artikel |
22 |
Topology matters: Smoothed competitiveness of metrical task systems
|
Schäfer, Guido |
|
2005 |
341 |
1-3 |
p. 216-246 31 p. |
artikel |
23 |
Towards a proof of the decidability of the momentary stagnation of the growth function of D 0 L systems
|
Cases, Blanca |
|
2005 |
341 |
1-3 |
p. 247-262 16 p. |
artikel |
24 |
Uniform test of algorithmic randomness over a general space
|
Gács, Peter |
|
2005 |
341 |
1-3 |
p. 91-137 47 p. |
artikel |