96
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
168
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
113
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
99
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
140
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
132
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is the...
137
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
70
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
112
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...