Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=298
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hypothesis finding based on upward refinement of residue hypotheses
Akihiro Yamamoto
Theoretical Computer Science
298
(1), 2003, pp. 5-19
Learning elementary formal systems with queries
Hiroshi Sakamoto
,
Kouichi Hirata
,
Hiroki Arimura
Theoretical Computer Science
298
(1), 2003, pp. 21-50
Advanced elementary formal systems
Steffen Lange
,
Gunter Grieser
,
Klaus P. Jantke
Theoretical Computer Science
298
(1), 2003, pp. 51-70
Decision lists over regular patterns
Steffen Lange
,
Jochen Nessel
Theoretical Computer Science
298
(1), 2003, pp. 71-87
Refutable language learning with a neighbor system
Yasuhito Mukouchi
,
Masako Sato
Theoretical Computer Science
298
(1), 2003, pp. 89-110
On learning of functions refutably
Sanjay Jain
,
Efim Kinber
,
Rolf Wiehagen
,
Thomas Zeugmann
Theoretical Computer Science
298
(1), 2003, pp. 111-143
Refuting learning revisited
Wolfgang Merkle
,
Frank Stephan
Theoretical Computer Science
298
(1), 2003, pp. 145-177
Polynomial-time identification of very simple grammars from positive data
Takashi Yokomori
Theoretical Computer Science
298
(1), 2003, pp. 179-206
Effects of domain characteristics on instance-based learning algorithms
Seishi Okamoto
,
Nobuhiro Yugami
Theoretical Computer Science
298
(1), 2003, pp. 207-233
Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model
Tatsuya Akutsu
,
Satoru Kuhara
,
Osamu Maruyama
,
Satoru Miyano
Theoretical Computer Science
298
(1), 2003, pp. 235-251
Collage system: A unifying framework for compressed pattern matching
Takuya Kida
,
Tetsuya Matsumoto
,
Yusuke Shibata
,
Masayuki Takeda
,
Ayumi Shinohara
,
Setsuo Arikawa
Theoretical Computer Science
298
(1), 2003, pp. 253-272
Infinitary lambda calculus and discrimination of Berarducci trees
Mariangiola Dezani-Ciancaglini
,
Paula Severi
,
Fer-Jan de Vries
Theoretical Computer Science
298
(2), 2003, pp. 275-302
Uniformly hard languages
Rod Downey
,
Lance Fortnow
Theoretical Computer Science
298
(2), 2003, pp. 303-315
On the parametric complexity of schedules to minimize tardy tasks
Michael R. Fellows
,
Catherine McCartin
Theoretical Computer Science
298
(2), 2003, pp. 317-324
On algebraic and logical specifications of classes of regular languages
Bakhadyr Khoussainov
Theoretical Computer Science
298
(2), 2003, pp. 325-346
Automatic synthesis of a subclass of schedulers in timed systems
Padmanabhan Krishnan
Theoretical Computer Science
298
(2), 2003, pp. 347-363
Learning power and language expressiveness
Eric Martin
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
298
(2), 2003, pp. 365-383
Secrecy types for asymmetric communication
Martín Abadi
,
Bruno Blanchet
Theoretical Computer Science
298
(3), 2003, pp. 387-415
Equational theories of tropical semirings
Luca Aceto
,
Zoltán Ésik
,
Anna Ingólfsdóttir
Theoretical Computer Science
298
(3), 2003, pp. 417-469
Observational logic, constructor-based logic, and their duality
Michel Bidoit
,
Rolf Hennicker
,
Alexander Kurz
Theoretical Computer Science
298
(3), 2003, pp. 471-510
The finite graph problem for two-way alternating automata
Mikoƚaj Bojańczyk
Theoretical Computer Science
298
(3), 2003, pp. 511-528
Expired data collection in shared dataspaces
Nadia Busi
,
Gianluigi Zavattaro
Theoretical Computer Science
298
(3), 2003, pp. 529-556
Program logic and equivalence in the presence of garbage collection
Cristiano Calcagno
,
Peter O'Hearn
,
Richard Bornat
Theoretical Computer Science
298
(3), 2003, pp. 557-581
Verified bytecode verifiers
Gerwin Klein
,
Tobias Nipkow
Theoretical Computer Science
298
(3), 2003, pp. 583-626