Special Issue on Algorithms and Data-Structures for Compressed Computation

被引：0

作者：

Policriti, Alberto ^{[1
]}

Prezza, Nicola ^{[2
]}

机构：

[1] Univ Udine, Dept Math Comp Sci & Phys, I-33100 Udine, Italy

[2] Ca Foscari Univ, Dept Environm Sci Informat & Stat, I-30172 Venice, Italy

来源：

关键词：

D O I：

10.3390/a15120457

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页数：2

共 5 条

[1] Text Indexing for Regular Expression Matching [J].

Gibney, Daniel ;

Thankachan, Sharma, V .

Hucke, Danny ;

Reh, Carl Philipp .

Koppl, Dominik .

[4] Storing Set Families More Compactly with Top ZDDs [J].

Matsuda, Kotaro ;

Denzumi, Shuhei ;

Sadakane, Kunihiko .

[5] Compressed Communication Complexity of Hamming Distance [J].

Mitsuya, Shiori ;

Nakashima, Yuto ;

Inenaga, Shunsuke ;

Bannai, Hideo ;

Takeda, Masayuki .