Amanote Research
Register
Sign In
Constructing a Balanced, (Log(N)/Loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems
doi 10.1109/ptp.2004.1334949
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
D.S. Reeves
Publisher
IEEE
Related search
Constructing O(n Log N) Size Monotone Formulae for the K-Th Elementary Symmetric Polynomial of N Boolean Variables
An O(N Log N) Algorithm for Shape Modeling.
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
International Journal of Computational Geometry and Applications
Geometry
Applied Mathematics
Computational Theory
Computational Mathematics
Mathematics
Theoretical Computer Science
Topology
Using Aggregation for Adaptive Super-Peer Discovery on the Gradient Topology
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Undirected Graph Exploration With ⊝(log Log N) Pebbles
XYZ: A Scalable, Partially Centralized Lookup Service for Large-Scale Peer-To-Peer Systems
An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation
SIAM Journal on Scientific and Statistical Computing
Taxonomy Caching: A Scalable Low-CostMechanism for Indexing Remote Contents in Peer-To-Peer Systems
