Lower Bound Techniques for Data Structures
Lower bound for the worst case
Lower Bounds for Orthogonal Range Searching:
Lossless Compression of Binary Trees with Correlated Vertex Names
Looking at Data
Longest Prefix Matching using Bloom Filters
Longenbaugh ethesis
Logical Operations in Compact Geospatial Quadtrees
Logic, Algorithms and Data Structures The Big O(h)
Logarithmic Lower Bounds in the Cell-Probe Model
Logarithmic Lower Bounds in the Cell
Logarithmic data structures for multicores
Lock-free Shared Data Structures
Lock-Free Resizeable Concurrent Tries
Lock-Free Red-Black Trees Using CAS
Lock-free Parallel Algorithms: An Experimental Study
Lock-Free Data-Structure Iterators
Lock Free Data Structures using STMs in Haskell
Local Structure Discovery in Bayesian Networks
Load Balancing and Locality in Range
