432 search results - page 17 / 87 » Internally deterministic parallel algorithms can be fast |
FSE
2008
Springer
14 years 11 months ago
2008
Springer
Hash functions are an important building block in almost all security applications. In the past few years, there have been major advances in the cryptanalysis of hash functions, es...
STOC
2007
ACM
15 years 9 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
ICDCS
2000
IEEE
15 years 1 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
FOCS
2000
IEEE
15 years 1 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...
ORL
1998
14 years 9 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...