Search and replication in unstructured peer-to-peer networks
- Qin Lv, P. Cao, E. Cohen, Kai Li, S. Shenker
- Computer ScienceInternational Conference on Supercomputing
- 2002
This paper proposes a query algorithm based on multiple random walks that resolves queries almost as quickly as Gnutella's flooding method while reducing the network traffic by two orders of magnitude in many cases.
Reachability and distance queries via 2-hop labels
- E. Cohen, E. Halperin, Haim Kaplan, U. Zwick
- Computer ScienceACM-SIAM Symposium on Discrete Algorithms
- 6 January 2002
The proposed data structure for representing all distances in a graph is distributed in the sense that it may be viewed as assigning labels to the vertices, such that a query involving vertices u and v may be answered using only the labels of u andV.
Replication strategies in unstructured peer-to-peer networks
- E. Cohen, S. Shenker
- Computer ScienceConference on Applications, Technologies…
- 1 October 2002
A new understanding of replication is shown and it is shown that currently deployed replication strategies are far from optimal and that optimal replication is attainable by protocols that resemble existing ones in simplicity and operation.
Size-Estimation Framework with Applications to Transitive Closure and Reachability
- E. Cohen
- Computer Science, MathematicsJournal of computer and system sciences (Print)
- 1 December 1997
This work presents anO(m) time randomized (Monte Carlo) algorithm that estimates, with small relative error, the sizes of all reachability sets and the transitive closure.
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs
- David Applegate, E. Cohen
- Computer ScienceConference on Applications, Technologies…
- 25 August 2003
It is possible to obtain a robust routing that guarantees a nearly optimal utilization with a fairly limited knowledge of the applicable traffic demands, according to a diverse collection of ISP networks.
Finding interesting associations without support pruning
- E. Cohen, Mayur Datar, Cheng Yang
- Computer ScienceProceedings / International Conference on Data…
- 29 February 2000
This work develops a family of algorithms for solving association rule mining, employing a combination of random sampling and hashing techniques and provides an analysis of the algorithms developed and conduct experiments on real and synthetic data to obtain a comparative performance analysis.
Labeling dynamic XML trees
- E. Cohen, Haim Kaplan, T. Milo
- Computer ScienceACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 3 June 2002
Algorithms to label the nodes of an XML tree which is subject to insertions and deletions of nodes are presented and it is proved that their algorithms assign the shortest possible labels which satisfy these requirements.
Search and replication in unstructured peer-to-peer networks
- Qin Lv, P. Cao, E. Cohen, K. Li, S. Shenker
- Computer Science
- 22 June 2002
This paper proposes a query algorithm based on multiple random walks that resolves queries almost as quickly as Gnutella's flooding method while reducing the network traffic by two orders of magnitude in many cases.
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees
- E. Cohen, D. Delling, Thomas Pajor, Renato F. Werneck
- Computer ScienceInternational Conference on Information and…
- 26 August 2014
This work develops a novel sketch-based design for influence computation, called SKIM, which scales to graphs with billions of edges, with one to two orders of magnitude speedup over the best greedy methods.
Polylog-time and near-linear work approximation scheme for undirected shortest paths
- E. Cohen
- Computer ScienceSymposium on the Theory of Computing
- 23 May 1994
A polylog-time randomized algorithm that computes paths within (1+0(1/ polylog n)) of shortest from s source nodes to alI other nodes in weighted undirected networks with n nodes and m edges (for any fixed co > O) and this work bound nearly matches the O(sm) sequential time.
...
...