{"title":"LZRW1没有哈希","authors":"Y. Reznik","doi":"10.1109/DCC.1998.672311","DOIUrl":null,"url":null,"abstract":"Summary form only given. A very fast longest-match string search algorithm for Ziv-Lempel compression has been proposed. The new algorithm uses a variable-radix search tree of limited maximum size with an appropriate node-replacement strategy. The efficiency of the new algorithm has been practically evaluated using the LZRW1 implementation as a test model. The results of the evaluation are presented in a table.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"LZRW1 without hashing\",\"authors\":\"Y. Reznik\",\"doi\":\"10.1109/DCC.1998.672311\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. A very fast longest-match string search algorithm for Ziv-Lempel compression has been proposed. The new algorithm uses a variable-radix search tree of limited maximum size with an appropriate node-replacement strategy. The efficiency of the new algorithm has been practically evaluated using the LZRW1 implementation as a test model. The results of the evaluation are presented in a table.\",\"PeriodicalId\":191890,\"journal\":{\"name\":\"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1998.672311\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1998.672311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Summary form only given. A very fast longest-match string search algorithm for Ziv-Lempel compression has been proposed. The new algorithm uses a variable-radix search tree of limited maximum size with an appropriate node-replacement strategy. The efficiency of the new algorithm has been practically evaluated using the LZRW1 implementation as a test model. The results of the evaluation are presented in a table.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
