FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
Shannon [Sha48, Sha49] in celebrated works had shown that n bits of shared key is necessary and sufficient to transmit n-bit classical information in an information-theoretically ...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE