Oct 31, 2023 · In this paper, we study the regime where the redundant bits is R=o(n), and show that when R is at least n/\text{poly}\log n, all operations can ...
Jan 4, 2024 · In this paper, we study the regime where the number of redundant bits is R = o(n), and show that when R is at least n/poly log n, all operations ...
They are “mini-dictionaries” maintaining a small set of keys, which can be encoded in one word, together with their (potentially large) values, and achieving ...
This paper studies the regime where the redundant bits is R=o(n), and shows that when R is at least $n/\text{poly}\log n$, all operations can be supported ...
Various proposals of a green metrics have been put forward, based on the consumption of resources, the coproduction of waste, the environmental performance.
Dynamic Dictionary with Subconstant Wasted Bits per Key. SODA 2024: 171-207 ... Dynamic Dictionary with Subconstant Wasted Bits per Key. CoRR abs ...
Dynamic Dictionary with Subconstant Wasted Bits per Key. T Li, J Liang, H Yu, R Zhou. Proc. 35th ACM-SIAM Symposium on Discrete Algorithms (SODA), 171-207, 2024.
Sep 9, 2023 · In this paper, we prove a matching cell-probe lower bound: For U = n1+Θ(1), any dictionary with O(log(k) n) wasted bits per key must have ...
Publications (6) ; Dynamic Dictionary with Subconstant Wasted Bits per Key · Chapter. January 2024 · 8 Reads · 2 Citations ; Tight Cell-Probe Lower Bounds for ...
Dynamic Dictionary with Subconstant Wasted Bits per Key. SODA 2024: 171-207 ... Dynamic Dictionary with Subconstant Wasted Bits per Key. CoRR abs ...