Elementary Data Structures
Eindhoven University of Technology MASTER An experimental
EG22806814
Efficient, Oblivious Data Structures for MPC
Efficient Verified Red-Black Trees 1 September 2011 ANDREW W. APPEL
Efficient Substructure Discovery from Large Semi
Efficient Sorting and Searching in Rendering Algorithms
Efficient Similarity Search for Hierarchical Data in Large Databases
Efficient Searching with Linear Constraints
Efficient representation of integer sets
Efficient Minimal Perfect Hash Language Models
Efficient Memory Management for Lock
Efficient IP Table Lookup via Adaptive Stratified Trees with - IIT-CNR
Efficient implementation of lazy suffix trees
Efficient External-Memory Data Structures and Applications
Efficient External-Memory Bisimulation on DAGs
Efficient Evaluation of Radial Queries using the Target Tree
Efficient Differential Timeslice Computation
Efficient Data Structures for Storing Partitions of Integers
Efficient data structures for sparse network representation
