BibTeX record conf/icalp/Dachman-SoledLMSWW08

download as .bib file

@inproceedings{DBLP:conf/icalp/Dachman-SoledLMSWW08,
  author    = {Dana Dachman{-}Soled and
               Homin K. Lee and
               Tal Malkin and
               Rocco A. Servedio and
               Andrew Wan and
               Hoeteck Wee},
  title     = {Optimal Cryptographic Hardness of Learning Monotone Functions},
  booktitle = {Automata, Languages and Programming, 35th International Colloquium,
               {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
               {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  pages     = {36--47},
  year      = {2008},
  crossref  = {DBLP:conf/icalp/2008-1},
  url       = {https://doi.org/10.1007/978-3-540-70575-8\_4},
  doi       = {10.1007/978-3-540-70575-8\_4},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/Dachman-SoledLMSWW08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2008-1,
  editor    = {Luca Aceto and
               Ivan Damg{\aa}rd and
               Leslie Ann Goldberg and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Anna Ing{\'{o}}lfsd{\'{o}}ttir and
               Igor Walukiewicz},
  title     = {Automata, Languages and Programming, 35th International Colloquium,
               {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
               {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  series    = {Lecture Notes in Computer Science},
  volume    = {5125},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-70575-8},
  doi       = {10.1007/978-3-540-70575-8},
  isbn      = {978-3-540-70574-1},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2008-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier