The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Gregory B. Sorkin" ( http://dblp.L3S.de/Authors/Gregory_B._Sorkin )

  Author page on DBLP  Author page in RDF  Community of Gregory B. Sorkin in ASPL-2

Publication years (Num. hits)
1982-2000 (15) 2001-2006 (18) 2007-2010 (18) 2011-2019 (13)
Publication types (Num. hits)
article(39) inproceedings(24) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 19 occurrences of 19 keywords

Results
Found 65 publication records. Showing 64 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Svante Janson, Gregory B. Sorkin Successive Minimum Spanning Trees. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Wesley Pegden, Gregory B. Sorkin The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Gregory B. Sorkin Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Boris G. Pittel, Gregory B. Sorkin The Satisfiability Threshold for k-XORSAT. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1David Galvin, Jeff Kahn, Dana Randall, Gregory B. Sorkin Phase coexistence and torpid mixing in the 3-coloring model on ℤd. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Gregory B. Sorkin Efficient algorithms for three-dimensional axial and planar random assignment problems. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Gregory B. Sorkin Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. Search on Bibsonomy ICALP (1) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Gregory B. Sorkin Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Alina Beygelzimer, John Langford 0001, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl Conditional Probability Tree Estimation Analysis and Algorithms. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams 0001 Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Svante Janson, Gregory B. Sorkin VCG Auction Mechanism Cost Expectations and Variances. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Serge Gaspers, Gregory B. Sorkin A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Abraham Flaxman, David Gamarnik, Gregory B. Sorkin First-passage percolation on a ladder graph, and the path cost in a VCG auction. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexander D. Scott, Gregory B. Sorkin Structure of random r-SAT below the pure literal threshold Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Alan M. Frieze, Gregory B. Sorkin Average case performance of heuristics for multi-dimensional assignment problems Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Alan M. Frieze, Gregory B. Sorkin Average-case performance of heuristics for three-dimensional assignment problems Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin (eds.) Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010 Search on Bibsonomy Exact Complexity of NP-hard Problems The full citation details ... 2010 DBLP  BibTeX  RDF
1Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin 10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Search on Bibsonomy Exact Complexity of NP-hard Problems The full citation details ... 2010 DBLP  BibTeX  RDF
1Alexander D. Scott, Gregory B. Sorkin Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Gregory B. Sorkin A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Alina Beygelzimer, John Langford 0001, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl Conditional Probability Tree Estimation Analysis and Algorithms Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Gregory B. Sorkin, Angelika Steger, Rico Zenklusen A tight bound on the collection of edges in MSTs of induced subgraphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Gregory B. Sorkin A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
1Alina Beygelzimer, John Langford 0001, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl Conditional Probability Tree Estimation Analysis and Algorithms. Search on Bibsonomy UAI The full citation details ... 2009 DBLP  BibTeX  RDF
1Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin Average-Case Analyses of Vickrey Costs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST
1Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford 0001, Gregory B. Sorkin Robust reductions from ranking to classification. Search on Bibsonomy Machine Learning The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Classification, Ranking, Reductions
1Gregory B. Sorkin The Power of Choice in a Generalized Pólya Urn Model. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Colin Cooper, Alan M. Frieze, Gregory B. Sorkin Random 2-SAT with Prescribed Literal Degrees. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexander D. Scott, Gregory B. Sorkin Linear-programming design and analysis of fast algorithms for Max 2-CSP. Search on Bibsonomy Discrete Optimization The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Gregory B. Sorkin The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford 0001, Gregory B. Sorkin Robust Reductions from Ranking to Classification. Search on Bibsonomy COLT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexander D. Scott, Gregory B. Sorkin Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alexander D. Scott, Gregory B. Sorkin Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Alexander D. Scott, Gregory B. Sorkin Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin Vehicle Routing and Staffing for Sedan Service. Search on Bibsonomy Transportation Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alexander D. Scott, Gregory B. Sorkin An LP-Designed Algorithm for Constraint Satisfaction. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Abraham Flaxman, David Gamarnik, Gregory B. Sorkin First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. Search on Bibsonomy WINE The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin Embracing the giant component. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Abraham Flaxman, Aram Wettroth Harrow, Gregory B. Sorkin Strings with Maximally Many Distinct Subsequences and Substrings. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2004 DBLP  BibTeX  RDF
1Richard Arratia, Béla Bollobás, Gregory B. Sorkin A Two-Variable Interlace Polynomial. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C99, 05E99, 05A15
1Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin Random MAX SAT, random MAX CUT, and their phase transitions. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Richard Arratia, Béla Bollobás, Gregory B. Sorkin The interlace polynomial of a graph. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Abraham Flaxman, David Gamarnik, Gregory B. Sorkin Embracing the Giant Component. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin Random MAX SAT, random MAX CUT, and their phase transitions. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
1Alex D. Scott, Gregory B. Sorkin Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Sven Erick Alm, Gregory B. Sorkin Exact Expectations And Distributions For The Random Assignment Problem. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Colin Cooper, Alan M. Frieze, Gregory B. Sorkin A note on random 2-SAT with prescribed literal degrees. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
1Alan M. Frieze, Gregory B. Sorkin The probabilistic relationship between the assignment and asymmetric traveling salesman problems. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
1Gregory B. Sorkin Some Notes on Random Satisfiability. Search on Bibsonomy SAGA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin Euler circuits and DNA sequencing by hybridization. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson Gadgets, Approximation, and Linear Programming. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Richard Arratia, Béla Bollobás, Gregory B. Sorkin The interlace polynomial: a new graph polynomial. Search on Bibsonomy SODA The full citation details ... 2000 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Gregory B. Sorkin Optimal myopic algorithms for random 3-SAT. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF optimal myopic algorithms, random 3-SAT formula, 3-clauses, unit-clause propagation extensions, expressible algorithms, max-density multiple-choice knapsack problem, optimal knapsack solution structure, lower bounds, optimisation, computability, satisfiability, differential equations, differential equations, optimization problem, randomised algorithms
1Don Coppersmith, Gregory B. Sorkin Constructive bounds and exact expectations for the random assignment problem. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Mark Jerrum, Gregory B. Sorkin The Metropolis Algorithm for Graph Bisection. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin Constructing Computer Virus Phylogenies. Search on Bibsonomy J. Algorithms The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Don Coppersmith, Gregory B. Sorkin Constructive Bounds and Exact Expectations for the Random Assignment Problem. Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin Constructing Computer Virus Phylogenies. Search on Bibsonomy CPM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson Gadgets, Approximation, and Linear Programming (extended abstract). Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Jeffrey O. Kephart, Gregory B. Sorkin, William C. Arnold, David M. Chess, Gerald Tesauro, Steve R. White Biologically Inspired Defenses Against Computer Viruses. Search on Bibsonomy IJCAI (1) The full citation details ... 1995 DBLP  BibTeX  RDF
1Mark Jerrum, Gregory B. Sorkin Simulated Annealing for Graph Bisection Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF unique smallest bisection, simulated annealing, Metropolis algorithm, graph bisection
1Gregory B. Sorkin Efficient Simulated Annealing on Fractal Energy Landscapes. Search on Bibsonomy Algorithmica The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Gregory B. Sorkin Asymptotically Perfect Trivial Global Routing: A Stochastic Analysis. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1William R. Heller, Gregory B. Sorkin, Klim Maling The planar package planner for system designers. Search on Bibsonomy DAC The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #64 of 64 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license