BibTeX record conf/approx/LachishNS06

download as .bib file

@inproceedings{DBLP:conf/approx/LachishNS06,
  author    = {Oded Lachish and
               Ilan Newman and
               Asaf Shapira},
  editor    = {Josep D{\'{\i}}az and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Uri Zwick},
  title     = {Space Complexity vs. Query Complexity},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 9th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
               Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
               Spain, August 28-30 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4110},
  pages     = {426--437},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11830924\_39},
  doi       = {10.1007/11830924\_39},
  timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl    = {https://dblp.org/rec/conf/approx/LachishNS06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics