Volume 320,
Number 1,
12 June 2004
- Grzegorz Rozenberg:
Preface.
1-2
Electronic Edition (link) BibTeX
- Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen:
A fast natural algorithm for searching.
3-13
Electronic Edition (link) BibTeX
- Eli Biham, Gilles Brassard, Dan Kenigsberg, Tal Mor:
Quantum computing without entanglement.
15-33
Electronic Edition (link) BibTeX
- Anne Condon, Beth Davy, Baharak Rastegari, Shelly Zhao, Finbarr Tarrant:
Classifying RNA pseudoknotted structures.
35-50
Electronic Edition (link) BibTeX
- Michelangelo Diligenti, Marco Gori, Marco Maggini:
Neural computation, social networks, and topological spectra.
71-87
Electronic Edition (link) BibTeX
- Oscar H. Ibarra:
On the computational complexity of membrane systems.
89-109
Electronic Edition (link) BibTeX
- Vicente Ruiz de Angulo, Carme Torras:
Neural learning methods yielding functional invariance.
111-121
Electronic Edition (link) BibTeX
- Tobias Storch, Ingo Wegener:
Real royal road functions for constant population size.
123-134
Electronic Edition (link) BibTeX
- Adam Prügel-Bennett:
When a genetic algorithm outperforms hill-climbing.
135-153
Electronic Edition (link) BibTeX
Volume 320,
Number 2-3,
14 June 2004
- Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich:
New spectral lower bounds on the bisection width of graphs.
155-174
Electronic Edition (link) BibTeX
- Gillian Z. Elston, Gretchen Ostheimer:
On groups whose word problem is solved by a~counter automaton.
175-185
Electronic Edition (link) BibTeX
- Christian Choffrut, Y. Haddad:
String-matching with OBDDs.
187-198
Electronic Edition (link) BibTeX
- J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng:
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
199-212
Electronic Edition (link) BibTeX
- André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon:
Bounding the firing synchronization problem on a ring.
213-228
Electronic Edition (link) BibTeX
- Olivier Powell:
A note on measuring in P.
229-246
Electronic Edition (link) BibTeX
- Martin Middendorf, David Manlove:
Combined super-/substring and super-/subsequence problems.
247-267
Electronic Edition (link) BibTeX
- Carlo Blundo, Paolo D'Arco, Vanesa Daza, Carles Padró:
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures.
269-291
Electronic Edition (link) BibTeX
- Michael Domaratzki:
Deletion along trajectories.
293-313
Electronic Edition (link) BibTeX
- Arto Salomaa, Derick Wood, Sheng Yu:
On the state complexity of reversals of regular languages.
315-329
Electronic Edition (link) BibTeX
- Patrick Healy, Ago Kuusik:
Algorithms for multi-level graph planarity testing and layout.
331-344
Electronic Edition (link) BibTeX
- Simona Cocco, Rémi Monasson:
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances.
345-372
Electronic Edition (link) BibTeX
- Vilhelm Dahllöf, Peter Jonsson, Richard Beigel:
Algorithms for four variants of the exact satisfiability problem.
373-394
Electronic Edition (link) BibTeX
- Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot:
An algorithmic view of gene teams.
395-418
Electronic Edition (link) BibTeX
- Alexander Okhotin:
On the number of nonterminals in linear conjunctive grammars.
419-448
Electronic Edition (link) BibTeX
- Asa Ben-Hur, Alexander Roitershtein, Hava T. Siegelmann:
On probabilistic analog automata.
449-464
Electronic Edition (link) BibTeX
- Markus Hunziker, António Machiavelo, Jihun Park:
Chebyshev polynomials over finite fields and reversibility of -automata on square grids.
465-483
Electronic Edition (link) BibTeX
- Liying Kang, Moo Young Sohn, T. C. Edwin Cheng:
Paired-domination in inflated graphs.
485-494
Electronic Edition (link) BibTeX
- John M. Hitchcock:
The size of SPP.
495-503
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:24:56 2009
by Michael Ley (ley@uni-trier.de)
