Search the dblp DataBase
Gregory B. Sorkin :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Leslie Ann Goldberg , Paul W. Goldberg , Cynthia A. Phillips , Gregory B. Sorkin Constructing Computer Virus Phylogenies. [Citation Graph (0, 0)][DBLP ] CPM, 1996, pp:253-270 [Conf ] Alexander D. Scott , Gregory B. Sorkin An LP-Designed Algorithm for Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:588-599 [Conf ] Dimitris Achlioptas , Gregory B. Sorkin Optimal myopic algorithms for random 3-SAT. [Citation Graph (0, 0)][DBLP ] FOCS, 2000, pp:590-600 [Conf ] Mark Jerrum , Gregory B. Sorkin Simulated Annealing for Graph Bisection [Citation Graph (0, 0)][DBLP ] FOCS, 1993, pp:94-103 [Conf ] Luca Trevisan , Gregory B. Sorkin , Madhu Sudan , David P. Williamson Gadgets, Approximation, and Linear Programming (extended abstract). [Citation Graph (0, 0)][DBLP ] FOCS, 1996, pp:617-626 [Conf ] Jeffrey O. Kephart , Gregory B. Sorkin , William C. Arnold , David M. Chess , Gerald Tesauro , Steve R. White Biologically Inspired Defenses Against Computer Viruses. [Citation Graph (0, 0)][DBLP ] IJCAI (1), 1995, pp:985-996 [Conf ] Abraham Flaxman , David Gamarnik , Gregory B. Sorkin Embracing the Giant Component. [Citation Graph (0, 0)][DBLP ] LATIN, 2004, pp:69-79 [Conf ] Don Coppersmith , Gregory B. Sorkin Constructive Bounds and Exact Expectations for the Random Assignment Problem. [Citation Graph (0, 0)][DBLP ] RANDOM, 1998, pp:319-330 [Conf ] Alex D. Scott , Gregory B. Sorkin Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 2003, pp:382-395 [Conf ] Gregory B. Sorkin Some Notes on Random Satisfiability. [Citation Graph (0, 0)][DBLP ] SAGA, 2001, pp:117-130 [Conf ] Richard Arratia , Béla Bollobás , Gregory B. Sorkin The interlace polynomial: a new graph polynomial. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:237-245 [Conf ] Colin Cooper , Alan M. Frieze , Gregory B. Sorkin A note on random 2-SAT with prescribed literal degrees. [Citation Graph (0, 0)][DBLP ] SODA, 2002, pp:316-320 [Conf ] Don Coppersmith , David Gamarnik , Mohammad Taghi Hajiaghayi , Gregory B. Sorkin Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:364-373 [Conf ] Alan M. Frieze , Gregory B. Sorkin The probabilistic relationship between the assignment and asymmetric traveling salesman problems. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:652-660 [Conf ] Abraham Flaxman , David Gamarnik , Gregory B. Sorkin First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. [Citation Graph (0, 0)][DBLP ] WINE, 2006, pp:99-111 [Conf ] Gregory B. Sorkin Efficient Simulated Annealing on Fractal Energy Landscapes. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1991, v:6, n:3, pp:367-418 [Journal ] Richard Arratia , Béla Bollobás , Gregory B. Sorkin A Two-Variable Interlace Polynomial. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:24, n:4, pp:567-584 [Journal ] Abraham Flaxman , Aram Wettroth Harrow , Gregory B. Sorkin Strings with Maximally Many Distinct Subsequences and Substrings. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal ] Sven Erick Alm , Gregory B. Sorkin Exact Expectations And Distributions For The Random Assignment Problem. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2002, v:11, n:3, pp:- [Journal ] Richard Arratia , Béla Bollobás , Don Coppersmith , Gregory B. Sorkin Euler circuits and DNA sequencing by hybridization. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:63-96 [Journal ] Mark Jerrum , Gregory B. Sorkin The Metropolis Algorithm for Graph Bisection. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:155-175 [Journal ] Leslie Ann Goldberg , Paul W. Goldberg , Cynthia A. Phillips , Gregory B. Sorkin Constructing Computer Virus Phylogenies. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:26, n:1, pp:188-208 [Journal ] Richard Arratia , Béla Bollobás , Gregory B. Sorkin The interlace polynomial of a graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:199-233 [Journal ] Don Coppersmith , David Gamarnik , Mohammad Taghi Hajiaghayi , Gregory B. Sorkin Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:24, n:4, pp:502-545 [Journal ] Don Coppersmith , Gregory B. Sorkin Constructive bounds and exact expectations for the random assignment problem. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1999, v:15, n:2, pp:113-144 [Journal ] Abraham D. Flaxman , David Gamarnik , Gregory B. Sorkin Embracing the giant component. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2005, v:27, n:3, pp:277-289 [Journal ] Luca Trevisan , Gregory B. Sorkin , Madhu Sudan , David P. Williamson Gadgets, Approximation, and Linear Programming. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:29, n:6, pp:2074-2097 [Journal ] Alan Frieze , Gregory B. Sorkin The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2007, v:36, n:5, pp:1435-1452 [Journal ] Gregory B. Sorkin Asymptotically Perfect Trivial Global Routing: A Stochastic Analysis. [Citation Graph (0, 0)][DBLP ] IEEE Trans. on CAD of Integrated Circuits and Systems, 1987, v:6, n:5, pp:820-827 [Journal ] Maria-Florina Balcan , Nikhil Bansal , Alina Beygelzimer , Don Coppersmith , John Langford , Gregory B. Sorkin Robust Reductions from Ranking to Classification. [Citation Graph (0, 0)][DBLP ] COLT, 2007, pp:604-619 [Conf ] Colin Cooper , Alan Frieze , Gregory B. Sorkin Random 2-SAT with Prescribed Literal Degrees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2007, v:48, n:3, pp:249-265 [Journal ] Alexander D. Scott , Gregory B. Sorkin Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Alexander D. Scott , Gregory B. Sorkin Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] The Power of Choice in a Generalized Pólya Urn Model. [Citation Graph (, )][DBLP ] Average-Case Analyses of Vickrey Costs. [Citation Graph (, )][DBLP ] A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. [Citation Graph (, )][DBLP ] Conditional Probability Tree Estimation Analysis and Algorithms [Citation Graph (, )][DBLP ] A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between [Citation Graph (, )][DBLP ] Average case performance of heuristics for multi-dimensional assignment problems [Citation Graph (, )][DBLP ] Structure of random r-SAT below the pure literal threshold [Citation Graph (, )][DBLP ] Average-case performance of heuristics for three-dimensional assignment problems [Citation Graph (, )][DBLP ] Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time. [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.284secs