Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Tree Compression with Top Trees

From MaRDI portal
Publication:5326558
Jump to:navigation, search

DOI10.1007/978-3-642-39206-1_14zbMATH Open1327.68084OpenAlexW2145136569WikidataQ56813220 ScholiaQ56813220MaRDI QIDQ5326558FDOQ5326558

Gad M. Landau, Philip Bille, Oren Weimann, Inge Li Gørtz

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_14




Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10)



Cited In (2)

  • Grammar-Based Tree Compression
  • Encoding trees by linear recurrence sequences






This page was built for publication: Tree Compression with Top Trees

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5326558&oldid=20016743"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 23:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki