scientific article; zbMATH DE number 5764825

MaRDI QIDQ3579414zbMATH OpenFDO

Authors Guy E. Blelloch

Publication date 6 August 2010

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited in

(13)

• Orthogonal range searching in linear and almost-linear space
• Dynamic path queries in linear space
• Dynamic index and LZ factorization in compressed space
• Efficient range searching for categorical and plain data
• Faster lightweight Lempel-Ziv parsing
• On the number of anchored rectangle packings for a planar point set
• Towards an optimal method for dynamic planar point location
• LZ-End Parsing in Linear Time
• Dynamic planar orthogonal point location in sublogarithmic time
• Nearly optimal separation between partially and fully retroactive data structures
• Top-\(k\) Manhattan spatial skyline queries
• How to cut corners and get bounded convex curvature
• Upper and lower bounds for fully retroactive graph problems

This page was built for publication:

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