Volume 104, Number 1, September 2007
Asaf Levin:
The finite horizon investor problem with a budget constraint.
21-28
Volume 104, Number 2, October 2007
Igor Razgon:
A 2O(k)poly(n) algorithm for the parameterized Convex Recoloring problem.
53-58
Volume 104, Number 3, October 2007
Toru Araki:
On the k-tuple domination of de Bruijn and Kautz digraphs.
86-90
Mikolaj Bojanczyk:
A new algorithm for testing if a regular language is locally threshold testable.
91-94
Markus E. Nebel:
On the lexicographical generation of compressed codes.
95-100
Sylvain Duquesne:
Improving the arithmetic of elliptic curves in the Jacobi model.
101-105
Mariano Zelke:
Optimal per-edge processing times in the semi-streaming model.
106-112
Volume 104, Number 4, November 2007
Yuren Zhou,
Jun He:
Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids.
117-122
Volume 104, Number 5, November 2007
Petr Jancar,
Zdenek Sawa:
A note on emptiness for alternating finite automata with a one-letter alphabet.
164-167
Rahul Roy,
Amitava Bagchi:
On estimating the time taken to rectify faults in a software package during the system testing phase.
168-172
Hossein Ghodosi:
On insecurity of Naor-Pinkas' distributed oblivious transfer.
179-182
Volume 104, Number 6, December 2007
Xie-Bin Chen:
Cycles passing through prescribed edges in a hypercube with some faulty edges.
211-215
Klaus Meer:
Simulated Annealing versus Metropolis for a TSP instance.
216-219
data released under the ODC-BY 1.0 license
