Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 261
Volume 261, Number 1, 17 June 2001
- Ming Li:
Selected papers from ALT 1997 - Foreword. 1 - Sanjay Jain, Steffen Lange, Jochen Nessel:
On the learnability of recursively enumerable languages from good examples. 3-29 - John Case, Sanjay Jain, Arun Sharma
:
Synthesizing noise-tolerant language learners. 31-56 - V. G. Vovk:
Probability theory for the Brier game. 57-79 - Leonid Gurvits:
A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces. 81-90 - Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Hierarchies of probabilistic and team FIN-learning. 91-117 - Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann:
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. 119-156 - Wolfgang Maass:
On the relevance of time in neural computation and learning. 157-178 - Eiji Takimoto, Akira Maruoka, Volodya Vovk:
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme. 179-209
Volume 261, Number 2, 28 June 2001
- Wen-Lian Hsu, Ming-Yang Kao:
Selected papers from COCOON 1998 - Foreword. 211 - Fan R. K. Chung, Ronald L. Graham:
Dynamic location problems with limited look-ahead . 213-226 - Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki:
Efficient randomized routing algorithms on the two-dimensional mesh of buses. 227-239 - Dongsoo S. Kim, Ding-Zhu Du:
Multirate multicast switching networks. 241-251 - Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng:
Min-max-boundary domain decomposition. 253-266 - Alejandro López-Ortiz, Sven Schuierer:
The ultimate strategy to search on m rays? 267-295 - Chi-Jen Lu:
An exact characterization of symmetric functions in qAC0[2]. 297-303 - Steffen Reith, Klaus W. Wagner:
On boolean lowness and boolean highness. 305-321 - Kuo-Hui Tsai, Da-Wei Wang, Frank K. Hwang:
Lower bounds for wide-sense nonblocking Clos network. 323-328
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-17 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
