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=172
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Removing Ramsey theory: Lower bounds with smaller domain size
Jeff Edmonds
Theoretical Computer Science
172
(1-2), 1997, pp. 1-41
PAC-learning from general examples
Paul Fischer
,
Klaus-Uwe Höffgen
,
Hanno Lefmann
Theoretical Computer Science
172
(1-2), 1997, pp. 43-65
Sur les facteurs des mots automatiques
Isabelle Fagnot
Theoretical Computer Science
172
(1-2), 1997, pp. 67-89
PAC learning of concept classes through the boundaries of their items
B. Apolloni
,
S. Chiaravalli
Theoretical Computer Science
172
(1-2), 1997, pp. 91-120
Universality of the chip-firing game
Eric Goles
,
Maurice Margenstern
Theoretical Computer Science
172
(1-2), 1997, pp. 121-134
Deterministic summation modulo
\cal B_n
, the semigroup of binary relations on
\{0,1,...,n-1\}
W.G. Handley
Theoretical Computer Science
172
(1-2), 1997, pp. 135-174
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Goos Kant
,
Xin He
Theoretical Computer Science
172
(1-2), 1997, pp. 175-193
Resource bounded randomness and weakly complete problems
Klaus Ambos-Spies
,
Sebastiaan A. Terwijn
,
Xizhong Zheng
Theoretical Computer Science
172
(1-2), 1997, pp. 195-207
Homogeneously orderable graphs
Andreas Brandstädt
,
Feodor F. Dragan
,
Falk Nicolai
Theoretical Computer Science
172
(1-2), 1997, pp. 209-232
Fugitive-search games on graphs and related parameters
Nick D. Dendris
,
Lefteris M. Kirousis
,
Dimitrios M. Thilikos
Theoretical Computer Science
172
(1-2), 1997, pp. 233-254
Massively parallel factorizations of polynomials with many non-commuting variables
Jean-Christoph Hohl
Theoretical Computer Science
172
(1-2), 1997, pp. 255-263
Finding optimal subgraphs by local search
Shinichi Shimozono
Theoretical Computer Science
172
(1-2), 1997, pp. 265-271
Reset words for commmutative and solvable automata
Igor Rystsov
Theoretical Computer Science
172
(1-2), 1997, pp. 273-279
A characterization of the squares in a Fibonacci string
Costas S. Iliopoulos
,
Dennis Moore
,
W.F. Smyth
Theoretical Computer Science
172
(1-2), 1997, pp. 281-291
A lower bound on branching programs reading some bits twice
Petr Savický
,
Stanislav Z̑ák
Theoretical Computer Science
172
(1-2), 1997, pp. 293-301
Finding a shortest vector in a two-dimensional lattice modulo
m
Günter Rote
Theoretical Computer Science
172
(1-2), 1997, pp. 303-308
The code problem for traces - Improving the boundaries
Hendrik Jan Hoogeboom
,
Anca Muscholl
Theoretical Computer Science
172
(1-2), 1997, pp. 309-321