BibTeX records: Oded Schramm

download as .bib file

@article{DBLP:journals/cpc/LyonsPS08,
  author    = {Russell Lyons and
               R. O. N. Peled and
               Oded Schramm},
  title     = {Growth of the Number of Spanning Trees of the Erd{\"{o}}s-R{\'{e}}nyi
               Giant Component},
  journal   = {Comb. Probab. Comput.},
  volume    = {17},
  number    = {5},
  pages     = {711--726},
  year      = {2008},
  url       = {https://doi.org/10.1017/S0963548308009188},
  doi       = {10.1017/S0963548308009188},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cpc/LyonsPS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenjaminiSS08,
  author    = {Itai Benjamini and
               Oded Schramm and
               Asaf Shapira},
  editor    = {Cynthia Dwork},
  title     = {Every minor-closed property of sparse graphs is testable},
  booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
               Victoria, British Columbia, Canada, May 17-20, 2008},
  pages     = {393--402},
  publisher = {{ACM}},
  year      = {2008},
  url       = {https://doi.org/10.1145/1374376.1374433},
  doi       = {10.1145/1374376.1374433},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/BenjaminiSS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BenjaminiSS08,
  author    = {Itai Benjamini and
               Oded Schramm and
               Asaf Shapira},
  title     = {Every Minor-Closed Property of Sparse Graphs is Testable},
  journal   = {Electron. Colloquium Comput. Complex.},
  volume    = {15},
  number    = {010},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-010/index.html},
  timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/BenjaminiSS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/PeresSSW07,
  author    = {Yuval Peres and
               Oded Schramm and
               Scott Sheffield and
               David Bruce Wilson},
  title     = {Random-Turn Hex and Other Selection Games},
  journal   = {Am. Math. Mon.},
  volume    = {114},
  number    = {5},
  pages     = {373--387},
  year      = {2007},
  url       = {http://www.jstor.org/stable/27642219},
  timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/tamm/PeresSSW07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ODonnellSS05,
  author    = {Ryan O'Donnell and
               Michael E. Saks and
               Oded Schramm and
               Rocco A. Servedio},
  title     = {Every decision tree has an in.uential variable},
  booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
  pages     = {31--39},
  publisher = {{IEEE} Computer Society},
  year      = {2005},
  url       = {https://doi.org/10.1109/SFCS.2005.34},
  doi       = {10.1109/SFCS.2005.34},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/ODonnellSS05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenjaminiSW05,
  author    = {Itai Benjamini and
               Oded Schramm and
               David Bruce Wilson},
  editor    = {Harold N. Gabow and
               Ronald Fagin},
  title     = {Balanced boolean functions that can be evaluated so that every input
               bit is unlikely to be read},
  booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
               Baltimore, MD, USA, May 22-24, 2005},
  pages     = {244--250},
  publisher = {{ACM}},
  year      = {2005},
  url       = {https://doi.org/10.1145/1060590.1060627},
  doi       = {10.1145/1060590.1060627},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/BenjaminiSW05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0508071,
  author    = {Ryan O'Donnell and
               Michael E. Saks and
               Oded Schramm and
               Rocco A. Servedio},
  title     = {Every decision tree has an influential variable},
  journal   = {CoRR},
  volume    = {abs/cs/0508071},
  year      = {2005},
  url       = {http://arxiv.org/abs/cs/0508071},
  archivePrefix = {arXiv},
  eprint    = {cs/0508071},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-cs-0508071.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-PR-0410282,
  author    = {Itai Benjamini and
               Oded Schramm and
               David Bruce Wilson},
  title     = {Balanced Boolean functions that can be evaluated so that every input
               bit is unlikely to be read},
  journal   = {CoRR},
  volume    = {math.PR/0410282},
  year      = {2004},
  url       = {http://arxiv.org/abs/math.PR/0410282},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/math-PR-0410282.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics