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 internal binary search trees with memory management
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
LNCS 4051 - Dynamic Interpolation Search Revisited
LN1
Literature Survey - TDT 4150 GIS Databases: An Overview
Lists, Stacks, and Queues
Lists, sets and iterators
Lists, Sequences, and Iterators
Lists, Hash Tables, Trees - NEMCC Math/Science Division
