default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 298
Volume 298, Number 1, 4 April 2003
- Akihiro Yamamoto:
Hypothesis finding based on upward refinement of residue hypotheses. 5-19 - Hiroshi Sakamoto, Kouichi Hirata
, Hiroki Arimura:
Learning elementary formal systems with queries. 21-50 - Steffen Lange, Gunter Grieser, Klaus P. Jantke:
Advanced elementary formal systems. 51-70 - Steffen Lange, Jochen Nessel:
Decision lists over regular patterns. 71-87 - Yasuhito Mukouchi, Masako Sato:
Refutable language learning with a neighbor system. 89-110 - Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas Zeugmann:
On learning of functions refutably. 111-143 - Wolfgang Merkle, Frank Stephan:
Refuting learning revisited. 145-177 - Takashi Yokomori:
Polynomial-time identification of very simple grammars from positive data. 179-206 - Seishi Okamoto, Nobuhiro Yugami:
Effects of domain characteristics on instance-based learning algorithms. 207-233 - 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 - Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Collage system: a unifying framework for compressed pattern matching. 253-272
Volume 298, Number 2, 8 April 2003
- Mariangiola Dezani-Ciancaglini, Paula Severi, Fer-Jan de Vries:
Infinitary lambda calculus and discrimination of Berarducci trees. 275-302 - Rodney G. Downey, Lance Fortnow:
Uniformly hard languages. 303-315 - Michael R. Fellows, Catherine McCartin:
On the parametric complexity of schedules to minimize tardy tasks. 317-324 - Bakhadyr Khoussainov:
On algebraic and logical specifications of classes of regular languages. 325-346 - Padmanabhan Krishnan:
Automatic synthesis of a subclass of schedulers in timed systems. 347-363 - Eric Martin, Arun Sharma, Frank Stephan:
Learning power and language expressiveness. 365-383
Volume 298, Number 3, 11 April 2003
- Martín Abadi, Bruno Blanchet:
Secrecy types for asymmetric communication. 387-415 - Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
Equational theories of tropical semirings. 417-469 - Michel Bidoit, Rolf Hennicker, Alexander Kurz:
Observational logic, constructor-based logic, and their duality. 471-510 - Mikolaj Bojanczyk:
The finite graph problem for two-way alternating automata. 511-528 - Nadia Busi, Gianluigi Zavattaro:
Expired data collection in shared dataspaces. 529-556 - Cristiano Calcagno, Peter W. O'Hearn, Richard Bornat:
Program logic and equivalence in the presence of garbage collection. 557-581 - Gerwin Klein, Tobias Nipkow:
Verified bytecode verifiers. 583-626
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-05 22:23 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:
