2168 search results - page 93 / 434 » Randomized Algorithms and Complexity Theory |
135
click to vote
PODC
2006
ACM
15 years 9 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
156
click to vote
COCO
1991
Springer
15 years 6 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
115
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
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]...
109
Voted
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
a growing need to study abstract problems in distributed multi-agent systems in a systematic way, as well as to provide a qualitative mathematical framework in which to compare po...
121
Voted
PODC
2003
ACM
15 years 8 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...