Search dblp for Publications

export results for "toc:db/journals/tcs/tcs261.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AmbainisAFS01,
  author       = {Andris Ambainis and
                  Kalvis Apsitis and
                  Rusins Freivalds and
                  Carl H. Smith},
  title        = {Hierarchies of probabilistic and team FIN-learning},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {91--117},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00135-3},
  doi          = {10.1016/S0304-3975(00)00135-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AmbainisAFS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CaseJS01,
  author       = {John Case and
                  Sanjay Jain and
                  Arun Sharma},
  title        = {Synthesizing noise-tolerant language learners},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {31--56},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00132-8},
  doi          = {10.1016/S0304-3975(00)00132-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CaseJS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChungG01,
  author       = {Fan R. K. Chung and
                  Ronald L. Graham},
  title        = {Dynamic location problems with limited look-ahead},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {213--226},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00140-7},
  doi          = {10.1016/S0304-3975(00)00140-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChungG01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ErlebachRSSZ01,
  author       = {Thomas Erlebach and
                  Peter Rossmanith and
                  Hans Stadtherr and
                  Angelika Steger and
                  Thomas Zeugmann},
  title        = {Learning one-variable pattern languages very efficiently on average,
                  in parallel, and by asking queries},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {119--156},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00136-5},
  doi          = {10.1016/S0304-3975(00)00136-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ErlebachRSSZ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Gurvits01,
  author       = {Leonid Gurvits},
  title        = {A note on a scale-sensitive dimension of linear bounded functionals
                  in Banach spaces},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {81--90},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00134-1},
  doi          = {10.1016/S0304-3975(00)00134-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Gurvits01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HsuK01,
  author       = {Wen{-}Lian Hsu and
                  Ming{-}Yang Kao},
  title        = {Selected papers from {COCOON} 1998 - Foreword},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {211},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00139-0},
  doi          = {10.1016/S0304-3975(00)00139-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HsuK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/IwamaMTT01,
  author       = {Kazuo Iwama and
                  Eiji Miyano and
                  Satoshi Tajima and
                  Hisao Tamaki},
  title        = {Efficient randomized routing algorithms on the two-dimensional mesh
                  of buses},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {227--239},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00141-9},
  doi          = {10.1016/S0304-3975(00)00141-9},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/IwamaMTT01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JainLN01,
  author       = {Sanjay Jain and
                  Steffen Lange and
                  Jochen Nessel},
  title        = {On the learnability of recursively enumerable languages from good
                  examples},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {3--29},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00131-6},
  doi          = {10.1016/S0304-3975(00)00131-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JainLN01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KimD01,
  author       = {Dongsoo S. Kim and
                  Ding{-}Zhu Du},
  title        = {Multirate multicast switching networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {241--251},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00142-0},
  doi          = {10.1016/S0304-3975(00)00142-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KimD01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KiwiST01,
  author       = {Marcos A. Kiwi and
                  Daniel A. Spielman and
                  Shang{-}Hua Teng},
  title        = {Min-max-boundary domain decomposition},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {253--266},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00143-2},
  doi          = {10.1016/S0304-3975(00)00143-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KiwiST01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Li01,
  author       = {Ming Li},
  title        = {Selected papers from {ALT} 1997 - Foreword},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {1},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00130-4},
  doi          = {10.1016/S0304-3975(00)00130-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Li01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Lopez-OrtizS01,
  author       = {Alejandro L{\'{o}}pez{-}Ortiz and
                  Sven Schuierer},
  title        = {The ultimate strategy to search on m rays?},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {267--295},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00144-4},
  doi          = {10.1016/S0304-3975(00)00144-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Lopez-OrtizS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Lu01,
  author       = {Chi{-}Jen Lu},
  title        = {An exact characterization of symmetric functions in qAC\({}^{\mbox{0}}\)[2]},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {297--303},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00145-6},
  doi          = {10.1016/S0304-3975(00)00145-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Lu01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Maass01,
  author       = {Wolfgang Maass},
  title        = {On the relevance of time in neural computation and learning},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {157--178},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00137-7},
  doi          = {10.1016/S0304-3975(00)00137-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Maass01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ReithW01,
  author       = {Steffen Reith and
                  Klaus W. Wagner},
  title        = {On boolean lowness and boolean highness},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {305--321},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00146-8},
  doi          = {10.1016/S0304-3975(00)00146-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ReithW01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TakimotoMV01,
  author       = {Eiji Takimoto and
                  Akira Maruoka and
                  Volodya Vovk},
  title        = {Predicting nearly as well as the best pruning of a decision tree through
                  dynamic programming scheme},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {179--209},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00138-9},
  doi          = {10.1016/S0304-3975(00)00138-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/TakimotoMV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TsaiWH01,
  author       = {Kuo{-}Hui Tsai and
                  Da{-}Wei Wang and
                  Frank K. Hwang},
  title        = {Lower bounds for wide-sense nonblocking Clos network},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {2},
  pages        = {323--328},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00147-X},
  doi          = {10.1016/S0304-3975(00)00147-X},
  timestamp    = {Tue, 17 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/TsaiWH01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Vovk01,
  author       = {V. G. Vovk},
  title        = {Probability theory for the Brier game},
  journal      = {Theor. Comput. Sci.},
  volume       = {261},
  number       = {1},
  pages        = {57--79},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00133-X},
  doi          = {10.1016/S0304-3975(00)00133-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Vovk01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.