The planar package planner for system designers. - William R. Heller; Gregory B. Sorkin; Klim Maling (DAC, 1982)

Asymptotically Perfect Trivial Global Routing: A Stochastic Analysis. - Gregory B. Sorkin (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987)

Efficient Simulated Annealing on Fractal Energy Landscapes. - Gregory B. Sorkin (Algorithmica, 1991)

Simulated Annealing for Graph Bisection - Mark Jerrum; Gregory B. Sorkin (FOCS, 1993)

Biologically Inspired Defenses Against Computer Viruses. - Jeffrey O. Kephart; Gregory B. Sorkin; William C. Arnold; David M. Chess; Gerald Tesauro; Steve R. White (IJCAI (1), 1995)

Gadgets, Approximation, and Linear Programming (extended abstract). - Luca Trevisan 001; Gregory B. Sorkin; Madhu Sudan 001; David P. Williamson (FOCS, 1996)

The Metropolis Algorithm for Graph Bisection. - Mark Jerrum; Gregory B. Sorkin (Discret. Appl. Math., 1998)

Constructing Computer Virus Phylogenies. - Leslie Ann Goldberg; Paul W. Goldberg; Cynthia A. Phillips; Gregory B. Sorkin (J. Algorithms, 1998)

Constructive bounds and exact expectations for the random assignment problem. - Don Coppersmith; Gregory B. Sorkin (Random Struct. Algorithms, 1999)

Optimal myopic algorithms for random 3-SAT. - Dimitris Achlioptas; Gregory B. Sorkin (FOCS, 2000)

The interlace polynomial: a new graph polynomial. - Richard Arratia; Béla Bollobás; Gregory B. Sorkin (SODA, 2000)

Euler circuits and DNA sequencing by hybridization. - Richard Arratia; Béla Bollobás; Don Coppersmith; Gregory B. Sorkin (Discret. Appl. Math., 2000)

Gadgets, Approximation, and Linear Programming. - Luca Trevisan 001; Gregory B. Sorkin; Madhu Sudan 001; David P. Williamson (SIAM J. Comput., 2000)

Some Notes on Random Satisfiability. - Gregory B. Sorkin (SAGA, 2001)

A note on random 2-SAT with prescribed literal degrees. - Colin Cooper; Alan M. Frieze; Gregory B. Sorkin (SODA, 2002)

Exact Expectations And Distributions For The Random Assignment Problem. - Sven Erick Alm; Gregory B. Sorkin (Comb. Probab. Comput., 2002)

Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. - Alex D. Scott; Gregory B. Sorkin (RANDOM-APPROX, 2003)

A Two-Variable Interlace Polynomial. - Richard Arratia; Béla Bollobás; Gregory B. Sorkin (Comb., 2004)

Strings with Maximally Many Distinct Subsequences and Substrings. - Abraham Flaxman; Aram W. Harrow; Gregory B. Sorkin (Electron. J. Comb., 2004)

The interlace polynomial of a graph. - Richard Arratia; Béla Bollobás; Gregory B. Sorkin (J. Comb. Theory B, 2004)

Random MAX SAT, random MAX CUT, and their phase transitions. - Don Coppersmith; David Gamarnik; Mohammad Taghi Hajiaghayi; Gregory B. Sorkin (Random Struct. Algorithms, 2004)

Embracing the giant component. - Abraham D. Flaxman; David Gamarnik; Gregory B. Sorkin (Random Struct. Algorithms, 2005)

An LP-Designed Algorithm for Constraint Satisfaction. - Alexander D. Scott; Gregory B. Sorkin (ESA, 2006)

First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. - Abraham Flaxman; David Gamarnik; Gregory B. Sorkin (WINE, 2006)

Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems - Alexander D. Scott; Gregory B. Sorkin (CoRR, 2006)

Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP - Alexander D. Scott; Gregory B. Sorkin (CoRR, 2006)

Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time. - Alexander D. Scott; Gregory B. Sorkin (Comb. Probab. Comput., 2006)

Vehicle Routing and Staffing for Sedan Service. - Oktay Günlük; Tracy Kimbrel; Laszlo Ladányi; Baruch Schieber; Gregory B. Sorkin (Transp. Sci., 2006)

Random 2-SAT with Prescribed Literal Degrees. - Colin Cooper; Alan M. Frieze; Gregory B. Sorkin (Algorithmica, 2007)

Linear-programming design and analysis of fast algorithms for Max 2-CSP. - Alexander D. Scott; Gregory B. Sorkin (Discret. Optim., 2007)

The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. - Alan M. Frieze; Gregory B. Sorkin (SIAM J. Comput., 2007)

The Power of Choice in a Generalized Pólya Urn Model. - Gregory B. Sorkin (APPROX-RANDOM, 2008)

Robust reductions from ranking to classification. - Maria-Florina Balcan; Nikhil Bansal 001; Alina Beygelzimer; Don Coppersmith; John Langford 001; Gregory B. Sorkin (Mach. Learn., 2008)

Average-Case Analyses of Vickrey Costs. - Prasad Chebolu; Alan M. Frieze; Páll Melsted; Gregory B. Sorkin (APPROX-RANDOM, 2009)

Conditional Probability Tree Estimation Analysis and Algorithms. - Alina Beygelzimer; John Langford 001; Yury Lifshits; Gregory B. Sorkin; Alexander L. Strehl (UAI, 2009)

A tight bound on the collection of edges in MSTs of induced subgraphs. - Gregory B. Sorkin; Angelika Steger; Rico Zenklusen (J. Comb. Theory B, 2009)

Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. - Alexander D. Scott; Gregory B. Sorkin (ACM Trans. Algorithms, 2009)

10441 Abstracts Collection - Exact Complexity of NP-hard Problems. - Thore Husfeldt; Dieter Kratsch; Ramamohan Paturi; Gregory B. Sorkin (Exact Complexity of NP-hard Problems, 2010)

Average case performance of heuristics for multi-dimensional assignment problems - Alan M. Frieze; Gregory B. Sorkin (CoRR, 2010)

Average-case performance of heuristics for three-dimensional assignment problems - Alan M. Frieze; Gregory B. Sorkin (CoRR, 2010)

Structure of random r-SAT below the pure literal threshold - Alexander D. Scott; Gregory B. Sorkin (CoRR, 2010)

First-passage percolation on a ladder graph, and the path cost in a VCG auction. - Abraham Flaxman; David Gamarnik; Gregory B. Sorkin (Random Struct. Algorithms, 2011)

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. - Serge Gaspers; Gregory B. Sorkin (J. Comput. Syst. Sci., 2012)

VCG Auction Mechanism Cost Expectations and Variances. - Svante Janson; Gregory B. Sorkin (CoRR, 2013)

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). - Thore Husfeldt; Ramamohan Paturi; Gregory B. Sorkin; Ryan Williams 001 (Dagstuhl Reports, 2013)

Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. - Serge Gaspers; Gregory B. Sorkin (CoRR, 2014)

Efficient algorithms for three-dimensional axial and planar random assignment problems. - Alan M. Frieze; Gregory B. Sorkin (Random Struct. Algorithms, 2015)

Phase coexistence and torpid mixing in the 3-coloring model on ℤd. - David J. Galvin; Jeff Kahn 001; Dana Randall; Gregory B. Sorkin (SIAM J. Discret. Math., 2015)

The Satisfiability Threshold for k-XORSAT. - Boris G. Pittel; Gregory B. Sorkin (Comb. Probab. Comput., 2016)

Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. - Serge Gaspers; Gregory B. Sorkin (ACM Trans. Algorithms, 2017)

The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. - Alan M. Frieze; Wesley Pegden; Gregory B. Sorkin (SIAM J. Discret. Math., 2018)

Successive shortest paths in complete graphs with random edge weights. - Stefanie Gerke; Balázs F. Mezei; Gregory B. Sorkin (Random Struct. Algorithms, 2020)

Minimum-Weight Combinatorial Structures Under Random Cost-Constraints. - Alan M. Frieze; Wesley Pegden; Gregory B. Sorkin; Tomasz Tkocz (Electron. J. Comb., 2021)

Successive minimum spanning trees. - Svante Janson; Gregory B. Sorkin (Random Struct. Algorithms, 2022)

The Ising Antiferromagnet and Max Cut on Random Regular Graphs. - Amin Coja-Oghlan; Philipp Loick; Balázs F. Mezei; Gregory B. Sorkin (SIAM J. Discret. Math., 2022)

Belief Propagation Guided Decimation on Random k-XORSAT. - Arnab Chatterjee; Amin Coja-Oghlan; Mihyun Kang; Lena Krieg; Maurice Rolvien; Gregory B. Sorkin (ICALP, 2025)

Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds. - Alan M. Frieze; Pu Gao; Calum MacRury; Pawel Pralat; Gregory B. Sorkin (Eur. J. Comb., 2025)

Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model. - Michael Molloy 001; Pawel Pralat; Gregory B. Sorkin (Random Struct. Algorithms, 2025)