Sciweavers

STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 11 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
STOC
2007
ACM
85views Algorithms» more  STOC 2007»
14 years 11 months ago
Faster integer multiplication
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
Martin Fürer
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
15 years 2 days ago
3-query locally decodable codes of subexponential length
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
Klim Efremenko