Sciweavers

STOC
2000
ACM
73views Algorithms» more  STOC 2000»
13 years 9 months ago
Combining fairness with throughput: online routing with multiple objectives
Ashish Goel, Adam Meyerson, Serge A. Plotkin
STOC
2000
ACM
134views Algorithms» more  STOC 2000»
13 years 9 months ago
Computing the median with uncertainty
We consider a new model for computing with uncertainty. It is desired to compute a function fX1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
Tomás Feder, Rajeev Motwani, Rina Panigrahy...
STOC
2000
ACM
83views Algorithms» more  STOC 2000»
13 years 9 months ago
Smoothing and cleaning up slivers
Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Mille...
STOC
2000
ACM
55views Algorithms» more  STOC 2000»
13 years 9 months ago
Self-testing of universal and fault-tolerant sets of quantum gates
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
Wim van Dam, Frédéric Magniez, Miche...
STOC
2000
ACM
66views Algorithms» more  STOC 2000»
13 years 9 months ago
On the sum-of-squares algorithm for bin packing
János Csirik, David S. Johnson, Claire Keny...
STOC
2000
ACM
117views Algorithms» more  STOC 2000»
13 years 9 months ago
Faster suffix tree construction with missing suffix links
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
Richard Cole, Ramesh Hariharan
STOC
2000
ACM
102views Algorithms» more  STOC 2000»
13 years 9 months ago
Hard-Potato routing
Ï ÔÖ × ÒØ Ø ¬Ö×Ø ÓعÔÓØ ØÓ ÖÓÙØ Ò Ð ÓÖ Ø Ñ ÓÖ Ø Ò ¢Ò Ñ × Û Ó× ÖÙÒÒ Ò Ø Ñ ÓÒ ÒÝ Ö ´ º º¸ ª´Òµµ Ñ ÒݹØÓ¹ÓÒ Ø ...
Costas Busch, Maurice Herlihy, Roger Wattenhofer
STOC
2000
ACM
96views Algorithms» more  STOC 2000»
13 years 9 months ago
Balanced allocations: the heavily loaded case
Petra Berenbrink, Artur Czumaj, Angelika Steger, B...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 9 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman