Get started
Author

Gregory B. Sorkin

Observed names: G. Sorkin, G.B. Sorkin, GREGORY B. SORKIN, Gregory B Sorkin, Gregory Sorkin, Sorkin, Gregory, Sorkin, Gregory B., Sorkin, Gregory, Author
Observed institutions: IBM (United States), University of Cambridge, IBM Research - Thomas J. Watson Research Center, Mittag-Leffler Institute, The Ohio State University, Massachusetts Institute of Technology, Carnegie Mellon University, London School of Economics and Political Science, University of California, Berkeley
ORCID: 0000-0003-4935-7820
Observed ORCID: 0000-0003-4935-7820
OpenAlex ID: A5083890565
Gadgets, Approximation, and Linear Programming
2000 · Luca Trevisan, Gregory B. Sorkin, et al. · SIAM Journal on Computing · 208
Neural networks for computer virus recognition
1996 · G.J. Tesauro, J.O. Kephart, et al. · IEEE Expert · 145
The Metropolis algorithm for graph bisection
1998 · Mark Jerrum, Gregory B. Sorkin · Discrete Applied Mathematics · 140
PDF
Applying harmonic balance to almost-periodic circuits
1988 · K.S. Kundert, G.B. Sorkin, et al. · IEEE Transactions on Microwave Theory and Techniques · 127
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
2009 · Gaspers, Serge, Sorkin, Gregory B. · 124
Biologically inspired defenses against computer viruses
1995 · Jeffrey O. Kephart, Gregory B. Sorkin, et al. · London School of Economics and Political Science Research Online (London School of Economics and Political Science) · 116
The interlace polynomial of a graph
2004 · Richard Arratia, Béla Bollobás, et al. · Journal of Combinatorial Theory Series B · 103
Fighting Computer Viruses
1997 · Jeffrey O. Kephart, Gregory B. Sorkin, et al. · Scientific American · 103
Constructive bounds and exact expectations for the random assignment problem
1999 · Don Coppersmith, Gregory B. Sorkin · Random Structures and Algorithms · 96
Efficient simulated annealing on fractal energy landscapes
1991 · Gregory B. Sorkin · Algorithmica · 90
Optimal myopic algorithms for random 3-SAT
2002 · D. Achioptas, G.B. Sorkin · Annual Symposium on Foundations of Computer Science · 88
Random MAX SAT, random MAX CUT, and their phase transitions
2004 · Don Coppersmith, David Gamarnik, et al. · Random Structures and Algorithms · 85
The Satisfiability Threshold of Random 3-SAT Is at Least 3.52
2003 · Hajiaghayi, MohammadTaghi, Sorkin, Gregory B. · arXiv (Cornell University) · 84
PDF
Blueprint for a Computer Immune System *
1999 · Jeffrey Kephart, Gregory Sorkin, et al. · Springer eBooks · 78
Gadgets, approximation, and linear programming
2002 · L. Trevisan, G.B. Sorkin, et al. · Annual Symposium on Foundations of Computer Science · 71
The interlace polynomial: a new graph polynomial
2000 · Richard Arratia, Béla Bollobás, et al. · 65
Simulated annealing for graph bisection
2002 · M. Jerrum, G.B. Sorkin · Annual Symposium on Foundations of Computer Science · 63
Robust reductions from ranking to classification
2008 · Maria-Florina Balcan, Nikhil Bansal, et al. · Machine Learning · 61
PDF
Conditional Probability Tree Estimation Analysis and Algorithms
2014 · Beygelzimer, Alina, Langford, John, et al. · arXiv (Cornell University) · 57
PDF
A Two-Variable Interlace Polynomial
2004 · Richard Arratia, Béla Bollobás†, et al. · COMBINATORICA · 57
PDF
The Planar Package Planner for System Designers
1982 · W.R. Heller, K. Maling, et al. · ACM/IEEE Design Automation Conference (DAC) · 56
Constructing Computer Virus Phylogenies
1998 · Leslie Ann Goldberg, Paul W Goldberg, et al. · Journal of Algorithms · 51
Random MAX SAT, Random MAX CUT, and Their Phase Transitions
2003 · Coppersmith, Don, Gamarnik, David, et al. · arXiv (Cornell University) · 48
PDF
The Satisfiability Threshold fork-XORSAT
2015 · BORIS PITTEL, GREGORY B. SORKIN · Combinatorics Probability Computing · 47
Euler circuits and DNA sequencing by hybridization
2000 · Richard Arratia, Béla Bollobás, et al. · Discrete Applied Mathematics · 42
PDF
Works count: 113
Citation count: 2,966
H-index: 30
I10-index: 57
Year
Topic
Type