default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 320
Volume 320, Number 1, 12 June 2004
- Grzegorz Rozenberg:
Preface. 1-2 - Joshua J. Arulanandham, Cristian Calude
, Michael J. Dinneen:
A fast natural algorithm for searching. 3-13 - Eli Biham, Gilles Brassard, Dan Kenigsberg, Tal Mor:
Quantum computing without entanglement. 15-33 - Anne Condon, Beth Davy, Baharak Rastegari, Shelly Zhao, Finbarr Tarrant:
Classifying RNA pseudoknotted structures. 35-50 - Mark Daley, Lila Kari, Ian McQuillan:
Families of languages defined by ciliate bio-operations. 51-69 - Michelangelo Diligenti, Marco Gori, Marco Maggini:
Neural computation, social networks, and topological spectra. 71-87 - Oscar H. Ibarra:
On the computational complexity of membrane systems. 89-109 - Vicente Ruiz de Angulo, Carme Torras:
Neural learning methods yielding functional invariance. 111-121 - Tobias Storch, Ingo Wegener:
Real royal road functions for constant population size. 123-134 - Adam Prügel-Bennett:
When a genetic algorithm outperforms hill-climbing. 135-153
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 - Gillian Z. Elston, Gretchen Ostheimer:
On groups whose word problem is solved by a~counter automaton. 175-185 - Christian Choffrut, Yael Haddad:
String-matching with OBDDs. 187-198 - Jinjiang 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 - André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon:
Bounding the firing synchronization problem on a ring. 213-228 - Olivier Powell:
A note on measuring in P. 229-246 - Martin Middendorf, David F. Manlove:
Combined super-/substring and super-/subsequence problems. 247-267 - 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 - Michael Domaratzki:
Deletion along trajectories. 293-313 - Arto Salomaa, Derick Wood, Sheng Yu:
On the state complexity of reversals of regular languages. 315-329 - Patrick Healy, Ago Kuusik:
Algorithms for multi-level graph planarity testing and layout. 331-344 - Simona Cocco, Rémi Monasson:
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances. 345-372 - Vilhelm Dahllöf, Peter Jonsson, Richard Beigel:
Algorithms for four variants of the exact satisfiability problem. 373-394 - Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot:
An algorithmic view of gene teams. 395-418 - Alexander Okhotin:
On the number of nonterminals in linear conjunctive grammars. 419-448 - Asa Ben-Hur, Alexander Roitershtein, Hava T. Siegelmann:
On probabilistic analog automata. 449-464 - Markus Hunziker, António Machiavelo, Jihun Park:
Chebyshev polynomials over finite fields and reversibility of -automata on square grids. 465-483 - Liying Kang, Moo Young Sohn, T. C. Edwin Cheng:
Paired-domination in inflated graphs. 485-494 - John M. Hitchcock:
The size of SPP. 495-503
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-23 00:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
