The Range 1 Query (R1Q) Problem

DOI10.1007/978-3-319-08783-2_11MaRDI QIDQ2920450zbMATH OpenOpenAlexFDO

Authors Pramod Ganapathi, Samuel McCauley, Yuan Tang, Michael A. Bender, Rezaul Alam Chowdhury

Publication date 26 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08783-2_11

zbMATH Keywords

circulardeterministic algorithmnon-orthogonalorthogonalpolygonalR1Qrandomized algorithmrange emptinessrange queryrectangularsphericaltriangular

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• The range 1 query (R1Q) problem
• The reverse problem of range query
• scientific article; zbMATH DE number 1953879
• Range minimum queries in minimal space
• Practical range minimum queries revisited
• The analysis of range quickselect and related problems
• On the range maximum-sum segment query problem
• Algorithms and Computation

Cited in

(2)

• The range 1 query (R1Q) problem
• The reverse problem of range query

This page was built for publication: The Range 1 Query (R1Q) Problem

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