Deferred Data Structuring

DOI10.1137/0217055MaRDI QIDQ3813273zbMATH OpenOpenAlexFDO

Authors Prabhakar Raghavan, Richard Karp, Rajeev Motwani

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0217055

zbMATH Keywords

computational geometryconvex-hulldeferred data structuresdominance countinghalf-plane intersectionlinear programminglower boundpreprocessingquery processingrandomized algorithm

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99) Algorithms in computer science (68W99)

Recommendations

• Dynamic deferred data structuring
• Deferred data structure for the nearest neighbor problem
• Priority Search Trees
• scientific article; zbMATH DE number 3911764
• Fractional cascading. I: A data structuring technique

Cited in

(8)

• Deferred data structure for the nearest neighbor problem
• Processing an offline insertion-query sequence with applications
• Synergistic solutions on multisets
• Processing an Offline Insertion-Query Sequence with Applications
• Towards optimal range medians
• Maximizing the optimality streak of deferred data structuring (a.k.a. database cracking)
• Lazy B-trees
• Dynamic deferred data structuring

This page was built for publication: Deferred Data Structuring

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