Gregory B. Sorkin

2.7k total citations
55 papers, 1.2k citations indexed

About

Gregory B. Sorkin is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Gregory B. Sorkin has authored 55 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 10 papers in Artificial Intelligence. Recurrent topics in Gregory B. Sorkin's work include Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (13 papers) and Constraint Satisfaction and Optimization (12 papers). Gregory B. Sorkin is often cited by papers focused on Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (13 papers) and Constraint Satisfaction and Optimization (12 papers). Gregory B. Sorkin collaborates with scholars based in United States, United Kingdom and Austria. Gregory B. Sorkin's co-authors include Jeffrey O. Kephart, Mark Jerrum, Don Coppersmith, Béla Bollobás, Richard Arratia, David P. Williamson, Luca Trevisan, Alberto Sangiovanni‐Vincentelli, G. Tesauro and Madhu Sudan and has published in prestigious journals such as IEEE Transactions on Microwave Theory and Techniques, Machine Learning and Scientific American.

In The Last Decade

Gregory B. Sorkin

55 papers receiving 1.1k citations

Peers

Countries citing papers authored by Gregory B. Sorkin

Since Specialization

Citations

This map shows the geographic impact of Gregory B. Sorkin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gregory B. Sorkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gregory B. Sorkin more than expected).

Fields of papers citing papers by Gregory B. Sorkin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gregory B. Sorkin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gregory B. Sorkin. The network helps show where Gregory B. Sorkin may publish in the future.

Co-authorship network of co-authors of Gregory B. Sorkin

This figure shows the co-authorship network connecting the top 25 collaborators of Gregory B. Sorkin. A scholar is included among the top collaborators of Gregory B. Sorkin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Gregory B. Sorkin. Gregory B. Sorkin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model 2025 ·Random Structures and Algorithms ·Michael Molloy, Paweł Prałat, Gregory B. Sorkin	1
2	The Satisfiability Threshold fork-XORSAT 2015 ·Combinatorics Probability Computing ·Boris Pittel, Gregory B. Sorkin	11
3	A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between 2011 ·Journal of Computer and System Sciences ·Serge Gaspers, Gregory B. Sorkin	11
4	First‐passage percolation on a ladder graph, and the path cost in a VCG auction 2010 ·Random Structures and Algorithms ·Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin	3
5	A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between 2009 ·Symposium on Discrete Algorithms ·Serge Gaspers, Gregory B. Sorkin	5
6	A tight bound on the collection of edges in MSTs of induced subgraphs 2008 ·Journal of Combinatorial Theory Series B ·Gregory B. Sorkin, Angelika Steger, Rico Zenklusen	1
7	Linear-programming design and analysis of fast algorithms for Max 2-CSP 2007 ·Discrete Optimization ·Alex Scott, Gregory B. Sorkin	16
8	Generalized Constraint Satisfaction Problems 2006 ·arXiv (Cornell University) ·Alex Scott, Gregory B. Sorkin	2
9	The interlace polynomial of a graph 2004 ·Journal of Combinatorial Theory Series B ·Richard Arratia, Béla Bollobás, Gregory B. Sorkin	48
10	A Two-Variable Interlace Polynomial 2004 ·COMBINATORICA ·Richard Arratia, Béla Bollobás, Gregory B. Sorkin	30
11	IBM Research Report The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 2003 ·MohammadTaghi Hajiaghayi, Gregory B. Sorkin	8
12	The probabilistic relationship between the assignment and asymmetric traveling salesman problems 2001 ·Symposium on Discrete Algorithms ·Alan Frieze, Gregory B. Sorkin	11
13	The interlace polynomial: a new graph polynomial 2000 ·Symposium on Discrete Algorithms ·Richard Arratia, Béla Bollobás, Gregory B. Sorkin	41
14	Euler circuits and DNA sequencing by hybridization 2000 ·Discrete Applied Mathematics ·Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin	23
15	The Metropolis algorithm for graph bisection 1998 ·Discrete Applied Mathematics ·Mark Jerrum, Gregory B. Sorkin	74
16	Automated analysis of computer viruses 1996 ·London School of Economics and Political Science Research Online (London School of Economics and Political Science) ·(unknown), Gregory B. Sorkin	2
17	Gadgets, Approximation, and Linear Programming (extended abstract). 1996 ·Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson	6
18	Biologically inspired defenses against computer viruses 1995 ·London School of Economics and Political Science Research Online (London School of Economics and Political Science) ·Jeffrey O. Kephart, Gregory B. Sorkin, (unknown), David M. Chess, Gerald Tesauro, Steve R. White	76
19	Theory and practice of simulated annealing on special energy landscapes 1992 ·Gregory B. Sorkin	8
20	Simulated annealing on fractals: theoretical analysis and relevance for combinatorial optimization 1990 ·London School of Economics and Political Science Research Online (London School of Economics and Political Science) ·Gregory B. Sorkin	13

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact