Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Gregory B. Sorkin
@article{DBLP:journals/corr/abs-2311-05533,
author = {Alan M. Frieze and
Pu Gao and
Calum MacRury and
Pawel Pralat and
Gregory B. Sorkin},
title = {Building Hamiltonian Cycles in the Semi-Random Graph Process in Less
Than 2n Rounds},
journal = {CoRR},
volume = {abs/2311.05533},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.05533},
doi = {10.48550/ARXIV.2311.05533},
eprinttype = {arXiv},
eprint = {2311.05533},
timestamp = {Thu, 16 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-05533.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonS22,
author = {Svante Janson and
Gregory B. Sorkin},
title = {Successive minimum spanning trees},
journal = {Random Struct. Algorithms},
volume = {61},
number = {1},
pages = {126--172},
year = {2022},
url = {https://doi.org/10.1002/rsa.21047},
doi = {10.1002/RSA.21047},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Coja-OghlanLMS22,
author = {Amin Coja{-}Oghlan and
Philipp Loick and
Bal{\'{a}}zs F. Mezei and
Gregory B. Sorkin},
title = {The Ising Antiferromagnet and Max Cut on Random Regular Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {2},
pages = {1306--1342},
year = {2022},
url = {https://doi.org/10.1137/20m137999x},
doi = {10.1137/20M137999X},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Coja-OghlanLMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FriezePST21,
author = {Alan M. Frieze and
Wesley Pegden and
Gregory B. Sorkin and
Tomasz Tkocz},
title = {Minimum-Weight Combinatorial Structures Under Random Cost-Constraints},
journal = {Electron. J. Comb.},
volume = {28},
number = {1},
pages = {1},
year = {2021},
url = {https://doi.org/10.37236/9152},
doi = {10.37236/9152},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FriezePST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GerkeMS20,
author = {Stefanie Gerke and
Bal{\'{a}}zs F. Mezei and
Gregory B. Sorkin},
title = {Successive shortest paths in complete graphs with random edge weights},
journal = {Random Struct. Algorithms},
volume = {57},
number = {4},
pages = {1205--1247},
year = {2020},
url = {https://doi.org/10.1002/rsa.20962},
doi = {10.1002/RSA.20962},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GerkeMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-10483,
author = {Amin Coja{-}Oghlan and
Philipp Loick and
Bal{\'{a}}zs F. Mezei and
Gregory B. Sorkin},
title = {The Ising antiferromagnet and max cut on random regular graphs},
journal = {CoRR},
volume = {abs/2009.10483},
year = {2020},
url = {https://arxiv.org/abs/2009.10483},
eprinttype = {arXiv},
eprint = {2009.10483},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-10483.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JansonS19,
author = {Svante Janson and
Gregory B. Sorkin},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Successive Minimum Spanning Trees},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {60:1--60:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.60},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.60},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/JansonS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01151,
author = {Stefanie Gerke and
Bal{\'{a}}zs Mezei and
Gregory B. Sorkin},
title = {Successive shortest paths in complete graphs with random edge weights},
journal = {CoRR},
volume = {abs/1911.01151},
year = {2019},
url = {http://arxiv.org/abs/1911.01151},
eprinttype = {arXiv},
eprint = {1911.01151},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01151.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FriezePS18,
author = {Alan M. Frieze and
Wesley Pegden and
Gregory B. Sorkin},
title = {The Distribution of Minimum-Weight Cliques and Other Subgraphs in
Graphs with Random Edge Weights},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {3},
pages = {2115--2133},
year = {2018},
url = {https://doi.org/10.1137/17M1138303},
doi = {10.1137/17M1138303},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FriezePS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GaspersS17,
author = {Serge Gaspers and
Gregory B. Sorkin},
title = {Separate, Measure and Conquer: Faster Polynomial-Space Algorithms
for Max 2-CSP and Counting Dominating Sets},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {4},
pages = {44:1--44:36},
year = {2017},
url = {https://doi.org/10.1145/3111499},
doi = {10.1145/3111499},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GaspersS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/PittelS16,
author = {Boris G. Pittel and
Gregory B. Sorkin},
title = {The Satisfiability Threshold for \emph{k}-XORSAT},
journal = {Comb. Probab. Comput.},
volume = {25},
number = {2},
pages = {236--268},
year = {2016},
url = {https://doi.org/10.1017/S0963548315000097},
doi = {10.1017/S0963548315000097},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/PittelS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FriezeS15,
author = {Alan M. Frieze and
Gregory B. Sorkin},
title = {Efficient algorithms for three-dimensional axial and planar random
assignment problems},
journal = {Random Struct. Algorithms},
volume = {46},
number = {1},
pages = {160--196},
year = {2015},
url = {https://doi.org/10.1002/rsa.20525},
doi = {10.1002/RSA.20525},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/FriezeS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GalvinKRS15,
author = {David J. Galvin and
Jeff Kahn and
Dana Randall and
Gregory B. Sorkin},
title = {Phase coexistence and torpid mixing in the 3-coloring model on {\(\mathbb{Z}\)}\({}^{\mbox{d}}\)},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {3},
pages = {1223--1244},
year = {2015},
url = {https://doi.org/10.1137/12089538X},
doi = {10.1137/12089538X},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GalvinKRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GaspersS15,
author = {Serge Gaspers and
Gregory B. Sorkin},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Separate, Measure and Conquer: Faster Polynomial-Space Algorithms
for Max 2-CSP and Counting Dominating Sets},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {567--579},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_46},
doi = {10.1007/978-3-662-47672-7\_46},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GaspersS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GaspersS14,
author = {Serge Gaspers and
Gregory B. Sorkin},
title = {Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and
Counting Dominating Sets},
journal = {CoRR},
volume = {abs/1404.0753},
year = {2014},
url = {http://arxiv.org/abs/1404.0753},
eprinttype = {arXiv},
eprint = {1404.0753},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GaspersS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeygelzimerLLSS14,
author = {Alina Beygelzimer and
John Langford and
Yury Lifshits and
Gregory B. Sorkin and
Alexander L. Strehl},
title = {Conditional Probability Tree Estimation Analysis and Algorithms},
journal = {CoRR},
volume = {abs/1408.2031},
year = {2014},
url = {http://arxiv.org/abs/1408.2031},
eprinttype = {arXiv},
eprint = {1408.2031},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeygelzimerLLSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansonS13,
author = {Svante Janson and
Gregory B. Sorkin},
title = {{VCG} Auction Mechanism Cost Expectations and Variances},
journal = {CoRR},
volume = {abs/1310.1777},
year = {2013},
url = {http://arxiv.org/abs/1310.1777},
eprinttype = {arXiv},
eprint = {1310.1777},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansonS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/HusfeldtPSW13,
author = {Thore Husfeldt and
Ramamohan Paturi and
Gregory B. Sorkin and
Ryan Williams},
title = {Exponential Algorithms: Algorithms and Complexity Beyond Polynomial
Time (Dagstuhl Seminar 13331)},
journal = {Dagstuhl Reports},
volume = {3},
number = {8},
pages = {40--72},
year = {2013},
url = {https://doi.org/10.4230/DagRep.3.8.40},
doi = {10.4230/DAGREP.3.8.40},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/HusfeldtPSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GaspersS12,
author = {Serge Gaspers and
Gregory B. Sorkin},
title = {A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything
in between},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {1},
pages = {305--335},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.05.010},
doi = {10.1016/J.JCSS.2011.05.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GaspersS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FlaxmanGS11,
author = {Abraham Flaxman and
David Gamarnik and
Gregory B. Sorkin},
title = {First-passage percolation on a ladder graph, and the path cost in
a {VCG} auction},
journal = {Random Struct. Algorithms},
volume = {38},
number = {3},
pages = {350--364},
year = {2011},
url = {https://doi.org/10.1002/rsa.20328},
doi = {10.1002/RSA.20328},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FlaxmanGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2010P10441,
editor = {Thore Husfeldt and
Dieter Kratsch and
Ramamohan Paturi and
Gregory B. Sorkin},
title = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10441},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/portals/10441/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2010P10441.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/HusfeldtKPS10,
author = {Thore Husfeldt and
Dieter Kratsch and
Ramamohan Paturi and
Gregory B. Sorkin},
editor = {Thore Husfeldt and
Dieter Kratsch and
Ramamohan Paturi and
Gregory B. Sorkin},
title = {10441 Abstracts Collection - Exact Complexity of NP-hard Problems},
booktitle = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10441},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/2936/},
timestamp = {Thu, 10 Jun 2021 13:02:09 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/HusfeldtKPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-4239,
author = {Alan M. Frieze and
Gregory B. Sorkin},
title = {Average case performance of heuristics for multi-dimensional assignment
problems},
journal = {CoRR},
volume = {abs/1004.4239},
year = {2010},
url = {http://arxiv.org/abs/1004.4239},
eprinttype = {arXiv},
eprint = {1004.4239},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-4239.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-0390,
author = {Alan M. Frieze and
Gregory B. Sorkin},
title = {Average-case performance of heuristics for three-dimensional assignment
problems},
journal = {CoRR},
volume = {abs/1008.0390},
year = {2010},
url = {http://arxiv.org/abs/1008.0390},
eprinttype = {arXiv},
eprint = {1008.0390},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-0390.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-1260,
author = {Alexander D. Scott and
Gregory B. Sorkin},
title = {Structure of random r-SAT below the pure literal threshold},
journal = {CoRR},
volume = {abs/1008.1260},
year = {2010},
url = {http://arxiv.org/abs/1008.1260},
eprinttype = {arXiv},
eprint = {1008.1260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-1260.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/SorkinSZ09,
author = {Gregory B. Sorkin and
Angelika Steger and
Rico Zenklusen},
title = {A tight bound on the collection of edges in MSTs of induced subgraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {99},
number = {2},
pages = {428--435},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.08.008},
doi = {10.1016/J.JCTB.2008.08.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/SorkinSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ScottS09,
author = {Alexander D. Scott and
Gregory B. Sorkin},
title = {Polynomial constraint satisfaction problems, graph bisection, and
the Ising partition function},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {4},
pages = {45:1--45:27},
year = {2009},
url = {https://doi.org/10.1145/1597036.1597049},
doi = {10.1145/1597036.1597049},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ScottS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CheboluFMS09,
author = {Prasad Chebolu and
Alan M. Frieze and
P{\'{a}}ll Melsted and
Gregory B. Sorkin},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Average-Case Analyses of Vickrey Costs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {434--447},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_33},
doi = {10.1007/978-3-642-03685-9\_33},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CheboluFMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GaspersS09,
author = {Serge Gaspers and
Gregory B. Sorkin},
editor = {Claire Mathieu},
title = {A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything
in between},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {606--615},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.67},
doi = {10.1137/1.9781611973068.67},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GaspersS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/BeygelzimerLLSS09,
author = {Alina Beygelzimer and
John Langford and
Yury Lifshits and
Gregory B. Sorkin and
Alexander L. Strehl},
editor = {Jeff A. Bilmes and
Andrew Y. Ng},
title = {Conditional Probability Tree Estimation Analysis and Algorithms},
booktitle = {{UAI} 2009, Proceedings of the Twenty-Fifth Conference on Uncertainty
in Artificial Intelligence, Montreal, QC, Canada, June 18-21, 2009},
pages = {51--58},
publisher = {{AUAI} Press},
year = {2009},
url = {https://www.auai.org/uai2009/papers/UAI2009\_0203\_204f4f08e911ef8031953205360416f9.pdf},
timestamp = {Tue, 25 Oct 2022 12:03:45 +0200},
biburl = {https://dblp.org/rec/conf/uai/BeygelzimerLLSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-4217,
author = {Alina Beygelzimer and
John Langford and
Yury Lifshits and
Gregory B. Sorkin and
Alexander L. Strehl},
title = {Conditional Probability Tree Estimation Analysis and Algorithms},
journal = {CoRR},
volume = {abs/0903.4217},
year = {2009},
url = {http://arxiv.org/abs/0903.4217},
eprinttype = {arXiv},
eprint = {0903.4217},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-4217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-3527,
author = {Serge Gaspers and
Gregory B. Sorkin},
title = {A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything
in between},
journal = {CoRR},
volume = {abs/0906.3527},
year = {2009},
url = {http://arxiv.org/abs/0906.3527},
eprinttype = {arXiv},
eprint = {0906.3527},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-3527.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/BalcanBBCLS08,
author = {Maria{-}Florina Balcan and
Nikhil Bansal and
Alina Beygelzimer and
Don Coppersmith and
John Langford and
Gregory B. Sorkin},
title = {Robust reductions from ranking to classification},
journal = {Mach. Learn.},
volume = {72},
number = {1-2},
pages = {139--153},
year = {2008},
url = {https://doi.org/10.1007/s10994-008-5058-6},
doi = {10.1007/S10994-008-5058-6},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/BalcanBBCLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Sorkin08,
author = {Gregory B. Sorkin},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {The Power of Choice in a Generalized P{\'{o}}lya Urn Model},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {571--583},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_45},
doi = {10.1007/978-3-540-85363-3\_45},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Sorkin08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CooperFS07,
author = {Colin Cooper and
Alan M. Frieze and
Gregory B. Sorkin},
title = {Random 2-SAT with Prescribed Literal Degrees},
journal = {Algorithmica},
volume = {48},
number = {3},
pages = {249--265},
year = {2007},
url = {https://doi.org/10.1007/s00453-007-0082-7},
doi = {10.1007/S00453-007-0082-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CooperFS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ScottS07,
author = {Alexander D. Scott and
Gregory B. Sorkin},
title = {Linear-programming design and analysis of fast algorithms for Max
2-CSP},
journal = {Discret. Optim.},
volume = {4},
number = {3-4},
pages = {260--287},
year = {2007},
url = {https://doi.org/10.1016/j.disopt.2007.08.001},
doi = {10.1016/J.DISOPT.2007.08.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/ScottS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeS07,
author = {Alan M. Frieze and
Gregory B. Sorkin},
title = {The Probabilistic Relationship Between the Assignment and Asymmetric
Traveling Salesman Problems},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {5},
pages = {1435--1452},
year = {2007},
url = {https://doi.org/10.1137/S0097539701391518},
doi = {10.1137/S0097539701391518},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FriezeS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BalcanBBCLS07,
author = {Maria{-}Florina Balcan and
Nikhil Bansal and
Alina Beygelzimer and
Don Coppersmith and
John Langford and
Gregory B. Sorkin},
editor = {Nader H. Bshouty and
Claudio Gentile},
title = {Robust Reductions from Ranking to Classification},
booktitle = {Learning Theory, 20th Annual Conference on Learning Theory, {COLT}
2007, San Diego, CA, USA, June 13-15, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4539},
pages = {604--619},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72927-3\_43},
doi = {10.1007/978-3-540-72927-3\_43},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/BalcanBBCLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ScottS06a,
author = {Alexander D. Scott and
Gregory B. Sorkin},
title = {Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear
Expected Time},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {1-2},
pages = {281--315},
year = {2006},
url = {https://doi.org/10.1017/S096354830500725X},
doi = {10.1017/S096354830500725X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ScottS06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/GunlukKLSS06,
author = {Oktay G{\"{u}}nl{\"{u}}k and
Tracy Kimbrel and
Laszlo Lad{\'{a}}nyi and
Baruch Schieber and
Gregory B. Sorkin},
title = {Vehicle Routing and Staffing for Sedan Service},
journal = {Transp. Sci.},
volume = {40},
number = {3},
pages = {313--326},
year = {2006},
url = {https://doi.org/10.1287/trsc.1050.0122},
doi = {10.1287/TRSC.1050.0122},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/transci/GunlukKLSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ScottS06,
author = {Alexander D. Scott and
Gregory B. Sorkin},
editor = {Yossi Azar and
Thomas Erlebach},
title = {An LP-Designed Algorithm for Constraint Satisfaction},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {588--599},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_53},
doi = {10.1007/11841036\_53},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/ScottS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/FlaxmanGS06,
author = {Abraham Flaxman and
David Gamarnik and
Gregory B. Sorkin},
editor = {Paul G. Spirakis and
Marios Mavronicolas and
Spyros C. Kontogiannis},
title = {First-Passage Percolation on a Width-2 Strip and the Path Cost in
a {VCG} Auction},
booktitle = {Internet and Network Economics, Second International Workshop, {WINE}
2006, Patras, Greece, December 15-17, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4286},
pages = {99--111},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944874\_10},
doi = {10.1007/11944874\_10},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/FlaxmanGS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604079,
author = {Alexander D. Scott and
Gregory B. Sorkin},
title = {Polynomial Constraint Satisfaction: {A} Framework for Counting and
Sampling CSPs and Other Problems},
journal = {CoRR},
volume = {abs/cs/0604079},
year = {2006},
url = {http://arxiv.org/abs/cs/0604079},
eprinttype = {arXiv},
eprint = {cs/0604079},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604079.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604080,
author = {Alexander D. Scott and
Gregory B. Sorkin},
title = {Linear-programming design and analysis of fast algorithms for Max
2-Sat and Max 2-CSP},
journal = {CoRR},
volume = {abs/cs/0604080},
year = {2006},
url = {http://arxiv.org/abs/cs/0604080},
eprinttype = {arXiv},
eprint = {cs/0604080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FlaxmanGS05,
author = {Abraham D. Flaxman and
David Gamarnik and
Gregory B. Sorkin},
title = {Embracing the giant component},
journal = {Random Struct. Algorithms},
volume = {27},
number = {3},
pages = {277--289},
year = {2005},
url = {https://doi.org/10.1002/rsa.20070},
doi = {10.1002/RSA.20070},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FlaxmanGS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ArratiaBS04,
author = {Richard Arratia and
B{\'{e}}la Bollob{\'{a}}s and
Gregory B. Sorkin},
title = {A Two-Variable Interlace Polynomial},
journal = {Comb.},
volume = {24},
number = {4},
pages = {567--584},
year = {2004},
url = {https://doi.org/10.1007/s00493-004-0035-6},
doi = {10.1007/S00493-004-0035-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ArratiaBS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FlaxmanHS04,
author = {Abraham Flaxman and
Aram W. Harrow and
Gregory B. Sorkin},
title = {Strings with Maximally Many Distinct Subsequences and Substrings},
journal = {Electron. J. Comb.},
volume = {11},
number = {1},
year = {2004},
url = {https://doi.org/10.37236/1761},
doi = {10.37236/1761},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FlaxmanHS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ArratiaBS04,
author = {Richard Arratia and
B{\'{e}}la Bollob{\'{a}}s and
Gregory B. Sorkin},
title = {The interlace polynomial of a graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {92},
number = {2},
pages = {199--233},
year = {2004},
url = {https://doi.org/10.1016/j.jctb.2004.03.003},
doi = {10.1016/J.JCTB.2004.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ArratiaBS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CoppersmithGHS04,
author = {Don Coppersmith and
David Gamarnik and
Mohammad Taghi Hajiaghayi and
Gregory B. Sorkin},
title = {Random {MAX} SAT, random {MAX} CUT, and their phase transitions},
journal = {Random Struct. Algorithms},
volume = {24},
number = {4},
pages = {502--545},
year = {2004},
url = {https://doi.org/10.1002/rsa.20015},
doi = {10.1002/RSA.20015},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CoppersmithGHS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FlaxmanGS04,
author = {Abraham Flaxman and
David Gamarnik and
Gregory B. Sorkin},
editor = {Martin Farach{-}Colton},
title = {Embracing the Giant Component},
booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2976},
pages = {69--79},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24698-5\_11},
doi = {10.1007/978-3-540-24698-5\_11},
timestamp = {Fri, 09 Apr 2021 18:42:35 +0200},
biburl = {https://dblp.org/rec/conf/latin/FlaxmanGS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/ScottS03,
author = {Alex D. Scott and
Gregory B. Sorkin},
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Amit Sahai},
title = {Faster Algorithms for {MAX} {CUT} and {MAX} CSP, with Polynomial Expected
Time for Sparse Instances},
booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms
and Techniques, 6th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2764},
pages = {382--395},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45198-3\_32},
doi = {10.1007/978-3-540-45198-3\_32},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/ScottS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CoppersmithGHS03,
author = {Don Coppersmith and
David Gamarnik and
Mohammad Taghi Hajiaghayi and
Gregory B. Sorkin},
title = {Random {MAX} SAT, random {MAX} CUT, and their phase transitions},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {364--373},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644167},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CoppersmithGHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AlmS02,
author = {Sven Erick Alm and
Gregory B. Sorkin},
title = {Exact Expectations And Distributions For The Random Assignment Problem},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {217--248},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005114},
doi = {10.1017/S0963548302005114},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AlmS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CooperFS02,
author = {Colin Cooper and
Alan M. Frieze and
Gregory B. Sorkin},
editor = {David Eppstein},
title = {A note on random 2-SAT with prescribed literal degrees},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {316--320},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545423},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CooperFS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/saga/Sorkin01,
author = {Gregory B. Sorkin},
editor = {Kathleen Steinh{\"{o}}fel},
title = {Some Notes on Random Satisfiability},
booktitle = {Stochastic Algorithms: Foundations and Applications, International
Symposium, {SAGA} 2001 Berlin, Germany, December 13-14, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2264},
pages = {117--130},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45322-9\_8},
doi = {10.1007/3-540-45322-9\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/saga/Sorkin01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FriezeS01,
author = {Alan M. Frieze and
Gregory B. Sorkin},
editor = {S. Rao Kosaraju},
title = {The probabilistic relationship between the assignment and asymmetric
traveling salesman problems},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {652--660},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365557},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/FriezeS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArratiaBCS00,
author = {Richard Arratia and
B{\'{e}}la Bollob{\'{a}}s and
Don Coppersmith and
Gregory B. Sorkin},
title = {Euler circuits and {DNA} sequencing by hybridization},
journal = {Discret. Appl. Math.},
volume = {104},
number = {1-3},
pages = {63--96},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(00)00190-6},
doi = {10.1016/S0166-218X(00)00190-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ArratiaBCS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TrevisanSSW00,
author = {Luca Trevisan and
Gregory B. Sorkin and
Madhu Sudan and
David P. Williamson},
title = {Gadgets, Approximation, and Linear Programming},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {2074--2097},
year = {2000},
url = {https://doi.org/10.1137/S0097539797328847},
doi = {10.1137/S0097539797328847},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TrevisanSSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AchlioptasS00,
author = {Dimitris Achlioptas and
Gregory B. Sorkin},
title = {Optimal myopic algorithms for random 3-SAT},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {590--600},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892327},
doi = {10.1109/SFCS.2000.892327},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AchlioptasS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ArratiaBS00,
author = {Richard Arratia and
B{\'{e}}la Bollob{\'{a}}s and
Gregory B. Sorkin},
editor = {David B. Shmoys},
title = {The interlace polynomial: a new graph polynomial},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {237--245},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338258},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ArratiaBS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CoppersmithS99,
author = {Don Coppersmith and
Gregory B. Sorkin},
title = {Constructive bounds and exact expectations for the random assignment
problem},
journal = {Random Struct. Algorithms},
volume = {15},
number = {2},
pages = {113--144},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1098-2418(199909)15:2\&\#60;113::AID-RSA1\&\#62;3.0.CO;2-S},
doi = {10.1002/(SICI)1098-2418(199909)15:2\&\#60;113::AID-RSA1\&\#62;3.0.CO;2-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CoppersmithS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JerrumS98,
author = {Mark Jerrum and
Gregory B. Sorkin},
title = {The Metropolis Algorithm for Graph Bisection},
journal = {Discret. Appl. Math.},
volume = {82},
number = {1-3},
pages = {155--175},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(97)00133-9},
doi = {10.1016/S0166-218X(97)00133-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JerrumS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GoldbergGPS98,
author = {Leslie Ann Goldberg and
Paul W. Goldberg and
Cynthia A. Phillips and
Gregory B. Sorkin},
title = {Constructing Computer Virus Phylogenies},
journal = {J. Algorithms},
volume = {26},
number = {1},
pages = {188--208},
year = {1998},
url = {https://doi.org/10.1006/jagm.1997.0897},
doi = {10.1006/JAGM.1997.0897},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GoldbergGPS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/CoppersmithS98,
author = {Don Coppersmith and
Gregory B. Sorkin},
editor = {Michael Luby and
Jos{\'{e}} D. P. Rolim and
Maria J. Serna},
title = {Constructive Bounds and Exact Expectations for the Random Assignment
Problem},
booktitle = {Randomization and Approximation Techniques in Computer Science, Second
International Workshop, RANDOM'98, Barcelona, Spain, October 8-10,
1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1518},
pages = {319--330},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49543-6\_25},
doi = {10.1007/3-540-49543-6\_25},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/CoppersmithS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GoldbergGPS96,
author = {Leslie Ann Goldberg and
Paul W. Goldberg and
Cynthia A. Phillips and
Gregory B. Sorkin},
editor = {Daniel S. Hirschberg and
Eugene W. Myers},
title = {Constructing Computer Virus Phylogenies},
booktitle = {Combinatorial Pattern Matching, 7th Annual Symposium, {CPM} 96, Laguna
Beach, California, USA, June 10-12, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1075},
pages = {253--270},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61258-0\_19},
doi = {10.1007/3-540-61258-0\_19},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GoldbergGPS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TrevisanSSW96,
author = {Luca Trevisan and
Gregory B. Sorkin and
Madhu Sudan and
David P. Williamson},
title = {Gadgets, Approximation, and Linear Programming (extended abstract)},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {617--626},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548521},
doi = {10.1109/SFCS.1996.548521},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TrevisanSSW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/KephartSACTW95,
author = {Jeffrey O. Kephart and
Gregory B. Sorkin and
William C. Arnold and
David M. Chess and
Gerald Tesauro and
Steve R. White},
title = {Biologically Inspired Defenses Against Computer Viruses},
booktitle = {Proceedings of the Fourteenth International Joint Conference on Artificial
Intelligence, {IJCAI} 95, Montr{\'{e}}al Qu{\'{e}}bec, Canada,
August 20-25 1995, 2 Volumes},
pages = {985--996},
publisher = {Morgan Kaufmann},
year = {1995},
url = {http://ijcai.org/Proceedings/95-1/Papers/127.pdf},
timestamp = {Tue, 20 Aug 2019 16:17:30 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/KephartSACTW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JerrumS93,
author = {Mark Jerrum and
Gregory B. Sorkin},
title = {Simulated Annealing for Graph Bisection},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {94--103},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366878},
doi = {10.1109/SFCS.1993.366878},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JerrumS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Sorkin91,
author = {Gregory B. Sorkin},
title = {Efficient Simulated Annealing on Fractal Energy Landscapes},
journal = {Algorithmica},
volume = {6},
number = {3},
pages = {367--418},
year = {1991},
url = {https://doi.org/10.1007/BF01759051},
doi = {10.1007/BF01759051},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Sorkin91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/Sorkin87,
author = {Gregory B. Sorkin},
title = {Asymptotically Perfect Trivial Global Routing: {A} Stochastic Analysis},
journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
volume = {6},
number = {5},
pages = {820--827},
year = {1987},
url = {https://doi.org/10.1109/TCAD.1987.1270325},
doi = {10.1109/TCAD.1987.1270325},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcad/Sorkin87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dac/HellerSM82,
author = {William R. Heller and
Gregory B. Sorkin and
Klim Maling},
editor = {James S. Crabbe and
Charles E. Radke and
Hillel Ofek},
title = {The planar package planner for system designers},
booktitle = {Proceedings of the 19th Design Automation Conference, {DAC} '82, Las
Vegas, Nevada, USA, June 14-16, 1982},
pages = {253--260},
publisher = {{ACM/IEEE}},
year = {1982},
url = {https://doi.org/10.1145/800263.809215},
doi = {10.1145/800263.809215},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dac/HellerSM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 18:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
