Multiple choice tries and distributed hash tables (Q3633017): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PATRICIA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20234 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4230636836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic process on the hypercube with applications to peer-to-peer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration inequalities using the entropy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Application of the Borel-Cantelli Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: File structures using hashing functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized allocation processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of trie-like structures under the density model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laws of large numbers and tail inequalities for random tries and PATRICIA trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple efficient load-balancing algorithms for peer-to-peer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of full levels in tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on growing binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Viceroy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality involving multinomial probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced binary trees for ID management and load balance in distributed hash tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel architectures for P2P applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotical growth of a class of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in a random digital tree: limiting distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the size of tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on V-ary asymmetric tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank

Latest revision as of 15:43, 1 July 2024

scientific article
Language Label Description Also known as
English
Multiple choice tries and distributed hash tables
scientific article

    Statements

    Multiple choice tries and distributed hash tables (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2009
    0 references
    random tries
    0 references
    random data structures
    0 references
    probabilistic analysis of algorithms
    0 references
    algorithms on sequences
    0 references
    distributed hash tables
    0 references

    Identifiers