default search action
Theoretical Computer Science, Volume 306
Volume 306, Number 1-3, 5 September 2003
- G. E. Farr:
The Go polynomials of a graph. 1-18 - Mark Daley, Oscar H. Ibarra, Lila Kari:
Closure and decidability properties of some language classes with respect to ciliate bio-operations. 19-38 - Dietmar Wätjen:
Function-dependent teams in eco-grammar systems. 39-53 - Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee:
The full Steiner tree problem. 55-67 - József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz:
Private computation using a PEZ dispenser. 69-84 - Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc:
Regular closed sets of permutations. 85-100 - Petr Sosík
:
Watson-Crick D0L systems: generative power and undecidable problems. 101-112 - Stefan Andrei, Salvador Valerio Cavadini, Wei-Ngan Chin:
A new algorithm for regularizing one-letter context-free grammars. 113-122 - Liang Zhang, Kar-Ping Shum, Shou-Li Peng:
Completion of codes with finite bi-decoding delays. 123-137 - Tetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa:
Non-cryptographic primitive for pseudorandom permutation. 139-154 - Nissim Francez, Michael Kaminski:
An algebraic characterization of deterministic regular languages over infinite alphabets. 155-175 - Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn:
Almost complete sets. 177-194 - Leonid A. Bunimovich, Dmitry M. Kreslavskiy:
Lorentz gas cellular automata on graphs. 195-221 - Annalisa De Bonis, Ugo Vaccaro:
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. 223-243 - Laurent Rosaz:
The word problem for 1LC congruences is NP-hard. 245-268 - Alexis Bienvenüe
Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties. 269-289 - Sylvain Gravier, Mehdi Mhalla, Eric Tannier:
On a modular domination game. 291-303 - Leah Epstein, Csanád Imreh, Rob van Stee:
More on weighted servers or FIFO is better than LRU. 305-317 - Eric Angel, Evripidis Bampis
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. 319-338 - Ruy Luiz Milidiú, Artur Alves Pessoa
The complexity of makespan minimization for pipeline transportation. 339-351 - Jirí Síma, Pekka Orponen
Exponential transients in continuous-time Liapunov systems. 353-372 - Lucian Ilie
Reducing NFAs by invariant equivalences. 373-390 - Vânia M. Félix Dias, Guilherme Dias da Fonseca
The stable marriage problem with restricted pairs. 391-405 - Patricia A. Evans, Andrew D. Smith
On the complexity of finding common approximate substrings. 407-430 - Magnús M. Halldórsson
Approximability results for stable marriage problems with ties. 431-447 - Alexander Meduna
Forbidding ET0L grammars. 449-469 - Serge Dulucq, Laurent Tichit:
RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm. 471-484 - Víctor Dalmau
Learnability of quantified formulas. 485-511 - René Ndoundam, Maurice Tchuenté:
Exponential transient length generated by a neuronal recurrence equation. 513-533 - Anna E. Frid:
Arithmetical complexity of symmetric D0L words. 535-542 - Klaus Jansen, Roberto Solis-Oba:
An asymptotic fully polynomial time approximation scheme for bin covering. 543-551
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 2024-12-26 00:54 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: