The paper "CompactDFA: Scalable Pattern Matching using Longest Prefix Match Solutions", by Anat Bremler-Barr, Yaron Koral, David Hay, was accepted to IEEE/ACM Transactions on Networking, 2013.
Paper accepted to Transactions on Networking 2013
Submitted by deepness on Thu, 05/23/2013 - 19:28