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=313
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
From cascade decompositions to bit-vector algorithms
Anne Bergeron
,
Sylvie Hamel
Theoretical Computer Science
313
(1), 2004, pp. 3-16
Counting the solutions of Presburger equations without enumerating them
Bernard Boigelot
,
Louis Latour
Theoretical Computer Science
313
(1), 2004, pp. 17-29
Derivatives of rational expressions and related theorems
Jean-Marc Champarnaud
,
Gérard Duchamp
Theoretical Computer Science
313
(1), 2004, pp. 31-44
Finite automata for compact representation of Tuple dictionaries
Jan Daciuk
,
Gertjan van Noord
Theoretical Computer Science
313
(1), 2004, pp. 45-56
Past pushdown timed automata and safety verification
Zhe Dang
,
Tevfik Bultan
,
Oscar H. Ibarra
,
Richard A. Kemmerer
Theoretical Computer Science
313
(1), 2004, pp. 57-71
Bounded-connect noncanonical discriminating-reverse parsers
Jacques Farré
,
J. Fortes Gálvez
Theoretical Computer Science
313
(1), 2004, pp. 73-91
Finite-state transducer cascades to extract named entities in texts
N. Friburger
,
D. Maurel
Theoretical Computer Science
313
(1), 2004, pp. 93-104
Deciding sequentiability of finite-state transducers by finite-state pattern-matching
Tamás Gaál
Theoretical Computer Science
313
(1), 2004, pp. 105-117
Scheduling hard sporadic tasks with regular languages and generating functions
Dominique Geniet
,
Jean-Philippe Dubernard
Theoretical Computer Science
313
(1), 2004, pp. 119-132
Enhancements of partitioning techniques for image compression using weighted finite automata
F. Katritzke
,
W. Merzenich
,
M. Thomas
Theoretical Computer Science
313
(1), 2004, pp. 133-144
Extraction and recoding of input-
\varepsilon
-cycles
André Kempe
Theoretical Computer Science
313
(1), 2004, pp. 145-158
Generalized acceptance, succinctness and supernondeterministic finite automata
Lynette van Zijl
Theoretical Computer Science
313
(1), 2004, pp. 159-172
Queries revisited
Dana Angluin
Theoretical Computer Science
313
(2), 2004, pp. 175-194
Loss functions, complexities, and the Legendre transformation
Yuri Kalnishkan
,
Volodya Vovk
,
Michael V. Vyugin
Theoretical Computer Science
313
(2), 2004, pp. 195-207
Learning how to separate
Sanjay Jain
,
Frank Stephan
Theoretical Computer Science
313
(2), 2004, pp. 209-228
Separation of uniform learning classes
Sandra Zilles
Theoretical Computer Science
313
(2), 2004, pp. 229-265
Learning regular languages using RFSAs
François Denis
,
Aurélien Lemay
,
Alain Terlutte
Theoretical Computer Science
313
(2), 2004, pp. 267-294
Inference of
\omega
-languages from prefixes
C. de la Higuera
,
J.C. Janodet
Theoretical Computer Science
313
(2), 2004, pp. 295-312
Improved game play by multiple computer hints
Ingo Althöfer
Theoretical Computer Science
313
(3), 2004, pp. 315-324
Solitaire Clobber
Erik D. Demaine
,
Martin L. Demaine
,
Rudolf Fleischer
Theoretical Computer Science
313
(3), 2004, pp. 325-338
European tenure games
Benjamin Doerr
Theoretical Computer Science
313
(3), 2004, pp. 339-351
A halfliar's game
Ioana Dumitriu
,
Joel Spencer
Theoretical Computer Science
313
(3), 2004, pp. 353-369
Note on the game chromatic index of trees
Peter L. Erdös
,
Ulrich Faigle
,
Winfried Hochstättler
,
Walter Kern
Theoretical Computer Science
313
(3), 2004, pp. 371-376
Traveling Salesmen in the presence of competition
Sándor P. Fekete
,
Rudolf Fleischer
,
Aviezri Fraenkel
,
Matthias Schmitt
Theoretical Computer Science
313
(3), 2004, pp. 377-392
Complexity, appeal and challenges of combinatorial games
Aviezri S. Fraenkel
Theoretical Computer Science
313
(3), 2004, pp. 393-415
Seiten 1
2
>