EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS

DOI10.1142/S0129054104002625zbMath1067.68516MaRDI QIDQ3022022

Kun Suk Kim, Sartaj K. Sahni

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

red-black treespacket routingsplay treesbiased skip listsbursty accessdynamic router-tableslongest matching prefix

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• The Propagation of Energy by Waves and the Amplitude of A Light Wave
• A NEW WEIGHT BALANCED BINARY SEARCH TREE

This page was built for publication: EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS