161
click to vote
FOCS
15 years 6 months 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...
143
click to vote
FOCS
15 years 6 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 ...
107
click to vote
FOCS
15 years 6 months ago
2003 IEEE 
While deciphering the Enigma Code during World War II, I.J. Good and A.M. Turing considered the problem of estimating a probability distribution from a sample of data. They derive...
117
click to vote
FOCS
15 years 6 months 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...
115
click to vote
FOCS
15 years 6 months ago
2003 IEEE 
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
|
Theoretical Computer Science