Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Randomized greedy algorithms for finding smallk-dominating sets of regular graphs: Label: en
Book Ramsey numbers. I: Label: en
Lower bounds for adaptive locally decodable codes: Label: en
Asymptotic expansions inn−1 for percolation critical values on then-Cube and ℤn: Label: en
Random Bulgarian solitaire: Label: en
Maxima in hypercubes: Label: en
Embracing the giant component: Label: en
Correction: Small worlds: Label: en
Identifying several biased coins encountered by a hidden random walk: Label: en
A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma: Label: en
Data structures for maintaining set partitions: Label: en
Testing membership in parenthesis languages: Label: en
On the swapping algorithm: Label: en
An elementary proof of a theorem of Johnson and Lindenstrauss: Label: en
A bounding chain for Swendsen-Wang: Label: en
How many random edges make a dense graph hamiltonian?: Label: en
Renewal processes on partially ordered sets: Label: en
On the probability of independent sets in random graphs: Label: en
On mixing times for stratified walks on thed-cube: Label: en
On the covariance of the level sizes in random recursive trees: Label: en
Bond percolation critical probability bounds for three Archimedean lattices: Label: en
The phase transition in random horn satisfiability and its algorithmic implications: Label: en
Randomization helps to perform independent tasks reliably: Label: en
Coloring uniform hypergraphs with few colors: Label: en
General urn models with several types of balls and Gaussian limiting fields: Label: en
Deviation inequality for monotonic Boolean functions with application to the number ofk-cycles in a random graph: Label: en
A stochastic model for solitons: Label: en
The emergence of a giant component in random subgraphs of pseudo-random graphs: Label: en
Enumeration of Almost-Convex Polygons on the Square Lattice: Label: en
A Canonical Ramsey Theorem: Label: en
Local Limit Theorems for Sums of Power Series Distributed Random Variables and for the Number of Components in Labelled Relational Structures: Label: en
Coloring Clique-free Graphs in Linear Expected Time: Label: en
The Variance of Level Numbers in Certain Families of Trees: Label: en
Large Cliques Elude the Metropolis Process: Label: en
Limit Theorems for Combinatorial Structures via Discrete Process Approximations: Label: en
Generalized Digital Trees and Their Difference—Differential Equations: Label: en
Simple Constructions of Almost k-wise Independent Random Variables: Label: en
1-Pancyclic Hamilton Cycles in Random Graphs: Label: en
Refined Approximations for the Ewens Sampling Formula: Label: en
Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees: Label: en
Chain Lengths in Certain Random Directed Graphs: Label: en
Counting the Number of Hamilton Cycles in Random Digraphs: Label: en
On the Travelling Salesperson Problem in Many Dimensions: Label: en
The simple random walk and max-degree walk on a directed graph: Label: en
Multiple choice tries and distributed hash tables: Label: en
A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree: Label: en
The typical structure of graphs without given excluded subgraphs: Label: en
Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439: Label: en
A percolating hard sphere model: Label: en
A new approach to the giant component problem: Label: en