Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
Survey and taxonomy of ip address lookup algorithms
Fast address lookups using controlled prefix expansion
An Internet-Wide View into DNS Lookup Patterns
The string B-tree: a new data structure for string search in external memory and its applications
A practical scalable distributed B-tree
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
The Bw-Tree: A B-tree for new hardware platforms
Serving DNS Using a Peer-to-Peer Lookup Service
An efficient algorithm for dynamic shortest path tree update in network routing
Fast And Space Efficient Trie Searches
A lock-free B+tree
Design and evaluation of incremental data structures and algorithms for dynamic query interfaces
Efficient In-Memory Indexing with Generalized Prefix Trees.
Adaptive algorithms for cache-efficient trie search
TCAM architecture for IP lookup using prefix properties
A data structure for dynamic trees
Fast binary and multiway prefix searches for packet forwarding
A class of dynamic memory allocation algorithms
Scalable Hashing-Based Network Discovery
Sorting And Indexing With Partitioned B-Trees
CUTE: constrained and unconstrained testing environment
an automata - theoretic approach to automatic program verification ( preliminary report ) .
Routing lookups in hardware at memory access speeds
Motion and Teaching of a NAO Robot
Learning Action Primitives for Multi-level Video Event Understanding