A functional equation often arising in the analysis of algorithms (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Load-balancing performance of consistent hashing: asymptotic analysis of random node join
IEEE/ACM Transactions on Networking (TON)
Renewal theory in the analysis of tries and strings
Theoretical Computer Science
| Hi-index | 0.00 |