Algorithms in C
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fast Updating Algorithms for TCAMs
IEEE Micro
Algorithms for packet classification
IEEE Network: The Magazine of Global Internetworking
A keyword match processor architecture using content addressable memory
Proceedings of the 14th ACM Great Lakes symposium on VLSI
A nonredundant ternary CAM circuit for network search engines
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A 2-Level TCAM Architecture for Ranges
IEEE Transactions on Computers
Fast data stream algorithms using associative memories
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Ternary CAM power and delay model: extensions and uses
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
TURBONFS: turbo nand flash search
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Fast computation of database operations using content-addressable memories
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
An efficient technique for longest prefix matching in network routers
VDAT'12 Proceedings of the 16th international conference on Progress in VLSI Design and Test
Recursive design of hardware priority queues
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
Sorting and searching are classic problems in computing. Although several RAM-based solutions exist, algorithms using ternary content-addressable memories offer performance benefits. Using these algorithms, a TCAM can sort in O(n) memory cycles.