|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 19 occurrences of 19 keywords
|
|
|
|
|
Results
Found 51 publication records. Showing 51 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Serge Gaspers, Gregory B. Sorkin |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham Flaxman, David Gamarnik, Gregory B. Sorkin |
First-passage percolation on a ladder graph, and the path cost in a VCG auction. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander D. Scott, Gregory B. Sorkin |
Structure of random r-SAT below the pure literal threshold |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Alan M. Frieze, Gregory B. Sorkin |
Average-case performance of heuristics for three-dimensional assignment problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Alan M. Frieze, Gregory B. Sorkin |
Average case performance of heuristics for multi-dimensional assignment problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gregory B. Sorkin, Angelika Steger, Rico Zenklusen |
A tight bound on the collection of edges in MSTs of induced subgraphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander D. Scott, Gregory B. Sorkin |
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Gregory B. Sorkin |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Alina Beygelzimer, John Langford, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl |
Conditional Probability Tree Estimation Analysis and Algorithms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Gregory B. Sorkin |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alina Beygelzimer, John Langford, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl |
Conditional Probability Tree Estimation Analysis and Algorithms. |
UAI |
2009 |
DBLP BibTeX RDF |
|
| 1 | Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin |
Average-Case Analyses of Vickrey Costs. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST |
| 1 | Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin |
Robust reductions from ranking to classification. |
Machine Learning |
2008 |
DBLP DOI BibTeX RDF |
Classification, Ranking, Reductions |
| 1 | Gregory B. Sorkin |
The Power of Choice in a Generalized Pólya Urn Model. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander D. Scott, Gregory B. Sorkin |
Linear-programming design and analysis of fast algorithms for Max 2-CSP. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Alan M. Frieze, Gregory B. Sorkin |
Random 2-SAT with Prescribed Literal Degrees. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Gregory B. Sorkin |
The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, Gregory B. Sorkin |
Robust Reductions from Ranking to Classification. |
COLT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander D. Scott, Gregory B. Sorkin |
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin |
Vehicle Routing and Staffing for Sedan Service. |
Transportation Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander D. Scott, Gregory B. Sorkin |
Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Alexander D. Scott, Gregory B. Sorkin |
Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Alexander D. Scott, Gregory B. Sorkin |
An LP-Designed Algorithm for Constraint Satisfaction. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham Flaxman, David Gamarnik, Gregory B. Sorkin |
First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. |
WINE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin |
Embracing the giant component. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Arratia, Béla Bollobás, Gregory B. Sorkin |
The interlace polynomial of a graph. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham Flaxman, Aram Wettroth Harrow, Gregory B. Sorkin |
Strings with Maximally Many Distinct Subsequences and Substrings. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin |
Random MAX SAT, random MAX CUT, and their phase transitions. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Arratia, Béla Bollobás, Gregory B. Sorkin |
A Two-Variable Interlace Polynomial. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C99, 05E99, 05A15 |
| 1 | Abraham Flaxman, David Gamarnik, Gregory B. Sorkin |
Embracing the Giant Component. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Don Coppersmith, David Gamarnik, Mohammad Taghi Hajiaghayi, Gregory B. Sorkin |
Random MAX SAT, random MAX CUT, and their phase transitions. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex D. Scott, Gregory B. Sorkin |
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Erick Alm, Gregory B. Sorkin |
Exact Expectations And Distributions For The Random Assignment Problem. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Alan M. Frieze, Gregory B. Sorkin |
A note on random 2-SAT with prescribed literal degrees. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Gregory B. Sorkin |
The probabilistic relationship between the assignment and asymmetric traveling salesman problems. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory B. Sorkin |
Some Notes on Random Satisfiability. |
SAGA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Arratia, Béla Bollobás, Don Coppersmith, Gregory B. Sorkin |
Euler circuits and DNA sequencing by hybridization. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson |
Gadgets, Approximation, and Linear Programming. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Arratia, Béla Bollobás, Gregory B. Sorkin |
The interlace polynomial: a new graph polynomial. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Gregory B. Sorkin |
Optimal myopic algorithms for random 3-SAT. |
FOCS |
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 |
| 1 | Don Coppersmith, Gregory B. Sorkin |
Constructive bounds and exact expectations for the random assignment problem. |
Random Struct. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin |
Constructing Computer Virus Phylogenies. |
J. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Jerrum, Gregory B. Sorkin |
The Metropolis Algorithm for Graph Bisection. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Don Coppersmith, Gregory B. Sorkin |
Constructive Bounds and Exact Expectations for the Random Assignment Problem. |
RANDOM |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin |
Constructing Computer Virus Phylogenies. |
CPM |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson |
Gadgets, Approximation, and Linear Programming (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey O. Kephart, Gregory B. Sorkin, William C. Arnold, David M. Chess, Gerald Tesauro, Steve R. White |
Biologically Inspired Defenses Against Computer Viruses. |
IJCAI |
1995 |
DBLP BibTeX RDF |
|
| 1 | Mark Jerrum, Gregory B. Sorkin |
Simulated Annealing for Graph Bisection |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
unique smallest bisection, simulated annealing, Metropolis algorithm, graph bisection |
| 1 | Gregory B. Sorkin |
Efficient Simulated Annealing on Fractal Energy Landscapes. |
Algorithmica |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory B. Sorkin |
Asymptotically Perfect Trivial Global Routing: A Stochastic Analysis. |
IEEE Trans. on CAD of Integrated Circuits and Systems |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | William R. Heller, Gregory B. Sorkin, Klim Maling |
The planar package planner for system designers. |
DAC |
1982 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #51 of 51 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")