FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
FOCS
2003
IEEE
14 years 29 days 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 ...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
FOCS
2003
IEEE
14 years 29 days 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...
FOCS
2003
IEEE
14 years 29 days 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...
FOCS
2003
IEEE
14 years 29 days 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...