The following pages link to Gregory B. Sorkin (Q414886):
Displayed 50 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- A two-variable interlace polynomial (Q558311) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Efficient simulated annealing on fractal energy landscapes (Q805499) (← links)
- A tight bound on the collection of edges in MSTs of induced subgraphs (Q1003845) (← links)
- Robust reductions from ranking to classification (Q1009271) (← links)
- The Metropolis algorithm for graph bisection (Q1383365) (← links)
- Strings with maximally many distinct subsequences and substrings (Q1422149) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- Minimum-weight combinatorial structures under random cost-constraints (Q2223474) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- Random 2-SAT with prescribed literal degrees (Q2642316) (← links)
- (Q2768360) (← links)
- Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function (Q2930272) (← links)
- Configuration Space Analysis for Optimization Problems (Q2964429) (← links)
- First-passage percolation on a ladder graph, and the path cost in a VCG auction (Q2998892) (← links)
- (Q3147236) (← links)
- Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (Q3373669) (← links)
- Successive shortest paths in complete graphs with random edge weights (Q3386534) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- The Power of Choice in a Generalized Pólya Urn Model (Q3541821) (← links)
- Average-Case Analyses of Vickrey Costs (Q3638896) (← links)
- The Enumeration of Nonhomeomorphic Graphs by Edges (Q3903030) (← links)
- Constructive bounds and exact expectations for the random assignment problem (Q4265785) (← links)
- Constructing Computer Virus Phylogenies (Q4377127) (← links)
- (Q4471319) (← links)
- Gadgets, Approximation, and Linear Programming (Q4507337) (← links)
- (Q4550238) (← links)
- Separate, Measure and Conquer (Q4554934) (← links)
- The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights (Q4581213) (← links)
- (Q4633872) (← links)
- Random MAX SAT, random MAX CUT, and their phase transitions (Q4739584) (← links)
- (Q4739606) (← links)
- (Q4828949) (← links)
- (Q4952623) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- The Satisfiability Threshold for<i>k</i>-XORSAT (Q5366889) (← links)
- The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems (Q5422494) (← links)
- Robust Reductions from Ranking to Classification (Q5434078) (← links)
- An LP-Designed Algorithm for Constraint Satisfaction (Q5449561) (← links)
- Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$ (Q5499734) (← links)
- Embracing the giant component (Q5704836) (← links)
- The Ising Antiferromagnet and Max Cut on Random Regular Graphs (Q5864219) (← links)
- (Q5875520) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900948) (← links)
- LATIN 2004: Theoretical Informatics (Q5901627) (← links)
- Successive minimum spanning trees (Q6074707) (← links)
- Snakes and ladders and intransitivity, or what mathematicians do in their time off (Q6121468) (← links)
- Structure of random r-SAT below the pure literal threshold (Q6220084) (← links)
- The Satisfiability Threshold for $k$-XORSAT, using an alternative proof (Q6238071) (← links)