QP tries are smaller and faster than crit-bit trees Tony Finch University of Cambridge

First Page		Document Content
Date: 2016-03-05 17:06:25 Hashing Computer programming Information science Information retrieval Finite automata Trie Associative arrays Radix tree Hash tree Search algorithms Hash array mapped trie Hamming weight		QP tries are smaller and faster than crit-bit trees Tony Finch University of Cambridge Add to Reading List Source URL: tinytocs.ece.utexas.edu Download Document from Source Website File Size: 89,97 KB Share Document on Facebook

	Microsoft Word - NLA-monographdoc DocID: 1qpZG - View Document
	QP tries are smaller and faster than crit-bit trees Tony Finch University of Cambridge DocID: 1q5Aa - View Document
	Concurrent Tries with Efficient Non-Blocking Snapshots Aleksandar Prokopec EPFL Nathan G. Bronson DocID: 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.ch DocID: 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