default search action
Theoretical Computer Science, Volume 313
Volume 313, Number 1, 16 February 2004
- Bruce W. Watson, Derick Wood:
Introduction. 1 - Anne Bergeron, Sylvie Hamel
:
From cascade decompositions to bit-vector algorithms. 3-16 - Bernard Boigelot, Louis Latour:
Counting the solutions of Presburger equations without enumerating them. 17-29 - Jean-Marc Champarnaud, Gérard Duchamp:
Derivatives of rational expressions and related theorems. 31-44 - Jan Daciuk, Gertjan van Noord
Finite automata for compact representation of tuple dictionaries. 45-56 - Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer:
Past pushdown timed automata and safety verification. 57-71 - Jacques Farré, José Fortes Gálvez:
Bounded-connect noncanonical discriminating-reverse parsers. 73-91 - Nathalie Friburger, Denis Maurel:
Finite-state transducer cascades to extract named entities in texts. 93-104 - Tamás Gaál:
Deciding sequentiability of finite-state transducers by finite-state pattern-matching. 105-117 - Dominique Geniet, Jean-Philippe Dubernard:
Scheduling hard sporadic tasks with regular languages and generating functions. 119-132 - Frank Katritzke, Wolfgang Merzenich, Michael Thomas:
Enhancements of partitioning techniques for image compression using weighted finite automata. 133-144 - André Kempe:
Extraction and recoding of input-ε-cycles in finite state transducers. 145-158 - Lynette van Zijl:
Generalized acceptance, succinctness and supernondeterministic finite automata. 159-172
Volume 313, Number 2, 17 February 2004
- Naoki Abe, Roni Khardon:
Foreword. 173-174 - Dana Angluin:
Queries revisited. 175-194 - Yuri Kalnishkan
Loss functions, complexities, and the Legendre transformation. 195-207 - Sanjay Jain, Frank Stephan
Learning how to separate. 209-228 - Sandra Zilles:
Separation of uniform learning classes. 229-265 - François Denis, Aurélien Lemay, Alain Terlutte:
Learning regular languages using RFSAs. 267-294 - Colin de la Higuera, Jean-Christophe Janodet:
Inference of [omega]-languages from prefixes. 295-312
Volume 313, Number 3, 19 February 2004
- Rudolf Fleischer, Richard J. Nowakowski
Preface: Algorithmic Combinatorial Game Theory. 313 - Ingo Althöfer:
Improved game play by multiple computer hint. 315-324 - Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer:
Solitaire Clobber. 325-338 - Benjamin Doerr:
European tenure games. 339-351 - Ioana Dumitriu, Joel Spencer:
A Halfliar's game. 353-369 - Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern:
Note on the game chromatic index of trees. 371-376 - Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
Traveling salesmen in the presence of competition. 377-392 - Aviezri S. Fraenkel:
Complexity, appeal and challenges of combinatorial games. 393-415 - J. P. Grossman:
Periodicity in one-dimensional peg duotaire. 417-425 - Frank Harary, Wolfgang Slany, Oleg Verbitsky
On the lengths of symmetry breaking-preserving games on graphs. 427-446 - Markus Holzer
Assembling molecules in ATOMIX is hard. 447-462 - S. Howse, Richard J. Nowakowski
Periodicity and arithmetic-periodicity in hexadecimal games. 463-472 - Daniel Král
It is tough to be a plumber. 473-484 - Ulf Lorenz, Burkhard Monien:
Error analysis in minimax trees. 485-498 - Raymond Georg Snatzke:
New results of exhaustive search in the game Amazons. 499-509 - Mark H. M. Winands
An effective two-level proof-number search algorithm. 511-525 - David Wolfe, William Fraser:
Counting the number of games. 527-532 - J. P. Grossman:
Appendix A: Report on the First International Clobber Tournament. 533-537 - Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. 539-543
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-15 01:26 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: