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}
}
@inproceedings{DBLP:conf/stoc/BenjaminiSS08,
  author    = {Itai Benjamini and
               Oded Schramm and
               Asaf Shapira},
  title     = {Every minor-closed property of sparse graphs is testable},
  booktitle = {{STOC}},
  pages     = {393--402},
  publisher = {{ACM}},
  year      = {2008}
}
@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}
}
@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}
}
@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 = {{FOCS}},
  pages     = {31--39},
  publisher = {{IEEE} Computer Society},
  year      = {2005}
}
@inproceedings{DBLP:conf/stoc/BenjaminiSW05,
  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},
  booktitle = {{STOC}},
  pages     = {244--250},
  publisher = {{ACM}},
  year      = {2005}
}
@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}
}
@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}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics