Streaming partitioning of sequences and trees

DOI10.4230/LIPICS.ICDT.2016.13MaRDI QIDQ5276193zbMATH OpenOpenAlexFDO

Authors Christian Konrad

Publication date 14 July 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/icdt/icdt2016.html#Konrad16

zbMATH Keywords

communication complexitydata partitioningstreaming algorithmsXML documents

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Approximation algorithms (68W25) Algorithms on strings (68W32)

Recommendations

• Streaming balanced graph partitioning algorithms for random graphs
• scientific article; zbMATH DE number 1424324
• Optimal Partitioning of Sequences
• Data-streams and histograms
• Validating XML documents in the streaming model with external memory

Cited in

(3)

• Guessing fractions of online sequences
• Range partitioning within sublinear time: algorithms and lower bounds
• Streaming balanced graph partitioning algorithms for random graphs

This page was built for publication: Streaming partitioning of sequences and trees

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