Data compression transformations for dynamically allocated data structures

DOI10.1007/3-540-45937-5_4MaRDI QIDQ4738369zbMATH OpenFDO

Authors Youtao Zhang, Rajiv Gupta

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2304/23040014.htm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies and applications (68U99)

Recommendations

• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
• CRAM: compressed random access memory
• Functional programs as compressed data
• A framework of dynamic data structures for string processing
• Experimental study of compressed stack algorithms in limited memory environments

Cited in

(8)

• A compile/Run-time environment for the automatic transformation of linked list data structures
• Rearranging data to maximize the efficiency of compression
• Compressed data structures: Dictionaries and data-aware measures
• x86 instruction reordering for code compression
• scientific article; zbMATH DE number 3852432 (Why is no real title available?)
• Compressed Data Structures for Dynamic Sequences
• The Vcodex Platform for Data Compression
• Experimental study of compressed stack algorithms in limited memory environments

Describes a project that uses

Uses Software

• SimpleScalar
• Wattch

This page was built for publication: Data compression transformations for dynamically allocated data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738369)