The following pages link to (Q4004078):
Displaying 50 items.
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Limit velocity and zero-one laws for diffusions in random environment (Q862200) (← links)
- On the variational distance of two trees (Q862218) (← links)
- Average stretch analysis of compact routing schemes (Q875595) (← links)
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks (Q876471) (← links)
- On the complexity of asynchronous agreement against powerful adversaries (Q901869) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- On the disconnection of a discrete cylinder by a biased random walk (Q939077) (← links)
- A phase transition for the metric distortion of percolation on the hypercube (Q949756) (← links)
- Clique partitions of complements of forests and bounded degree graphs (Q952663) (← links)
- The \(k\)-tuple domination number revisited (Q952712) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Using the incompressibility method to obtain local Lemma results for Ramsey-type problems (Q976081) (← links)
- Nonadaptive group testing with lies: probabilistic existence theorems (Q984649) (← links)
- The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
- Domination in bipartite graphs (Q998499) (← links)
- A solitaire game played on 2-colored graphs (Q998506) (← links)
- On the spectrum of projective norm-graphs (Q1007575) (← links)
- Random constructions and density results (Q1009013) (← links)
- Finding occurrences of protein complexes in protein-protein interaction graphs (Q1013075) (← links)
- Broadcasting in dynamic radio networks (Q1015809) (← links)
- Bipartite Ramsey numbers involving large \(K_{n,n}\) (Q1024286) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- On a random graph evolving by degrees (Q1047669) (← links)
- Bipartite dimensions and bipartite degrees of graphs (Q1126290) (← links)
- Progressions in sequences of nearly consecutive integers (Q1268731) (← links)
- A useful elementary correlation inequality. II (Q1268732) (← links)
- Covering cubes by random half cubes, with applications to binary neural networks (Q1271555) (← links)
- 2-partition-transitive tournaments (Q1272476) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Random Sidon sequences (Q1283038) (← links)
- On a graph colouring problem (Q1297488) (← links)
- The space complexity of approximating the frequency moments (Q1305928) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- Signed domination in regular graphs and set-systems (Q1306310) (← links)
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs (Q1306928) (← links)
- The independence number of graphs in terms of degrees (Q1313874) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- Randomization, derandomization and antirandomization: Three games (Q1331937) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- A probabilistic lower bound on the independence number of graphs (Q1336674) (← links)
- A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172) (← links)
- Random walks supported on random points of \(Z/nZ\) (Q1342498) (← links)
- Independent sets in graphs with triangles (Q1349947) (← links)
