Skip B-Trees

This publication has 19 references indexed in Scilit:

• Chord: a scalable peer-to-peer lookup protocol for internet applications
  IEEE/ACM Transactions on Networking, 2003
• Koorde: A Simple Degree-Optimal Distributed Hash Table
  Published by Springer Nature ,2003
• Dynamically Fault-Tolerant Content Addressable Networks
  Published by Springer Nature ,2002
• The Power of Two Random Choices: A Survey of Techniques and Results
  Published by Springer Nature ,2001
• Balanced Allocations
  SIAM Journal on Computing, 1999
• A DISTRIBUTED, REPLICATED, DATA-BALANCED SEARCH STRUCTURE
  International Journal of High Speed Computing, 1994
• Skip lists: a probabilistic alternative to balanced trees
  Communications of the ACM, 1990
• Concurrent search structure algorithms
  ACM Transactions on Database Systems, 1988
• Fault tolerance and storage reduction in binary search trees
  Information and Control, 1984
• Symmetric binary B-Trees: Data structure and maintenance algorithms
  Acta Informatica, 1972