Sciweavers

166 search results - page 1 / 34
» Black-Box Randomized Reductions in Algorithmic Mechanism Des...
Sort
View
FOCS
2010
IEEE
13 years 2 months ago
Black-Box Randomized Reductions in Algorithmic Mechanism Design
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
Shaddin Dughmi, Tim Roughgarden
APPROX
2011
Springer
254views Algorithms» more  APPROX 2011»
12 years 4 months ago
Black-Box Reductions in Mechanism Design
Zhiyi Huang, Lei Wang 0010, Yuan Zhou
SOSP
2003
ACM
14 years 1 months ago
Performance debugging for distributed systems of black boxes
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...
Marcos Kawazoe Aguilera, Jeffrey C. Mogul, Janet L...
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
13 years 11 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
13 years 6 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan