Volume 259,
Number 1-2,
28 May 2001
- Lothar M. Schmitt:
Theory of genetic algorithms.
1-61
- Paola Bonizzoni, Gianluca Della Vedova:
The complexity of multiple sequence alignment with SP-score that is a metric.
63-79
- Marek Chrobak, Christoph Dürr:
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms.
81-98
- Maurice Margenstern, Kenichi Morita:
NP problems are tractable in the space of cellular automata in the hyperbolic plane.
99-128
- Kojiro Kobayashi:
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths.
129-143
- Arturo Carpi, Aldo de Luca:
Words and special factors.
145-182
- Ines Klimann:
New types of automata to solve fixed point problems.
183-197
- Paul Trow:
Determining presentations of sofic shifts.
199-216
- Maria J. Serna, Fatos Xhafa:
On the parallel approximability of a subclass of quadratic programming.
217-231
- Chính T. Hoàng, R. Sritharan:
Finding houses and holes in graphs.
233-244
- Marie-Andrée Jacob-Da Col:
Applications quasi-affines et pavages du plan discret.
245-269
- Jean-Christophe Dubacq, Bruno Durand, Enrico Formenti:
Kolmogorov complexity and cellular automata classification.
271-285
- Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Dynamic algorithms for classes of constraint satisfaction problems.
287-305
- Andreas Goerdt:
The giant component threshold for random regular graphs with edge faults H. Prodinger.
307-321
- Dawei Hong, Jean-Camille Birget:
Approximation of some NP-hard optimization problems by finite machines, in probability.
323-339
- Paola Bonizzoni, Ross M. McConnell:
Nesting of prime substructures in k-ary relations.
341-357
- Gianluca De Marco, Luisa Gargano, Ugo Vaccaro:
Concurrent multicast in weighted networks.
359-377
- André Barbé, Guentcho Skordev:
Decimation-invariant sequences and their automaticity.
379-403
- Henning Fernau, Markus Holzer, Rudolf Freund:
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization.
405-426
- Susanne Kaufmann, Frank Stephan:
Robust learning with infinite additional information.
427-454
- John Case, Keh-Jiann Chen, Sanjay Jain:
Costs of general purpose learning.
455-473
- Jianliang Xu, Tsunehiro Yoshinaga, Katsushi Inoue, Yue Wang, Akira Ito:
Alternation for sublogarithmic space-bounded alternating pushdown automata.
475-492
- Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro:
Efficient algorithms for chemical threshold testing problems.
493-511
- Guo-Hui Lin, Guoliang Xue:
Signed genome rearrangement by reversals and transpositions: models and approximations.
513-531
- Stephen L. Bloom, Christian Choffrut:
Long words: the theory of concatenation and omega-power.
533-548
- David Guijarro, Víctor Lavín, Vijay Raghavan:
Monotone term decision lists.
549-575
- Mikel Aldaz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo:
A new method to obtain lower bounds for polynomial evaluation.
577-596
- Vikraman Arvind, Jacobo Torán:
A nonadaptive NC checker for permutation group intersection.
597-611
- Dima Grigoriev:
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity.
613-622
- Peter Kirrinnis:
Fast algorithms for the Sylvester equation AX-XBT=C.
623-638
- Gerald A. Heuer:
Three-part partition games on rectangles.
639-661
- Jiri Sgall:
Solution of David Gale's lion and man problem.
663-670
- Anton Stiglic:
Computations with a deck of cards.
671-678
- Amparo Fúster-Sabater, L. Javier García-Villalba:
An efficient algorithm to generate binary sequences for cryptographic purposes.
679-688
- Juha Honkala, Arto Salomaa:
Watson-Crick D0L systems with regular triggers.
689-698
Last update Tue Feb 14 04:22:57 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
