Search dblp for Publications

export results for "toc:db/journals/toc/toc1.bht:"

 download as .bib file

@article{DBLP:journals/toc/Aaronson05,
  author       = {Scott Aaronson},
  title        = {Limitations of Quantum Advice and One-Way Communication},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {1--28},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a001},
  doi          = {10.4086/TOC.2005.V001A001},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Aaronson05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AaronsonA05,
  author       = {Scott Aaronson and
                  Andris Ambainis},
  title        = {Quantum Search of Spatial Regions},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {47--79},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a004},
  doi          = {10.4086/TOC.2005.V001A004},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AaronsonA05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Ajtai05,
  author       = {Mikl{\'{o}}s Ajtai},
  title        = {A Non-linear Time Lower Bound for Boolean Branching Programs},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {149--176},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a008},
  doi          = {10.4086/TOC.2005.V001A008},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Ajtai05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AlonS05,
  author       = {Noga Alon and
                  Asaf Shapira},
  title        = {Linear Equations, Arithmetic Progressions and Hypergraph Property
                  Testing},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {177--216},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a009},
  doi          = {10.4086/TOC.2005.V001A009},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AlonS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Ambainis05,
  author       = {Andris Ambainis},
  title        = {Polynomial Degree and Lower Bounds in Quantum Complexity: Collision
                  and Element Distinctness with Small Range},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {37--46},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a003},
  doi          = {10.4086/TOC.2005.V001A003},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Ambainis05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AzarBBM05,
  author       = {Yossi Azar and
                  Avrim Blum and
                  David P. Bunde and
                  Yishay Mansour},
  title        = {Combining Online Algorithms for Acceptance and Rejection},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {105--117},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a006},
  doi          = {10.4086/TOC.2005.V001A006},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AzarBBM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HastadK05,
  author       = {Johan H{\aa}stad and
                  Subhash Khot},
  title        = {Query Efficient PCPs with Perfect Completeness},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {119--148},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a007},
  doi          = {10.4086/TOC.2005.V001A007},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/HastadK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HoyerS05,
  author       = {Peter H{\o}yer and
                  Robert Spalek},
  title        = {Quantum Fan-out is Powerful},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {81--103},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a005},
  doi          = {10.4086/TOC.2005.V001A005},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/HoyerS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Kutin05,
  author       = {Samuel Kutin},
  title        = {Quantum Lower Bound for the Collision Problem with Small Range},
  journal      = {Theory Comput.},
  volume       = {1},
  number       = {1},
  pages        = {29--36},
  year         = {2005},
  url          = {https://doi.org/10.4086/toc.2005.v001a002},
  doi          = {10.4086/TOC.2005.V001A002},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Kutin05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics