<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2010-07-19 10:46:19Computing Search algorithms Associative arrays Trie Y-fast trie X-fast trie Van Emde Boas tree Hash table Binary search tree Graph theory Binary trees Computer programming |
| Microsoft Word - NLA-monographdocDocID: 1qpZG - View Document |
| QP tries are smaller and faster than crit-bit trees Tony Finch University of CambridgeDocID: 1q5Aa - View Document |
| Concurrent Tries with Efficient Non-Blocking Snapshots Aleksandar Prokopec EPFL Nathan G. BronsonDocID: 1pYvl - View Document |
| Cache-Aware Lock-Free Concurrent Hash Tries Aleksandar Prokopec, Phil Bagwell, Martin Odersky École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland { rstname}.{lastname}@ep .chDocID: 1pQfB - View Document |
| MASC: Ultra-Low Energy Multiple-Access SingleCharge TCAM for Approximate Computing Mohsen Imani, Shruti Patil, Tajana S. Rosing CSE Department, University of California San Diego, La Jolla, CA 92093, USA {moimani, patil,DocID: 1pgFK - View Document |