Low power fast and dense longest prefix match content addressable memory for IP routers. - Satendra Kumar Maurya; Lawrence T. Clark (ISLPED, 2009)

Out-of-order issue logic using sorting networks. - Siddhesh S. Mhambrey; Lawrence T. Clark; Satendra Kumar Maurya; Krzysztof S. Berezowski (ACM Great Lakes Symposium on VLSI, 2010)

Fast and scalable priority encoding using static CMOS. - Satendra Kumar Maurya; Lawrence T. Clark (ISCAS, 2010)

A Specialized Static Content Addressable Memory for Longest Prefix Matching in Internet Protocol Routing. - Satendra Kumar Maurya; Lawrence T. Clark (J. Low Power Electron., 2011)

A Dynamic Longest Prefix Matching Content Addressable Memory for IP Routing. - Satendra Kumar Maurya; Lawrence T. Clark (IEEE Trans. Very Large Scale Integr. Syst., 2011)

Low Complexity Out-of-Order Issue Logic Using Static Circuits. - Siddhesh S. Mhambrey; Satendra Kumar Maurya; Lawrence T. Clark (IEEE Trans. Very Large Scale Integr. Syst., 2013)