Fast prefix matching of bounded strings

DOI10.1145/996546.996550zbMath1085.68740OpenAlexW1995577344MaRDI QIDQ5463440

Glenn Fowler, Jia Wang, Balachander Krishnamurthy, Kiem-Phong Vo, Adam L. Buchsbaum

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/jea/2003/BuschsbaumFast/

zbMATH Keywords

performancealgorithmsmeasurementtriesexperimentationprefix matchingtable look-upip routing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Cites Work

• Fast parallel string prefix-matching
• Improved dynamic dictionary matching
• Fast packet classification for two-dimensional conflict-free filters
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms for the Longest Common Subsequence Problem
• On the Comparison Complexity of the String Prefix-Matching Problem
• Linear approximation of shortest superstrings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast prefix matching of bounded strings