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=348
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sequential sampling techniques for algorithmic learning theory
Osamu Watanabe
Theoretical Computer Science
348
(1), 2005, pp. 3-14
Inductive inference of approximations for recursive concepts
Steffen Lange
,
Gunter Grieser
,
Thomas Zeugmann
Theoretical Computer Science
348
(1), 2005, pp. 15-40
Learning erasing pattern languages with queries
Jochen Nessel
,
Steffen Lange
Theoretical Computer Science
348
(1), 2005, pp. 41-57
Learning taxonomic relation by case-based reasoning
Ken Satoh
Theoretical Computer Science
348
(1), 2005, pp. 58-69
Learning from positive and unlabeled examples
François Denis
,
Rémi Gilleron
,
Fabien Letouzey
Theoretical Computer Science
348
(1), 2005, pp. 70-83
Prediction-hardness of acyclic conjunctive queries
Kouichi Hirata
Theoretical Computer Science
348
(1), 2005, pp. 84-94
On approximate learning by multi-layered feedforward circuits
Bhaskar DasGupta
,
Barbara Hammer
Theoretical Computer Science
348
(1), 2005, pp. 95-127
Elementarily computable functions over the real numbers and
R
-sub-recursive functions
Olivier Bournez
,
Emmanuel Hainry
Theoretical Computer Science
348
(2-3), 2005, pp. 130-147
The complexity of partition functions
Andrei Bulatov
,
Martin Grohe
Theoretical Computer Science
348
(2-3), 2005, pp. 148-186
Locally consistent constraint satisfaction problems
Zdenȇk Dvoȓák
,
Daniel Král'
,
Ondȓej Pangrác
Theoretical Computer Science
348
(2-3), 2005, pp. 187-206
On graph problems in a semi-streaming model
Joan Feigenbaum
,
Sampath Kannan
,
Andrew McGregor
,
Siddharth Suri
,
Jian Zhang
Theoretical Computer Science
348
(2-3), 2005, pp. 207-216
Linear tolls suffice: New bounds and algorithms for tolls in single source networks
Lisa Fleischer
Theoretical Computer Science
348
(2-3), 2005, pp. 217-225
Selfish unsplittable flows
Dimitris Fotakis
,
Spyros Kontogiannis
,
Paul Spirakis
Theoretical Computer Science
348
(2-3), 2005, pp. 226-239
The minimum-entropy set cover problem
Eran Halperin
,
Richard M. Karp
Theoretical Computer Science
348
(2-3), 2005, pp. 240-250
Simple permutations mix well
Shlomo Hoory
,
Avner Magen
,
Steven Myers
,
Charles Rackoff
Theoretical Computer Science
348
(2-3), 2005, pp. 251-261
The black-box complexity of nearest-neighbor search
Robert Krauthgamer
,
James R. Lee
Theoretical Computer Science
348
(2-3), 2005, pp. 262-276
Regular solutions of language inequalities and well quasi-orders
Michal Kunc
Theoretical Computer Science
348
(2-3), 2005, pp. 277-293
Close to optimal decentralized routing in long-range contact networks
Emmanuelle Lebhar
,
Nicolas Schabanel
Theoretical Computer Science
348
(2-3), 2005, pp. 294-310
A time lower bound for satisfiability
Dieter van Melkebeek
,
Ran Raz
Theoretical Computer Science
348
(2-3), 2005, pp. 311-320
LA, permutations, and the Hajós calculus
Michael Soltys
Theoretical Computer Science
348
(2-3), 2005, pp. 321-333
Efficiently computing succinct trade-off curves
Sergei Vassilvitskii
,
Mihalis Yannakakis
Theoretical Computer Science
348
(2-3), 2005, pp. 334-356
A new algorithm for optimal 2-constraint satisfaction and its implications
Ryan Williams
Theoretical Computer Science
348
(2-3), 2005, pp. 357-365