Volume 302, Number 1-3, 13 June 2003
- Gwénaël Richomme:
Conjugacy and episturmian morphisms.
1-34
- Peter Damaschke:
Nearly optimal strategies for special cases of on-line capital investment.
35-44
- Alois Panholzer:
Analysis of multiple quickselect variants.
45-91
- Zhe Dang:
Pushdown timed automata: a binary reachability characterization and safety verification.
93-121
- Jerzy Mycka:
mu -Recursion and infinite limits.
123-133
- Sándor Vágvölgyi:
Term rewriting restricted to ground terms.
135-165
- Srecko Brlek, A. Ladouceur:
A note on differentiable palindromes.
167-178
- Rocco De Nicola, Anna Labella:
Nondeterministic regular expressions as solutions of equational systems.
179-189
- Jingchao Chen:
Optimizing stable in-place merging.
191-210
- Wojciech Rytter:
Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
211-222
- Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park:
Generalizations of suffix arrays to multi-dimensional matrices.
223-238
- Klaus Jansen:
Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
239-256
- George Karakostas, Richard J. Lipton, Anastasios Viglas:
On the complexity of intersecting finite state automata and N L versus N P.
257-274
- Zhuhan Jiang, Olivier Y. de Vel, Bruce E. Litow:
Unification and extension of weighted finite automata applicable to image compression.
275-294
- Pál Dömösi, Chrystopher L. Nehaniv, John L. Rhodes:
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
295-317
- Aleksei V. Fishkin, Guochuan Zhang:
On maximizing the throughput of multiprocessor tasks.
319-335
- Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed broadcast in radio networks of unknown topology.
337-364
- Alexander Okhotin:
A recognition and parsing algorithm for arbitrary conjunctive grammars.
365-399
- Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park:
Generalizations of suffix arrays to multi-dimensional matrices.
401-416
- Nadia Creignou, Hervé Daudé:
Generalized satisfiability problems: minimal elements and phase transitions.
417-430
- Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
On the number of occurrences of a symbol in words of regular languages.
431-456
- Lane A. Hemaspaandra, Harald Hempel:
P-immune sets with holes lack self-reducibility properties.
457-466
- Till Tantau:
Query complexity of membership comparable sets.
467-474
- Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar:
Palindrome recognition using a multidimensional tape.
475-480
- Juha Honkala:
Decidability results for Watson-Crick D0L systems with nonregular triggers.
481-488
- Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito:
On polynomial-time approximation algorithms for the variable length scheduling problem.
489-495
Last update Sat May 18 20:57:03 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
