Sciweavers

ISAAC
2004
Springer
142views Algorithms» more  ISAAC 2004»
15 years 6 months ago
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
Qi Cheng, Ming-Deh A. Huang
136
Voted
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 6 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
15 years 6 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
15 years 6 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
136
Voted
WDAG
2004
Springer
105views Algorithms» more  WDAG 2004»
15 years 6 months ago
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
D. V. S. Ravikant, Muthuramakrishnan Venkitasubram...
Algorithms
Top of PageReset Settings