BibTeX records: Will Perkins

download as .bib file

@article{DBLP:journals/cpc/CohenPT17,
  author    = {Emma Cohen and
               Will Perkins and
               Prasad Tetali},
  title     = {On the Widom-Rowlinson Occupancy Fraction in Regular Graphs},
  journal   = {Combinatorics, Probability {\&} Computing},
  volume    = {26},
  number    = {2},
  pages     = {183--194},
  year      = {2017},
  url       = {https://doi.org/10.1017/S0963548316000249},
  doi       = {10.1017/S0963548316000249},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/cpc/CohenPT17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CohenCPT17,
  author    = {Emma Cohen and
               P{\'{e}}ter Csikv{\'{a}}ri and
               Will Perkins and
               Prasad Tetali},
  title     = {The Widom-Rowlinson model, the hard-core model and the extremality
               of the complete graph},
  journal   = {Eur. J. Comb.},
  volume    = {62},
  pages     = {70--76},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.ejc.2016.11.003},
  doi       = {10.1016/j.ejc.2016.11.003},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/CohenCPT17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Coja-OghlanPS17,
  author    = {Amin Coja{-}Oghlan and
               Will Perkins and
               Kathrin Skubch},
  title     = {Limits of discrete distributions and Gibbs measures on random graphs},
  journal   = {Eur. J. Comb.},
  volume    = {66},
  pages     = {37--59},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.ejc.2017.06.012},
  doi       = {10.1016/j.ejc.2017.06.012},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/ejc/Coja-OghlanPS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DaviesJRP17,
  author    = {Ewan Davies and
               Matthew Jenssen and
               Barnaby Roberts and
               Will Perkins},
  title     = {Tight bounds on the coefficients of partition functions via stability},
  journal   = {Electronic Notes in Discrete Mathematics},
  volume    = {61},
  pages     = {317--321},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.endm.2017.06.054},
  doi       = {10.1016/j.endm.2017.06.054},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/endm/DaviesJRP17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/DaviesJPR17,
  author    = {Ewan Davies and
               Matthew Jenssen and
               Will Perkins and
               Barnaby Roberts},
  title     = {Independent sets, matchings, and occupancy fractions},
  journal   = {J. London Math. Society},
  volume    = {96},
  number    = {1},
  pages     = {47--66},
  year      = {2017},
  url       = {https://doi.org/10.1112/jlms.12056},
  doi       = {10.1112/jlms.12056},
  timestamp = {Thu, 03 May 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jlms/DaviesJPR17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Coja-OghlanKPZ17,
  author    = {Amin Coja{-}Oghlan and
               Florent Krzakala and
               Will Perkins and
               Lenka Zdeborov{\'{a}}},
  title     = {Information-theoretic thresholds from the cavity method},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {146--157},
  year      = {2017},
  crossref  = {DBLP:conf/stoc/2017},
  url       = {http://doi.acm.org/10.1145/3055399.3055420},
  doi       = {10.1145/3055399.3055420},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/Coja-OghlanKPZ17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Coja-OghlanP16,
  author    = {Amin Coja{-}Oghlan and
               Will Perkins},
  title     = {Belief Propagation on Replica Symmetric Random Factor Graph Models},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
               France},
  pages     = {27:1--27:15},
  year      = {2016},
  crossref  = {DBLP:conf/approx/2016},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.27},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2016.27},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/approx/Coja-OghlanP16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FlorescuP16,
  author    = {Laura Florescu and
               Will Perkins},
  title     = {Spectral thresholds in the bipartite stochastic block model},
  booktitle = {Proceedings of the 29th Conference on Learning Theory, {COLT} 2016,
               New York, USA, June 23-26, 2016},
  pages     = {943--959},
  year      = {2016},
  crossref  = {DBLP:conf/colt/2016},
  url       = {http://jmlr.org/proceedings/papers/v49/florescu16.html},
  timestamp = {Wed, 13 Jul 2016 17:28:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/FlorescuP16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Coja-OghlanP16,
  author    = {Amin Coja{-}Oghlan and
               Will Perkins},
  title     = {Belief Propagation on replica symmetric random factor graph models},
  journal   = {CoRR},
  volume    = {abs/1603.08191},
  year      = {2016},
  url       = {http://arxiv.org/abs/1603.08191},
  archivePrefix = {arXiv},
  eprint    = {1603.08191},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Coja-OghlanP16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Coja-OghlanKPZ16,
  author    = {Amin Coja{-}Oghlan and
               Florent Krzakala and
               Will Perkins and
               Lenka Zdeborov{\'{a}}},
  title     = {Information-theoretic thresholds from the cavity method},
  journal   = {CoRR},
  volume    = {abs/1611.00814},
  year      = {2016},
  url       = {http://arxiv.org/abs/1611.00814},
  archivePrefix = {arXiv},
  eprint    = {1611.00814},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Coja-OghlanKPZ16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Perkins15,
  author    = {Will Perkins},
  title     = {Random \emph{k}-SAT and the power of two choices},
  journal   = {Random Struct. Algorithms},
  volume    = {47},
  number    = {1},
  pages     = {163--173},
  year      = {2015},
  url       = {https://doi.org/10.1002/rsa.20534},
  doi       = {10.1002/rsa.20534},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/rsa/Perkins15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/FeldmanPV15,
  author    = {Vitaly Feldman and
               Will Perkins and
               Santosh Vempala},
  title     = {Subsampled Power Iteration: a Unified Algorithm for Block Models and
               Planted CSP's},
  booktitle = {Advances in Neural Information Processing Systems 28: Annual Conference
               on Neural Information Processing Systems 2015, December 7-12, 2015,
               Montreal, Quebec, Canada},
  pages     = {2836--2844},
  year      = {2015},
  crossref  = {DBLP:conf/nips/2015},
  url       = {http://papers.nips.cc/paper/5835-subsampled-power-iteration-a-unified-algorithm-for-block-models-and-planted-csps},
  timestamp = {Fri, 08 Apr 2016 19:32:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/nips/FeldmanPV15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanPV15,
  author    = {Vitaly Feldman and
               Will Perkins and
               Santosh Vempala},
  title     = {On the Complexity of Random Satisfiability Problems with Planted Solutions},
  booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
  pages     = {77--86},
  year      = {2015},
  crossref  = {DBLP:conf/stoc/2015},
  url       = {http://doi.acm.org/10.1145/2746539.2746577},
  doi       = {10.1145/2746539.2746577},
  timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/FeldmanPV15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FlorescuP15,
  author    = {Laura Florescu and
               Will Perkins},
  title     = {Spectral Thresholds in the Bipartite Stochastic Block Model},
  journal   = {CoRR},
  volume    = {abs/1506.06737},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.06737},
  archivePrefix = {arXiv},
  eprint    = {1506.06737},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/FlorescuP15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BradonjicP14,
  author    = {Milan Bradonjic and
               Will Perkins},
  title     = {On Sharp Thresholds in Random Geometric Graphs},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
               Spain},
  pages     = {500--514},
  year      = {2014},
  crossref  = {DBLP:conf/approx/2014},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.500},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2014.500},
  timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/BradonjicP14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmanPV14,
  author    = {Vitaly Feldman and
               Will Perkins and
               Santosh Vempala},
  title     = {Subsampled Power Iteration: a New Algorithm for Block Models and Planted
               CSP's},
  journal   = {CoRR},
  volume    = {abs/1407.2774},
  year      = {2014},
  url       = {http://arxiv.org/abs/1407.2774},
  archivePrefix = {arXiv},
  eprint    = {1407.2774},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/FeldmanPV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FeldmanPV14,
  author    = {Vitaly Feldman and
               Will Perkins and
               Santosh Vempala},
  title     = {On the Complexity of Random Satisfiability Problems with Planted Solutions},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {148},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/148},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/FeldmanPV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Perkins13,
  author    = {Will Perkins},
  title     = {The forgetfulness of balls and bins},
  journal   = {Random Struct. Algorithms},
  volume    = {42},
  number    = {2},
  pages     = {250--267},
  year      = {2013},
  url       = {https://doi.org/10.1002/rsa.20408},
  doi       = {10.1002/rsa.20408},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/rsa/Perkins13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangPS13,
  author    = {Mihyun Kang and
               Will Perkins and
               Joel Spencer},
  title     = {The Bohman-Frieze process near criticality},
  journal   = {Random Struct. Algorithms},
  volume    = {43},
  number    = {2},
  pages     = {221--250},
  year      = {2013},
  url       = {https://doi.org/10.1002/rsa.20437},
  doi       = {10.1002/rsa.20437},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/rsa/KangPS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PerkinsR13,
  author    = {Will Perkins and
               Lev Reyzin},
  title     = {On the Resilience of Bipartite Networks},
  journal   = {CoRR},
  volume    = {abs/1306.5720},
  year      = {2013},
  url       = {http://arxiv.org/abs/1306.5720},
  archivePrefix = {arXiv},
  eprint    = {1306.5720},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/PerkinsR13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BradonjicP13,
  author    = {Milan Bradonjic and
               Will Perkins},
  title     = {Thresholds for Random Geometric k-SAT},
  journal   = {CoRR},
  volume    = {abs/1308.1084},
  year      = {2013},
  url       = {http://arxiv.org/abs/1308.1084},
  archivePrefix = {arXiv},
  eprint    = {1308.1084},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BradonjicP13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeldmanPV13,
  author    = {Vitaly Feldman and
               Will Perkins and
               Santosh Vempala},
  title     = {On the Complexity of Random Satisfiability Problems with Planted Solutions},
  journal   = {CoRR},
  volume    = {abs/1311.4821},
  year      = {2013},
  url       = {http://arxiv.org/abs/1311.4821},
  archivePrefix = {arXiv},
  eprint    = {1311.4821},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/FeldmanPV13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-5313,
  author    = {Will Perkins},
  title     = {Random k-SAT and the Power of Two Choices},
  journal   = {CoRR},
  volume    = {abs/1209.5313},
  year      = {2012},
  url       = {http://arxiv.org/abs/1209.5313},
  archivePrefix = {arXiv},
  eprint    = {1209.5313},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1209-5313},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DinurKPS10,
  author    = {Irit Dinur and
               Subhash Khot and
               Will Perkins and
               Muli Safra},
  title     = {Hardness of Finding Independent Sets in Almost 3-Colorable Graphs},
  booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  pages     = {212--221},
  year      = {2010},
  crossref  = {DBLP:conf/focs/2010},
  url       = {https://doi.org/10.1109/FOCS.2010.84},
  doi       = {10.1109/FOCS.2010.84},
  timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/DinurKPS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2017,
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3055399},
  doi       = {10.1145/3055399},
  isbn      = {978-1-4503-4528-6},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2016,
  editor    = {Klaus Jansen and
               Claire Mathieu and
               Jos{\'{e}} D. P. Rolim and
               Chris Umans},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
               France},
  series    = {LIPIcs},
  volume    = {60},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-018-7},
  isbn      = {978-3-95977-018-7},
  timestamp = {Wed, 14 Sep 2016 16:02:46 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colt/2016,
  editor    = {Vitaly Feldman and
               Alexander Rakhlin and
               Ohad Shamir},
  title     = {Proceedings of the 29th Conference on Learning Theory, {COLT} 2016,
               New York, USA, June 23-26, 2016},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {49},
  publisher = {JMLR.org},
  year      = {2016},
  url       = {http://jmlr.org/proceedings/papers/v49/},
  timestamp = {Wed, 13 Jul 2016 17:28:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/nips/2015,
  editor    = {Corinna Cortes and
               Neil D. Lawrence and
               Daniel D. Lee and
               Masashi Sugiyama and
               Roman Garnett},
  title     = {Advances in Neural Information Processing Systems 28: Annual Conference
               on Neural Information Processing Systems 2015, December 7-12, 2015,
               Montreal, Quebec, Canada},
  year      = {2015},
  url       = {http://papers.nips.cc/book/advances-in-neural-information-processing-systems-28-2015},
  timestamp = {Fri, 08 Apr 2016 19:32:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/nips/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2015,
  editor    = {Rocco A. Servedio and
               Ronitt Rubinfeld},
  title     = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
  publisher = {{ACM}},
  year      = {2015},
  url       = {http://dl.acm.org/citation.cfm?id=2746539},
  isbn      = {978-1-4503-3536-2},
  timestamp = {Wed, 10 Jun 2015 17:10:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2014,
  editor    = {Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Nikhil R. Devanur and
               Cristopher Moore},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
               Spain},
  series    = {LIPIcs},
  volume    = {28},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2014},
  isbn      = {978-3-939897-74-3},
  timestamp = {Wed, 17 Sep 2014 16:43:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2010,
  title     = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2010},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376},
  isbn      = {978-0-7695-4244-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier