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=329
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Techniques from combinatorial approximation algorithms yield efficient algorithms for random
2k
-SAT
Amin Coja-Oghlan
,
Andreas Goerdt
,
André Lanka
,
Frank Schädlich
Theoretical Computer Science
329
(1-3), 2004, pp. 1-45
On Robson's convergence and boundedness conjectures concerning the height of binary search trees
Michael Drmota
Theoretical Computer Science
329
(1-3), 2004, pp. 47-70
\omega
-regular languages are testable with a constant number of queries
Hana Chockler
,
Orna Kupferman
Theoretical Computer Science
329
(1-3), 2004, pp. 71-92
Recognizing frozen variables in constraint satisfaction problems
Peter Jonsson
,
Andrei Krokhin
Theoretical Computer Science
329
(1-3), 2004, pp. 93-113
Storage-to-tree transducers with look-head
Tamás Hornung
,
Sándor Vágvölgyi
Theoretical Computer Science
329
(1-3), 2004, pp. 115-158
A proof-heoretic characterization of the basic feasible functionals
Thomas Strahm
Theoretical Computer Science
329
(1-3), 2004, pp. 159-176
Codes, orderings, and partial words
F. Blanchet-Sadri
Theoretical Computer Science
329
(1-3), 2004, pp. 177-202
Polynomial time learning of simple deterministic languages via queries and a representative sample
Yasuhiro Tajima
,
Etsuji Tomita
,
Mitsuo Wakatsuki
,
Matsuaki Terada
Theoretical Computer Science
329
(1-3), 2004, pp. 203-221
On the complexities of multipoint evaluation and interpolation
Alin Bostan
,
Éric Schost
Theoretical Computer Science
329
(1-3), 2004, pp. 223-235
Some minimum merging networks
Gembu Morohashi
,
Shigeki Iwata
Theoretical Computer Science
329
(1-3), 2004, pp. 237-250
The factor composition matrix of sequences
Jacques Peyrière
,
Bo Tan
,
Zhi-Xiong Wen
,
Jun Wu
Theoretical Computer Science
329
(1-3), 2004, pp. 251-269
Uniquely decodable
n
-gram embeddings
Leonid Kontorovich
Theoretical Computer Science
329
(1-3), 2004, pp. 271-284
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
Grzegorz Malewicz
Theoretical Computer Science
329
(1-3), 2004, pp. 285-301
An improved deterministic local search algorithm for 3-Sat
Tobias Brueggemann
,
Walter Kern
Theoretical Computer Science
329
(1-3), 2004, pp. 303-313
The complexity of counting homomorphisms seen from the other side
Víctor Dalmau
,
Peter Jonsson
Theoretical Computer Science
329
(1-3), 2004, pp. 315-323
A greedy approximation for minimum connected dominating sets
Lu Ruan
,
Hongwei Du
,
Xiaohua Jia
,
Weili Wu
,
Yingshu Li
,
Ker-I Ko
Theoretical Computer Science
329
(1-3), 2004, pp. 325-330
The generalized XOR lemma
Yuliang Zheng
,
Xian-Mo Zhang
Theoretical Computer Science
329
(1-3), 2004, pp. 331-337