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=261
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the learnability of recursively enumerable languages from good examples
Sanjay Jain
,
Steffen Lange
,
Jochen Nessel
Theoretical Computer Science
261
(1), 2001, pp. 3-29
Synthesizing noise-tolerant language learners
John Case
,
Sanjay Jain
,
Arun Sharma
Theoretical Computer Science
261
(1), 2001, pp. 31-56
Probability theory for the Brier game
V. Vovk
Theoretical Computer Science
261
(1), 2001, pp. 57-79
A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces
Leonid Gurvits
Theoretical Computer Science
261
(1), 2001, pp. 81-90
Hierarchies of probabilistic and team FIN-learning
Andris Ambainis
,
Kalvis Apsītis
,
Rūsiņs̑ Freivalds
,
Carl H. Smith
Theoretical Computer Science
261
(1), 2001, pp. 91-117
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Thomas Erlebach
,
Peter Rossmanith
,
Hans Stadtherr
,
Angelika Steger
,
Thomas Zeugmann
Theoretical Computer Science
261
(1), 2001, pp. 119-156
On the relevance of time in neural computation and learning
Wolfgang Maass
Theoretical Computer Science
261
(1), 2001, pp. 157-178
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
Eiji Takimoto
,
Akira Maruoka
,
Volodya Vovk
Theoretical Computer Science
261
(1), 2001, pp. 179-209
Dynamic location problems with limited look-ahead
Fan Chung
,
Ronald Graham
Theoretical Computer Science
261
(2), 2001, pp. 213-226
Efficient randomized routing algorithms on the two-dimensional mesh of buses
Kazuo Iwama
,
Eiji Miyano
,
Satoshi Tajima
,
Hisao Tamaki
Theoretical Computer Science
261
(2), 2001, pp. 227-239
Multirate multicast switching networks
Dongsoo S. Kim
,
Ding-Zhu Du
Theoretical Computer Science
261
(2), 2001, pp. 241-251
Min-max-boundary domain decomposition
Marcos Kiwi
,
Daniel A. Spielman
,
Shang-Hua Teng
Theoretical Computer Science
261
(2), 2001, pp. 253-266
The ultimate strategy to search on
m
rays?
Alejandro López-Ortiz
,
Sven Schuierer
Theoretical Computer Science
261
(2), 2001, pp. 267-295
An exact characterization of symmetric functions in
qAC^0[2]
Chi-Jen Lu
Theoretical Computer Science
261
(2), 2001, pp. 297-303
On Boolean lowness and Boolean highness
Steffen Reith
,
Klaus W. Wagner
Theoretical Computer Science
261
(2), 2001, pp. 305-321
Lower bounds for wide-sense nonblocking Clos network
Kuo-Hui Tsai
,
Da-Wei Wang
,
Frank Hwang
Theoretical Computer Science
261
(2), 2001, pp. 323-328