The NDN Forwarding Plane
The ND2DB attack: Database content extraction using timing Abstract Ariel Futoransky
The ND-Tree - Department of Computer Science
The Nature of Geographic Data
The Map ADT and Hash Tables
The Lock-Free k-LSM Relaxed Priority Queue
The List ADT
The LHAM log-structured history data access method
The LevelArray: A Fast, Practical Long
the lecture notes from the Foundations of Computer Science module
The Knowledge Warehouse: The Next Step Beyond the Data Warehouse
The Java Collections Framework
The Hybrid CART-Logit Model in Classification and Data Mining
The HV-tree: a Memory Hierarchy Aware Version Index
The height of a heap
The Grid File: An Adaptable, Symmetric Multikey File Structure
The Greedy Algorithm for Shortest Common Superstrings Problem
Why you shouldn`t use set (and what you should use instead) Matt
Why Verbs are Harder to Learn than Nouns:
Why a tree? Example Tree Terminology Example Tree Ordered Trees
