Scholar
Gregory Sorkin
Google Scholar ID: lJCOQ1cAAAAJ
London School of Economics and Political Science
random graphs
random structures
algorithms
combinatorial optimization
phase transitions
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
906
H-index
16
i10-index
27
Publications
20
Co-authors
10
list available
Contact
Email
g.b.sorkin@lse.ac.uk
CV
Open ↗
Resume
Academic Achievements
- Publications listed on dblp
- Full CV including publications and patents
Research Experience
- 2010–present: Professor, Department of Mathematics (formerly, Management), LSE
- 1992–2010: Research Staff Member, IBM Research (Yorktown Heights, New York)
- 1991–1992: Research Fellow, University of Edinburgh (with Mark Jerrum)
- 1983–1986: Senior Associate Engineer, IBM Research (Hawthorne, New York)
Education
- 1986–1991: Ph.D. in Electrical Engineering and Computer Science, U.C. Berkeley
- 1983–1987: A.B. in Mathematics, Harvard
Background
- Combinatorial optimization
- Phase transitions in random structures including random graphs and random formulae
- Average-case analysis of algorithms
- Exponential-time algorithms
- Graph theory, combinatorics, and the probabilistic method
- Applications in operations research, auctions, biology, physics, and other areas
Miscellany
Office hours: Wed 11.00–13.00 or by email appointment
Co-authors
6 total
Jeff Kephart
Distinguished Research Staff Member, IBM Research
Alan Frieze
Carnegie Mellon University
Alex Scott
Professor of Mathematics, University of Oxford
David Gamarnik
Professor of Operations Research, MIT
MohammadTaghi Hajiaghayi
ACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College Park
John Langford
Microsoft Research New York