The following pages link to Martin Dyer (Q247119):
Displaying 50 items.
- (Q2921768) (← links)
- The complexity of approximating conservative counting CSPs. (Q2957879) (← links)
- Pairwise-Interaction Games (Q3012801) (← links)
- The solution of some random NP-hard problems in polynomial expected time (Q3031922) (← links)
- Randomly coloring random graphs (Q3055885) (← links)
- (Q3113690) (← links)
- The Complexity of Approximating Bounded-Degree Boolean #CSP (Q3113760) (← links)
- (Q3128893) (← links)
- Convergence of the Iterated Prisoner's Dilemma Game (Q3147275) (← links)
- On Counting Independent Sets in Sparse Graphs (Q3149880) (← links)
- Corrigendum: The complexity of counting graph homomorphisms (Q3159461) (← links)
- The Complexity of Vertex Enumeration Methods (Q3313620) (← links)
- Linear Time Algorithms for Two- and Three-Variable Linear Programs (Q3315272) (← links)
- An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
- Probabilistic analysis of a parallel algorithm for finding the lexicographically first depth first search tree in a dense random graph (Q3357536) (← links)
- On Counting Lattice Points in Polyhedra (Q3359328) (← links)
- Randomly coloring sparse random graphs with fewer colors than the maximum degree (Q3419603) (← links)
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows (Q3427745) (← links)
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609) (← links)
- On counting homomorphisms to directed acyclic graphs (Q3546354) (← links)
- Approximate counting by dynamic programming (Q3581284) (← links)
- Approximately counting integral flows and cell-bounded contingency tables (Q3581402) (← links)
- Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
- On Counting Homomorphisms to Directed Acyclic Graphs (Q3613747) (← links)
- Stopping Times, Metrics and Approximate Counting (Q3613753) (← links)
- The Complexity of Weighted Boolean #CSP (Q3642870) (← links)
- On linear programs with random costs (Q3724096) (← links)
- Planar 3DM is NP-complete (Q3745303) (← links)
- (Q3794221) (← links)
- On the Complexity of Computing the Volume of a Polyhedron (Q3821581) (← links)
- Probabilistic Analysis of the Multidimensional Knapsack Problem (Q3832316) (← links)
- Eliminating extraneous edges in Greenberg's algorithm (Q3892062) (← links)
- Calculating surrogate constraints (Q3916382) (← links)
- Randomized greedy matching (Q3970901) (← links)
- (Q3973370) (← links)
- (Q3976408) (← links)
- Volumes Spanned by Random Points in the Hypercube (Q3989742) (← links)
- Note—On the Validity of Marginal Analysis for Allocating Servers in <i>M</i>/<i>M</i>/<i>c</i> Queues (Q4144574) (← links)
- An algorithm for determining all extreme points of a convex polytope (Q4159164) (← links)
- Approximately Counting Hamilton Paths and Cycles in Dense Graphs (Q4210094) (← links)
- (Q4219031) (← links)
- (Q4240600) (← links)
- (Q4250201) (← links)
- (Q4250202) (← links)
- (Q4263659) (← links)
- On Approximately Counting Colorings of Small Degree Graphs (Q4268888) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- A random polynomial-time algorithm for approximating the volume of convex bodies (Q4302827) (← links)
- Randomized greedy matching. II (Q4322476) (← links)
- (Q4335204) (← links)