World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
4980
World Ranking
10882
National Ranking
685

Overview

Gregory B. Sorkin is affiliated with the London School of Economics and Political Science in the United Kingdom. Their research spans primarily the fields of Mathematics and Computer Science, focusing on topics such as graph theory, stochastic processes, and statistical mechanics.

The main areas of study for Sorkin include:

  • Mathematics
  • Computer Science

Within these fields, their subfields of specialization cover:

  • Statistics and Probability
  • Discrete Mathematics and Combinatorics
  • Molecular Biology
  • Mathematical Physics
  • Computational Theory and Mathematics

Their research investigates a variety of topics, including:

  • Limits and Structures in Graph Theory
  • Markov Chains and Monte Carlo Methods
  • Stochastic processes and statistical mechanics
  • Advanced Graph Theory Research
  • Algorithms and Data Compression
  • Complexity and Algorithms in Graphs
  • Random Matrices and Applications

Gregory B. Sorkin has contributed to multiple publications, notably in venues such as arXiv (Cornell University), Random Structures and Algorithms, SIAM Journal on Discrete Mathematics, The Electronic Journal of Combinatorics, and The Mathematical Intelligencer.

Their recent papers include:

  • The Ising Antiferromagnet and Max Cut on Random Regular Graphs, 2022, SIAM Journal on Discrete Mathematics
  • Hamilton cycles in a semi-random graph model, 2022, arXiv (Cornell University)
  • The Ising antiferromagnet and max cut on random regular graphs, 2020, arXiv (Cornell University)
  • Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds, 2023, arXiv (Cornell University)
  • Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model, 2025, Random Structures and Algorithms

Sorkin has collaborated frequently with co-authors including Paweł Prałat, Alan Frieze, Amin Coja-Oghlan, Philipp Loick, and Balázs F. Mezei, having multiple joint works with each.

Best Publications

  • Gadgets, Approximation, and Linear Programming

    Luca Trevisan;Gregory B. Sorkin;Madhu Sudan;David P. Williamson

  • Method and apparatus for detecting a presence of a computer virus

    Jeffrey Owen Kephart;Gregory Bret Sorkin;Gerald James Tesauro;Steven Richard White

  • Neural networks for computer virus recognition

    G.J. Tesauro;J.O. Kephart;G.B. Sorkin

  • System and method for protecting integrity of alterable ROM using digital signatures

    David M. Chess;Gregory Bret Sorkin;Steve Richard White

  • Biologically inspired defenses against computer viruses

    Jeffrey O. Kephart;Gregory B. Sorkin;William C. Arnold;David M. Chess

  • The metropolis algorithm for graph bisection

    Mark Jerrum;Gregory B. Sorkin

  • Automatic analysis of a computer virus structure and means of attachment to its hosts

    David M. Chess;Jeffrey O. Kephart;Gregory B. Sorkin

  • Fighting Computer Viruses

    Jeffrey O. Kephart;Gregory B. Sorkin;David M. Chess;Steve R. White

  • Applying harmonic balance to almost-periodic circuits

    K.S. Kundert;G.B. Sorkin;A. Sangiovanni-Vincentelli

  • Blueprint for a Computer Immune System

    Jeffrey O. Kephart;Gregory B. Sorkin;Morton Swimmer;Steve R. White

  • Efficient simulated annealing on fractal energy landscapes

    Gregory B. Sorkin

  • Optimal myopic algorithms for random 3-SAT

    D. Achioptas;G.B. Sorkin

  • The interlace polynomial of a graph

    Richard Arratia;Béla Bollobás;Gregory B. Sorkin

  • Searching for patterns in encrypted data

    William C. Arnold;David M. Chess;Jeffrey O. Kephart;Gregory B. Sorkin

  • Robust reductions from ranking to classification

    Maria-Florina Balcan;Nikhil Bansal;Alina Beygelzimer;Don Coppersmith

  • Constructive bounds and exact expectation for the random assignment problem

    Don Coppersmith;Gregory B. Sorkin

  • The interlace polynomial: a new graph polynomial

    Richard Arratia;Béla Bollobás;Gregory B. Sorkin

  • Random MAX SAT, random MAX CUT, and their phase transitions

    Don Coppersmith;David Gamarnik;MohammadTaghi Hajiaghayi;Gregory B. Sorkin

  • Efficient detection of computer viruses and other data trails

    Jeffrey Owen Kephart;Alexandre Guy Georges Morin;Gregory Bret Sorkin;Joseph Warreb Wells

  • Autonomous system for recognition of patterns formed by stored data during computer memory scrubbing

    William Carlisle Arnold;Jehoshua Bruck;Jeffrey Owen Kephart;Gregory Bret Sorkin

Frequent Co-Authors

Alan Frieze
Alan Frieze Carnegie Mellon University
Jeffrey O. Kephart
Jeffrey O. Kephart IBM (United States)
David M. Chess
David M. Chess IBM (United States)
Don Coppersmith
Don Coppersmith IBM (United States)
MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi University of Maryland, College Park
Béla Bollobás
Béla Bollobás University of Memphis
Madhu Sudan
Madhu Sudan Harvard University
Gerald Tesauro
Gerald Tesauro IBM (United States)
David P. Williamson
David P. Williamson Cornell University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Computer Science degree in the USA opens doors to a variety of related disciplines and rewarding careers. Many students choose to expand their options by exploring high-paying jobs with environmental science degree, which often intersect with technology through roles in data analysis, modeling, and environmental technology.

For those seeking flexibility or a faster route, consider enrolling in an accelerated computer science degree online. These programs are ideal for career changers or working professionals looking to quickly gain technical skills and credentials.

Related fields like environmental engineering and mechanical engineering are also popular paths. You can find a variety of environmental engineering online degree programs, some of which allow students to specialize in areas blending computer science and sustainable solutions.

Lastly, for those interested in advanced technical expertise, consider the cheapest online master's mechanical engineering options. These affordable programs can help you gain a competitive edge in dynamic industries at the intersection of computers, machinery, and innovation.

Best Scientists Citing Gregory B. Sorkin

Trending Scientists

Recently Published Articles