research
∙
01/08/2023
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm
Binary search trees (BSTs) are one of the most basic and widely used dat...
share
research
∙
12/26/2022
On Ranges and Partitions in Optimal TCAMs
Traffic splitting is a required functionality in networks, for example f...
research
∙
12/26/2022
Codes for Load Balancing in TCAMs: Size Analysis
Traffic splitting is a required functionality in networks, for example f...
research
∙
12/29/2021