63 search results - page 7 / 13 » Strongly uniform bounds from semi-constructive proofs |
CSL
2005
Springer
14 years 1 months ago
2005
Springer
We give a Natural Deduction formulation of an adaptation of G¨odel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proof...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
SIGMETRICS
2003
ACM
14 years 21 days ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results ...