Succinct Data Structures ... Potential for Symbolic Computation?

From MaRDI portal

Revision as of 21:04, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2985800

Jump to:navigation, search

DOI10.1145/2930889.2930944zbMath1361.68070OpenAlexW2488667214WikidataQ131117023 ScholiaQ131117023MaRDI QIDQ2985800

J. Ian Munro

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2930889.2930944

zbMATH Keywords

data structures succinct data structures space efficiency

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

This page was built for publication: Succinct Data Structures ... Potential for Symbolic Computation?

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2985800&oldid=15995295"