BibTeX records: Denis Pankratov

download as .bib file

@inproceedings{DBLP:conf/innovations/BeameFIKPPR18,
  author    = {Paul Beame and
               Noah Fleming and
               Russell Impagliazzo and
               Antonina Kolokolova and
               Denis Pankratov and
               Toniann Pitassi and
               Robert Robere},
  title     = {Stabbing Planes},
  booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
               2018, January 11-14, 2018, Cambridge, MA, {USA}},
  pages     = {10:1--10:20},
  year      = {2018},
  crossref  = {DBLP:conf/innovations/2018},
  url       = {https://doi.org/10.4230/LIPIcs.ITCS.2018.10},
  doi       = {10.4230/LIPIcs.ITCS.2018.10},
  timestamp = {Sat, 13 Jan 2018 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/BeameFIKPPR18},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/BorodinPS18,
  author    = {Allan Borodin and
               Denis Pankratov and
               Amirali Salehi{-}Abari},
  title     = {A Simple {PTAS} for the Dual Bin Packing Problem and Advice Complexity
               of Its Online Version},
  booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
               2018, New Orleans, LA, {USA}},
  pages     = {8:1--8:12},
  year      = {2018},
  crossref  = {DBLP:conf/soda/2018sosa},
  url       = {https://doi.org/10.4230/OASIcs.SOSA.2018.8},
  doi       = {10.4230/OASIcs.SOSA.2018.8},
  timestamp = {Sat, 13 Jan 2018 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/BorodinPS18},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FlemingPPR17,
  author    = {Noah Fleming and
               Denis Pankratov and
               Toniann Pitassi and
               Robert Robere},
  title     = {Random {\(\Theta\)}(log n)-CNFs Are Hard for Cutting Planes},
  booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  pages     = {109--120},
  year      = {2017},
  crossref  = {DBLP:conf/focs/2017},
  url       = {https://doi.org/10.1109/FOCS.2017.19},
  doi       = {10.1109/FOCS.2017.19},
  timestamp = {Thu, 16 Nov 2017 15:01:42 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FlemingPPR17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/FlemingPPR17,
  author    = {Noah Fleming and
               Denis Pankratov and
               Toniann Pitassi and
               Robert Robere},
  title     = {Random CNFs are Hard for Cutting Planes},
  journal   = {CoRR},
  volume    = {abs/1703.02469},
  year      = {2017},
  url       = {http://arxiv.org/abs/1703.02469},
  archivePrefix = {arXiv},
  eprint    = {1703.02469},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/FlemingPPR17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/BorodinPS17,
  author    = {Allan Borodin and
               Denis Pankratov and
               Amirali Salehi{-}Abari},
  title     = {On Conceptually Simple Algorithms for Variants of Online Bipartite
               Matching},
  journal   = {CoRR},
  volume    = {abs/1706.09966},
  year      = {2017},
  url       = {http://arxiv.org/abs/1706.09966},
  archivePrefix = {arXiv},
  eprint    = {1706.09966},
  timestamp = {Mon, 17 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/BorodinPS17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-01657,
  author    = {Allan Borodin and
               Denis Pankratov and
               Amirali Salehi{-}Abari},
  title     = {A Simple {PTAS} for the Dual Bin Packing Problem and Advice Complexity
               of Its Online Version},
  journal   = {CoRR},
  volume    = {abs/1708.01657},
  year      = {2017},
  url       = {http://arxiv.org/abs/1708.01657},
  archivePrefix = {arXiv},
  eprint    = {1708.01657},
  timestamp = {Tue, 05 Sep 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1708-01657},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-03219,
  author    = {Paul Beame and
               Noah Fleming and
               Russell Impagliazzo and
               Antonina Kolokolova and
               Denis Pankratov and
               Toniann Pitassi and
               Robert Robere},
  title     = {Stabbing Planes},
  journal   = {CoRR},
  volume    = {abs/1710.03219},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.03219},
  archivePrefix = {arXiv},
  eprint    = {1710.03219},
  timestamp = {Wed, 01 Nov 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1710-03219},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FlemingPPR17,
  author    = {Noah Fleming and
               Denis Pankratov and
               Toniann Pitassi and
               Robert Robere},
  title     = {Random CNFs are Hard for Cutting Planes},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {45},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/045},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FlemingPPR17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/BeameFIKPPR17,
  author    = {Paul Beame and
               Noah Fleming and
               Russell Impagliazzo and
               Antonina Kolokolova and
               Denis Pankratov and
               Toniann Pitassi and
               Robert Robere},
  title     = {Stabbing Planes},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {151},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/151},
  timestamp = {Fri, 20 Oct 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BeameFIKPPR17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/BravermanGPW16,
  author    = {Mark Braverman and
               Ankit Garg and
               Denis Pankratov and
               Omri Weinstein},
  title     = {Information Lower Bounds via Self-Reducibility},
  journal   = {Theory Comput. Syst.},
  volume    = {59},
  number    = {2},
  pages     = {377--396},
  year      = {2016},
  url       = {https://doi.org/10.1007/s00224-015-9655-z},
  doi       = {10.1007/s00224-015-9655-z},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/BravermanGPW16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/csr/BravermanGPW13,
  author    = {Mark Braverman and
               Ankit Garg and
               Denis Pankratov and
               Omri Weinstein},
  title     = {Information Lower Bounds via Self-reducibility},
  booktitle = {Computer Science - Theory and Applications - 8th International Computer
               Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
               25-29, 2013. Proceedings},
  pages     = {183--194},
  year      = {2013},
  crossref  = {DBLP:conf/csr/2013},
  url       = {https://doi.org/10.1007/978-3-642-38536-0_16},
  doi       = {10.1007/978-3-642-38536-0_16},
  timestamp = {Wed, 17 May 2017 14:24:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csr/BravermanGPW13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanGPW13,
  author    = {Mark Braverman and
               Ankit Garg and
               Denis Pankratov and
               Omri Weinstein},
  title     = {From information to exact communication},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  pages     = {151--160},
  year      = {2013},
  crossref  = {DBLP:conf/stoc/2013},
  url       = {http://doi.acm.org/10.1145/2488608.2488628},
  doi       = {10.1145/2488608.2488628},
  timestamp = {Sun, 26 May 2013 10:30:47 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/BravermanGPW13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/BravermanGPW12,
  author    = {Mark Braverman and
               Ankit Garg and
               Denis Pankratov and
               Omri Weinstein},
  title     = {From Information to Exact Communication},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {171},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/171},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BravermanGPW12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/BravermanGPW12a,
  author    = {Mark Braverman and
               Ankit Garg and
               Denis Pankratov and
               Omri Weinstein},
  title     = {Information lower bounds via self-reducibility},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {177},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/177},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/BravermanGPW12a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toc/HatamiKP11,
  author    = {Pooya Hatami and
               Raghav Kulkarni and
               Denis Pankratov},
  title     = {Variations on the Sensitivity Conjecture},
  journal   = {Theory of Computing, Graduate Surveys},
  volume    = {4},
  pages     = {1--27},
  year      = {2011},
  url       = {https://doi.org/10.4086/toc.gs.2011.004},
  doi       = {10.4086/toc.gs.2011.004},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toc/HatamiKP11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sat/PankratovB10,
  author    = {Denis Pankratov and
               Allan Borodin},
  title     = {On the Relative Merits of Simple Local Search Methods for the {MAX-SAT}
               Problem},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
               International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
               Proceedings},
  pages     = {223--236},
  year      = {2010},
  crossref  = {DBLP:conf/sat/2010},
  url       = {https://doi.org/10.1007/978-3-642-14186-7_19},
  doi       = {10.1007/978-3-642-14186-7_19},
  timestamp = {Tue, 23 May 2017 01:08:19 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/sat/PankratovB10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-0354,
  author    = {Pooya Hatami and
               Raghav Kulkarni and
               Denis Pankratov},
  title     = {Variations on the Sensitivity Conjecture},
  journal   = {CoRR},
  volume    = {abs/1011.0354},
  year      = {2010},
  url       = {http://arxiv.org/abs/1011.0354},
  archivePrefix = {arXiv},
  eprint    = {1011.0354},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1011-0354},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/pervasive/VarshavskyPKL08,
  author    = {Alex Varshavsky and
               Denis Pankratov and
               John Krumm and
               Eyal de Lara},
  title     = {Calibree: Calibration-Free Localization Using Relative Distance Estimations},
  booktitle = {Pervasive Computing, 6th International Conference, Pervasive 2008,
               Sydney, Australia, May 19-22, 2008, Proceedings},
  pages     = {146--161},
  year      = {2008},
  crossref  = {DBLP:conf/pervasive/2008},
  url       = {https://doi.org/10.1007/978-3-540-79576-6_9},
  doi       = {10.1007/978-3-540-79576-6_9},
  timestamp = {Tue, 13 Jun 2017 10:37:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/pervasive/VarshavskyPKL08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/innovations/2018,
  editor    = {Anna R. Karlin},
  title     = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
               2018, January 11-14, 2018, Cambridge, MA, {USA}},
  series    = {LIPIcs},
  volume    = {94},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-060-6},
  isbn      = {978-3-95977-060-6},
  timestamp = {Fri, 12 Jan 2018 16:04:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/innovations/2018},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2018sosa,
  editor    = {Raimund Seidel},
  title     = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
               2018, New Orleans, LA, {USA}},
  series    = {{OASICS}},
  volume    = {61},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-064-4},
  isbn      = {978-3-95977-064-4},
  timestamp = {Fri, 12 Jan 2018 16:41:25 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2018sosa},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2017,
  editor    = {Chris Umans},
  title     = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  publisher = {{IEEE} Computer Society},
  year      = {2017},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8100284},
  isbn      = {978-1-5386-3464-6},
  timestamp = {Thu, 16 Nov 2017 15:01:42 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/csr/2013,
  editor    = {Andrei A. Bulatov and
               Arseny M. Shur},
  title     = {Computer Science - Theory and Applications - 8th International Computer
               Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
               25-29, 2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7913},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-38536-0},
  doi       = {10.1007/978-3-642-38536-0},
  isbn      = {978-3-642-38535-3},
  timestamp = {Wed, 17 May 2017 14:24:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/csr/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2013,
  editor    = {Dan Boneh and
               Tim Roughgarden and
               Joan Feigenbaum},
  title     = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2488608},
  isbn      = {978-1-4503-2029-0},
  timestamp = {Sun, 26 May 2013 10:30:47 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2013},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sat/2010,
  editor    = {Ofer Strichman and
               Stefan Szeider},
  title     = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
               International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6175},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14186-7},
  doi       = {10.1007/978-3-642-14186-7},
  isbn      = {978-3-642-14185-0},
  timestamp = {Tue, 23 May 2017 01:08:19 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/sat/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/pervasive/2008,
  editor    = {Jadwiga Indulska and
               Donald J. Patterson and
               Tom Rodden and
               Max Ott},
  title     = {Pervasive Computing, 6th International Conference, Pervasive 2008,
               Sydney, Australia, May 19-22, 2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5013},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-79576-6},
  doi       = {10.1007/978-3-540-79576-6},
  isbn      = {978-3-540-79575-9},
  timestamp = {Tue, 13 Jun 2017 10:37:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/pervasive/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier