BibTeX records: Igor Gorodezky

• > Home > Persons > Igor Gorodezky

@article{DBLP:journals/rsa/GorodezkyP14,
  author       = {Igor Gorodezky and
                  Igor Pak},
  title        = {Generalized loop-erased random walks and approximate reachability},
  journal      = {Random Struct. Algorithms},
  volume       = {44},
  number       = {2},
  pages        = {201--223},
  year         = {2014},
  url          = {https://doi.org/10.1002/rsa.20460},
  doi          = {10.1002/RSA.20460},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/GorodezkyP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/approx/GorodezkyKSS10,
  author       = {Igor Gorodezky and
                  Robert D. Kleinberg and
                  David B. Shmoys and
                  Gwen Spencer},
  editor       = {Maria J. Serna and
                  Ronen Shaltiel and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Improved Lower Bounds for the Universal and \emph{a priori} {TSP}},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
                  International Workshop, {RANDOM} 2010, Barcelona, Spain, September
                  1-3, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6302},
  pages        = {178--191},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-15369-3\_14},
  doi          = {10.1007/978-3-642-15369-3\_14},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/GorodezkyKSS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1002-3864,
  author       = {Prahladh Harsha and
                  Moses Charikar and
                  Matthew Andrews and
                  Sanjeev Arora and
                  Subhash Khot and
                  Dana Moshkovitz and
                  Lisa Zhang and
                  Ashkan Aazami and
                  Dev Desai and
                  Igor Gorodezky and
                  Geetha Jagannathan and
                  Alexander S. Kulikov and
                  Darakhshan J. Mir and
                  Alantha Newman and
                  Aleksandar Nikolov and
                  David Pritchard and
                  Gwen Spencer},
  title        = {Limits of Approximation Algorithms: PCPs and Unique Games {(DIMACS}
                  Tutorial Lecture Notes)},
  journal      = {CoRR},
  volume       = {abs/1002.3864},
  year         = {2010},
  url          = {http://arxiv.org/abs/1002.3864},
  eprinttype    = {arXiv},
  eprint       = {1002.3864},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1002-3864.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BabaiG07,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Igor Gorodezky},
  editor       = {Nikhil Bansal and
                  Kirk Pruhs and
                  Clifford Stein},
  title        = {Sandpile transience on the grid is polynomially bounded},
  booktitle    = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
                  2007},
  pages        = {627--636},
  publisher    = {{SIAM}},
  year         = {2007},
  url          = {http://dl.acm.org/citation.cfm?id=1283383.1283451},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BabaiG07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}