# Gregory B. Sorkin

Orcid: 0000-0003-4935-7820
According to our database

Collaborative distances:

^{1}, Gregory B. Sorkin authored at least 56 papers between 1982 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds.

CoRR, 2023

2022

SIAM J. Discret. Math., 2022

Random Struct. Algorithms, 2022

2021

Electron. J. Comb., 2021

2020

Random Struct. Algorithms, 2020

2018

The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights.

SIAM J. Discret. Math., 2018

2017

Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets.

ACM Trans. Algorithms, 2017

2016

Comb. Probab. Comput., 2016

2015

SIAM J. Discret. Math., 2015

Efficient algorithms for three-dimensional axial and planar random assignment problems.

Random Struct. Algorithms, 2015

2014

Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets.

CoRR, 2014

2013

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331).

Dagstuhl Reports, 2013

CoRR, 2013

2012

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between.

J. Comput. Syst. Sci., 2012

2011

Random Struct. Algorithms, 2011

2010

CoRR, 2010

CoRR, 2010

CoRR, 2010

Proceedings of the Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010, 2010

2009

Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function.

ACM Trans. Algorithms, 2009

J. Comb. Theory B, 2009

Proceedings of the UAI 2009, 2009

Proceedings of the Approximation, 2009

2008

Mach. Learn., 2008

Proceedings of the Approximation, 2008

2007

The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems.

SIAM J. Comput., 2007

Discret. Optim., 2007

Algorithmica, 2007

2006

Transp. Sci., 2006

Comb. Probab. Comput., 2006

Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP

CoRR, 2006

Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems

CoRR, 2006

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Proceedings of the Algorithms, 2006

2005

Random Struct. Algorithms, 2005

2004

Random Struct. Algorithms, 2004

J. Comb. Theory B, 2004

Electron. J. Comb., 2004

Comb., 2004

2003

Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.

Proceedings of the Approximation, 2003

2002

Comb. Probab. Comput., 2002

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2001

2000

SIAM J. Comput., 2000

Discret. Appl. Math., 2000

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Random Struct. Algorithms, 1999

1998

J. Algorithms, 1998

Discret. Appl. Math., 1998

1996

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1993

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1991

Algorithmica, 1991

1987

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987

1982

Proceedings of the 19th Design Automation Conference, 1982