PTrie: Data Structure for Compressing and Storing Sets via Prefix Sharing-Reference-Cited by-同舟云学术

PTrie: Data Structure for Compressing and Storing Sets via Prefix Sharing

Published:2017 Issue: Volume: Page:248-265
ISSN:0302-9743
Container-title:Theoretical Aspects of Computing – ICTAC 2017
language:
Short-container-title:

Author:

Jensen Peter Gjøl,Larsen Kim Guldstrand,Srba Jiří

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-67729-3_15

Reference25 articles.

1. Askitis, N., Sinha, R.: HAT-trie: a cache-conscious trie-based data structure for strings. In: Proceedings of the Thirtieth Australasian Conference on Computer Science, vol. 62, pp. 97–105. Australian Computer Society Inc. (2007)

2. Bagwell, P.: Ideal hash trees. Es Grands Champs, vol. 1195 (2001)

3. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C–35(8), 677–691 (1986)

4. Lecture Notes in Computer Science;J Byg,2009

5. Jones, D.C.: HAT-trie implementation. https://github.com/dcjones/hat-trie . Accessed 19 Apr 2017

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Study of the efficiency of model checking techniques using results of the MCC from 2015 To 2019;International Journal on Software Tools for Technology Transfer;2021-06-01

2. STUBBORN SET REDUCTION FOR TWO-PLAYER REACHABILITY GAMES;LOG METH COMPUT SCI;2021

3. Recursive Variable-Length State Compression for Multi-core Software Model Checking;Lecture Notes in Computer Science;2021

4. Automatic Synthesis of Transiently Correct Network Updates via Petri Games;Application and Theory of Petri Nets and Concurrency;2021

5. Optimal compression of combinatorial state spaces;Innovations in Systems and Software Engineering;2019-05-20