160
Voted
STOC
2000
ACM
16 years 6 days ago
2000
ACM
175
Voted
STOC
2000
ACM
16 years 6 days ago
2000
ACM
We consider a new model for computing with uncertainty. It is desired to compute a function f X1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
129
Voted
STOC
2000
ACM
16 years 6 days ago
2000
ACM
184
click to vote
STOC
2000
ACM
16 years 6 days ago
2000
ACM
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...
180
click to vote
STOC
2000
ACM
16 years 6 days ago
2000
ACM
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...
129
Voted
STOC
2000
ACM
16 years 6 days ago
2000
ACM
Ï ÔÖ × ÒØ Ø ¬Ö×Ø ÓعÔÓØ ØÓ ÖÓÙØ Ò Ð ÓÖ Ø Ñ ÓÖ Ø Ò ¢Ò Ñ × Û Ó× ÖÙÒÒ Ò Ø Ñ ÓÒ ÒÝ Ö ´ º º¸ ª´Òµµ Ñ ÒݹØÓ¹ÓÒ Ø ...
151
Voted
STOC
2000
ACM
16 years 6 days ago
2000
ACM
244
click to vote
STOC
2000
ACM
16 years 6 days ago
2000
ACM
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...
127
Voted
STOC
2000
ACM
16 years 6 days ago
2000
ACM