Sciweavers

112
Voted
APPROX
2006
Springer
79views Algorithms» more  APPROX 2006»
15 years 7 months ago
On Nontrivial Approximation of CSPs
Johan Håstad
APPROX
2006
Springer
110views Algorithms» more  APPROX 2006»
15 years 7 months ago
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad ...
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 7 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
APPROX
2006
Springer
72views Algorithms» more  APPROX 2006»
15 years 7 months ago
Local Decoding and Testing for Homomorphisms
Elena Grigorescu, Swastik Kopparty, Madhu Sudan
130
Voted
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 7 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron