4463 search results - page 297 / 893 » computing 2000 |
160
click to vote
EEF
2000
15 years 10 months ago
2000
Markovian models have been used for about a century now for the evaluation of the performance and dependability of computer and communication systems. In this paper, we give a conc...
153
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
180
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
181
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
136
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...