Theoretical Computer Science, Volume 302

Volume 302, Number 1-3, 13 June 2003

• Gwénaël Richomme:
  Conjugacy and episturmian morphisms. 1-34
  Electronic Edition (link) BibTeX
• Peter Damaschke:
  Nearly optimal strategies for special cases of on-line capital investment. 35-44
  Electronic Edition (link) BibTeX
• Alois Panholzer:
  Analysis of multiple quickselect variants. 45-91
  Electronic Edition (link) BibTeX
• Zhe Dang:
  Pushdown timed automata: a binary reachability characterization and safety verification. 93-121
  Electronic Edition (link) BibTeX
• Jerzy Mycka:
  mu -Recursion and infinite limits. 123-133
  Electronic Edition (link) BibTeX
• Sándor Vágvölgyi:
  Term rewriting restricted to ground terms. 135-165
  Electronic Edition (link) BibTeX
• Srecko Brlek, A. Ladouceur:
  A note on differentiable palindromes. 167-178
  Electronic Edition (link) BibTeX
• Rocco De Nicola, Anna Labella:
  Nondeterministic regular expressions as solutions of equational systems. 179-189
  Electronic Edition (link) BibTeX
• Jingchao Chen:
  Optimizing stable in-place merging. 191-210
  Electronic Edition (link) BibTeX
• Wojciech Rytter:
  Application of Lempel-Ziv factorization to the approximation of grammar-based compression. 211-222
  Electronic Edition (link) BibTeX
• Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park:
  Generalizations of suffix arrays to multi-dimensional matrices. 223-238
  Electronic Edition (link) BibTeX
• Klaus Jansen:
  Approximate strong separation with application in fractional graph coloring and preemptive scheduling. 239-256
  Electronic Edition (link) BibTeX
• George Karakostas, Richard J. Lipton, Anastasios Viglas:
  On the complexity of intersecting finite state automata and N L versus N P. 257-274
  Electronic Edition (link) BibTeX
• Zhuhan Jiang, Olivier Y. de Vel, Bruce E. Litow:
  Unification and extension of weighted finite automata applicable to image compression. 275-294
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Aleksei V. Fishkin, Guochuan Zhang:
  On maximizing the throughput of multiprocessor tasks. 319-335
  Electronic Edition (link) BibTeX
• Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
  Distributed broadcast in radio networks of unknown topology. 337-364
  Electronic Edition (link) BibTeX
• Alexander Okhotin:
  A recognition and parsing algorithm for arbitrary conjunctive grammars. 365-399
  Electronic Edition (link) BibTeX
• Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park:
  Generalizations of suffix arrays to multi-dimensional matrices. 401-416
  Electronic Edition (link) BibTeX
• Nadia Creignou, Hervé Daudé:
  Generalized satisfiability problems: minimal elements and phase transitions. 417-430
  Electronic Edition (link) BibTeX
• Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
  On the number of occurrences of a symbol in words of regular languages. 431-456
  Electronic Edition (link) BibTeX
• Lane A. Hemaspaandra, Harald Hempel:
  P-immune sets with holes lack self-reducibility properties. 457-466
  Electronic Edition (link) BibTeX
• Till Tantau:
  Query complexity of membership comparable sets. 467-474
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Juha Honkala:
  Decidability results for Watson-Crick D0L systems with nonregular triggers. 481-488
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX