default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 292
Volume 292, Number 1, January 2003
- Patrice Séébold:
Foreword. 1 - Publications of Jean Berstel. Theor. Comput. Sci. 292(1): 3-7 (2003)
- Jean-Paul Allouche
, Michael Baake, Julien Cassaigne, David Damanik:
Palindrome complexity. 9-31 - Holger Austinat, Volker Diekert, Ulrich Hertrampf:
A structural property of regular frequency computations. 33-43 - Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch:
Squaring transducers: an efficient procedure for deciding functionality and sequentiality. 45-63 - Danièle Beauquier:
On probabilistic timed automata. 65-84 - Srecko Brlek, Christophe Reutenauer:
On a valuation of rational subsets of Zk Dédié à Jean Berstel. 85-96 - Véronique Bruyère:
Cumulative defect. 97-109 - Arturo Carpi, Aldo de Luca:
Semiperiodic words and root-conjugacy. 111-130 - Christian Choffrut:
Minimizing subsequential transducers: a survey. 131-143 - Philippe Chrétienne, Francis Sourd:
PERT scheduling with convex cost functions. 145-164 - Robert Cori, Gilles Schaeffer:
Description trees and Tutte formulas. 165-183 - Maxime Crochemore:
Reducing space for index implementation. 185-197 - Andrzej Ehrenfeucht, Tero Harju, Ion Petre, David M. Prescott, Grzegorz Rozenberg:
Formal systems for gene assembly in ciliates. 199-219 - Christiane Frougny:
On-line digit set conversion in real base. 221-235 - Juhani Karhumäki, Ján Manuch, Wojciech Plandowski:
A defect theorem for bi-infinite words. 237-243 - Filippo Mignosi, Antonio Restivo, Pedro V. Silva:
On Fine and Wilf's theorem for bidimensional words. 245-262 - Arto Salomaa:
Composition sequences for functions over a finite domain. 263-281 - Patrice Séébold:
On some generalizations of the Thue-Morse morphism. 283-298 - Wolfgang Thomas:
Uniform and nonuniform recognizability. 299-316 - Jean-Eric Pin:
Algebraic tools for the concatenation product. 317-342
Volume 292, Number 2, January 2003
- Setsuo Arikawa, Koichi Furukawa, Shinichi Morishita, Hiroshi Motoda:
Preface. 343-344 - Petr Hájek, Martin Holena:
Formal logics of discovery and hypothesis formation by machine. 345-357 - Steffen Lange, Gunter Grieser:
Variants of iterative learning. 359-376 - Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda:
Uniform characterizations of polynomial-query learnabilities. 377-385 - Yoshimitsu Kudoh, Makoto Haraguchi, Yoshiaki Okubo:
Data abstractions for decision tree induction. 387-416 - João Gama:
Iterative Bayes. 417-430 - Genshiro Kitagawa, Tomoyuki Higuchi, Fumiyo N. Kondo:
Smoothness prior approach to explore mean structure in large-scale time series. 431-446 - Eiji Takimoto, Akira Maruoka:
Top-down decision tree learning as information based boosting. 447-464 - Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A practical algorithm to find the best subsequence patterns. 465-479 - Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara:
A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis. 481-495 - Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri, Mayumi Yamasaki, Kouichi Tamari:
Discovering instances of poetic allusion from anthologies of classical Japanese poems. 497-524 - Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri:
Discovering characteristic expressions in literary works. 525-546 - Hayato Ohwada, Fumio Mizoguchi:
Integrating information visualization and retrieval for WWW information discovery. 547-571
Volume 292, Number 3, January 2003
- André Berthiaume, John D. Rogers:
Foreword. 573 - John Watrous:
PSPACE has constant-round quantum interactive proof systems. 575-588 - Pawel Horodecki, John A. Smolin, Barbara M. Terhal, Ashish V. Thapliyal:
Rank two bipartite bound entangled states do not exist. 589-596 - Lance Fortnow:
One complexity theorist's view of quantum computing. 597-610 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Forbidding-enforcing systems. 611-638 - Hermann Jung, Maria J. Serna, Paul G. Spirakis:
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling. 639-652 - Grzegorz Rozenberg, Herman P. Spaink:
DNA computing by blocking. 653-665 - Wei-Mei Chen, Gen-Huey Chen:
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures. 667-677 - Xuemin Lin, Peter Eades:
Towards area requirements for drawing hierarchically planar graphs. 679-695 - Yuliang Zheng, Xian-Mo Zhang:
Connections among nonlinearity, avalanche and correlation immunity. 697-710 - Andrés Moreira:
Universality and decidability of number-conserving cellular automata. 711-721 - Jack Jie Dai:
A stronger Kolmogorov zero-one law for resource-bounded measure. 723-732
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 2024-12-27 21:15 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:
