Volume 359,
Numbers 1-3,
August 2006
Fundamental Studies
Contributions
- Yongcheng Wu, Klaus Weihrauch:
A computable version of the Daniell-Stone theorem on integration and linear functionals.
28-42
- József Balogh, Dhruv Mubayi, András Pluhár:
On the edge-bandwidth of graph products.
43-57
- Yves F. Verhoeven:
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem.
58-68
- Chiuyuan Chen, James K. Lan, Wen-Shiang Tang:
An efficient algorithm to find a double-loop network that realizes a given L-shape.
69-76
- Ferucio Laurentiu Tiplea, Aurora Tiplea:
Petri net reactive modules.
77-100
- Fredrick Arnold, Benjamin Steinberg:
Synchronizing groups and automata.
101-110
- Anton Leykin, Jan Verschelde, Ailing Zhao:
Newton's method with deflation for isolated singularities of polynomial systems.
111-122
- Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
Improved bounds and schemes for the declustering problem.
123-132
- Taizo Sadahiro:
Multiple points of tilings associated with Pisot numeration systems.
133-147
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
k-Spine, 1-bend planarity.
148-175
- Xiaoyang Gu:
A note on dimensions of polynomial size circuits.
176-187
- Frank Gurski, Egon Wanke:
Vertex disjoint paths on clique-width bounded graphs.
188-199
- Vijay K. Garg:
Algorithmic combinatorics based on slicing posets.
200-213
- Gabriele Fici, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Word assembly through minimal forbidden words.
214-230
- Peter M. Higgins, Christopher J. Saker:
Unavoidable sets.
231-238
- Christian Lavault, Guy Louchard:
Asymptotic analysis of a leader election algorithm.
239-254
- André Barbé, Fritz von Haeseler:
Averages of automatic sequences.
255-281
- Anders Björner, Bruce E. Sagan:
Rationality of the Möbius function of a composition poset.
282-298
- Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao:
Power domination in block graphs.
299-305
- Carl S. McTague, James P. Crutchfield:
Automated pattern detection - An algorithm for constructing optimally synchronizing multi-regular language filters.
306-328
- Markus E. Nebel:
Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm.
329-343
- Sonia Pérez-Díaz, Juana Sendra, J. Rafael Sendra:
Distance bounds of epsilon-points on hypersurfaces.
344-368
- Bruno Escoffier, Vangelis Th. Paschos:
Completeness in approximation classes beyond APX.
369-377
- Pawel Górecki, Jerzy Tiuryn:
DLS-trees: A model of evolutionary scenarios.
378-399
- Pavlos Efraimidis, Paul G. Spirakis:
Approximation schemes for scheduling and covering on unrelated machines.
400-417
- Leah Epstein, Asaf Levin:
The conference call search problem in wireless networks.
418-429
- Wun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong:
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling.
430-439
- Boris Ryabko, Jaakko Astola, Alexander Gammerman:
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.
440-448
Notes
Copyright © Tue Nov 10 01:05:51 2009
by Michael Ley (ley@uni-trier.de)
