Theoretical Computer Science, Volume 298

Number 298, Volume 1, 4 April 2003

• Akihiro Yamamoto:
  Hypothesis finding based on upward refinement of residue hypotheses. 5-19
  Electronic Edition (link) BibTeX
• Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura:
  Learning elementary formal systems with queries. 21-50
  Electronic Edition (link) BibTeX
• Steffen Lange, Gunter Grieser, Klaus P. Jantke:
  Advanced elementary formal systems. 51-70
  Electronic Edition (link) BibTeX
• Steffen Lange, Jochen Nessel:
  Decision lists over regular patterns. 71-87
  Electronic Edition (link) BibTeX
• Yasuhito Mukouchi, Masako Sato:
  Refutable language learning with a neighbor system. 89-110
  Electronic Edition (link) BibTeX
• Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann:
  On learning of functions refutably. 111-143
  Electronic Edition (link) BibTeX
• Wolfgang Merkle, Frank Stephan:
  Refuting learning revisited. 145-177
  Electronic Edition (link) BibTeX
• Takashi Yokomori:
  Polynomial-time identification of very simple grammars from positive data. 179-206
  Electronic Edition (link) BibTeX
• Seishi Okamoto, Nobuhiro Yugami:
  Effects of domain characteristics on instance-based learning algorithms. 207-233
  Electronic Edition (link) BibTeX
• Tatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano:
  Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model. 235-251
  Electronic Edition (link) BibTeX
• Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
  Collage system: a unifying framework for compressed pattern matching. 253-272
  Electronic Edition (link) BibTeX

Number 298, Volume 2, 8 April 2003

• Mariangiola Dezani-Ciancaglini, Paula Severi, Fer-Jan de Vries:
  Infinitary lambda calculus and discrimination of Berarducci trees. 275-302
  Electronic Edition (link) BibTeX
• Rodney G. Downey, Lance Fortnow:
  Uniformly hard languages. 303-315
  Electronic Edition (link) BibTeX
• Michael R. Fellows, Catherine McCartin:
  On the parametric complexity of schedules to minimize tardy tasks. 317-324
  Electronic Edition (link) BibTeX
• Bakhadyr Khoussainov:
  On algebraic and logical specifications of classes of regular languages. 325-346
  Electronic Edition (link) BibTeX
• Padmanabhan Krishnan:
  Automatic synthesis of a subclass of schedulers in timed systems. 347-363
  Electronic Edition (link) BibTeX
• Eric Martin, Arun Sharma, Frank Stephan:
  Learning power and language expressiveness. 365-383
  Electronic Edition (link) BibTeX

Number 298, Volume 3, 11 April 2003

• Martín Abadi, Bruno Blanchet:
  Secrecy types for asymmetric communication. 387-415
  Electronic Edition (link) BibTeX
• Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
  Equational theories of tropical semirings. 417-469
  Electronic Edition (link) BibTeX
• Michel Bidoit, Rolf Hennicker, Alexander Kurz:
  Observational logic, constructor-based logic, and their duality. 471-510
  Electronic Edition (link) BibTeX
• Mikolaj Bojanczyk:
  The finite graph problem for two-way alternating automata. 511-528
  Electronic Edition (link) BibTeX
• Nadia Busi, Gianluigi Zavattaro:
  Expired data collection in shared dataspaces. 529-556
  Electronic Edition (link) BibTeX
• Cristiano Calcagno, Peter W. O'Hearn, Richard Bornat:
  Program logic and equivalence in the presence of garbage collection. 557-581
  Electronic Edition (link) BibTeX
• Gerwin Klein, Tobias Nipkow:
  Verified bytecode verifiers. 583-626
  Electronic Edition (link) BibTeX