FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2129120879> ?p ?o ?g. }

• W2129120879 abstract "In this paper we establish an intimate connection between dynamic range searching in the group model and combinatorial discrepancy. Our result states that, for a broad class of range searching data structures (including all known upper bounds), it must hold that t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>u</sub> t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>q</sub> = Ω(disc <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> /lg n) where t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>u</sub> is the worst case update time, t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>q</sub> the worst case query time and $disc$ is the combinatorial discrepancy of the range searching problem in question. This relation immediately implies a whole range of exceptionally high and near-tight lower bounds for all of the basic range searching problems. We list a few of them in the following: 1.For halfspace range searching in d-dimensional space, we get a lower bound of t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>u</sub> t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>q</sub> = Ω(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1-1/d</sup> /lg n). This comes within a lg n lg lg n factor of the best known upper bound. 2. For orthogonal range searching in d-dimensional space, we get a lower bound of t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>u</sub> t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>q</sub> = Ω(lg <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>d-2+μ(d)</sup> n), where μ(d) >; 0 is some small but strictly positive function of d. 3. For ball range searching in d-dimensional space, we get a lower bound of t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>u</sub> t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>q</sub> = Ω(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1-1/d</sup> /lg n). We note that the previous highest lower bound for any explicit problem, due to Patrascu [STOC'07], states that t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>q</sub> = Ω((lg n/lg(lg n + t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>u</sub> )) <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> ), which does however hold for a less restrictive class of data structures. Our result also has implications for the field of combinatorial discrepancy. Using textbook range searching solutions, we improve on the best known discrepancy upper bound for axis-aligned rectangles in dimensions d ≥ 3." @default.
• W2129120879 created "2016-06-24" @default.
• W2129120879 creator A5013551063 @default.
• W2129120879 date "2011-10-01" @default.
• W2129120879 modified "2023-09-26" @default.
• W2129120879 title "On Range Searching in the Group Model and Combinatorial Discrepancy" @default.
• W2129120879 cites W1595828591 @default.
• W2129120879 cites W1963524245 @default.
• W2129120879 cites W1985203234 @default.
• W2129120879 cites W2008497801 @default.
• W2129120879 cites W2009257058 @default.
• W2129120879 cites W2024611484 @default.
• W2129120879 cites W2028801888 @default.
• W2129120879 cites W2041210664 @default.
• W2129120879 cites W2049430926 @default.
• W2129120879 cites W2052137955 @default.
• W2129120879 cites W2065240689 @default.
• W2129120879 cites W2074906700 @default.
• W2129120879 cites W2089620427 @default.
• W2129120879 cites W2097240805 @default.
• W2129120879 cites W2128703518 @default.
• W2129120879 cites W2140322654 @default.
• W2129120879 cites W2149178517 @default.
• W2129120879 cites W2962777599 @default.
• W2129120879 cites W4235042979 @default.
• W2129120879 cites W4249137521 @default.
• W2129120879 cites W4254343065 @default.
• W2129120879 doi "https://doi.org/10.1109/focs.2011.14" @default.
• W2129120879 hasPublicationYear "2011" @default.
• W2129120879 type Work @default.
• W2129120879 sameAs 2129120879 @default.
• W2129120879 citedByCount "13" @default.
• W2129120879 countsByYear W21291208792012 @default.
• W2129120879 countsByYear W21291208792013 @default.
• W2129120879 countsByYear W21291208792014 @default.
• W2129120879 countsByYear W21291208792015 @default.
• W2129120879 countsByYear W21291208792018 @default.
• W2129120879 crossrefType "proceedings-article" @default.
• W2129120879 hasAuthorship W2129120879A5013551063 @default.
• W2129120879 hasConcept C11413529 @default.
• W2129120879 hasConcept C114614502 @default.
• W2129120879 hasConcept C118615104 @default.
• W2129120879 hasConcept C127413603 @default.
• W2129120879 hasConcept C146978453 @default.
• W2129120879 hasConcept C204323151 @default.
• W2129120879 hasConcept C33923547 @default.
• W2129120879 hasConcept C41008148 @default.
• W2129120879 hasConceptScore W2129120879C11413529 @default.
• W2129120879 hasConceptScore W2129120879C114614502 @default.
• W2129120879 hasConceptScore W2129120879C118615104 @default.
• W2129120879 hasConceptScore W2129120879C127413603 @default.
• W2129120879 hasConceptScore W2129120879C146978453 @default.
• W2129120879 hasConceptScore W2129120879C204323151 @default.
• W2129120879 hasConceptScore W2129120879C33923547 @default.
• W2129120879 hasConceptScore W2129120879C41008148 @default.
• W2129120879 hasLocation W21291208791 @default.
• W2129120879 hasOpenAccess W2129120879 @default.
• W2129120879 hasPrimaryLocation W21291208791 @default.
• W2129120879 hasRelatedWork W1967523843 @default.
• W2129120879 hasRelatedWork W1978042415 @default.
• W2129120879 hasRelatedWork W2017331178 @default.
• W2129120879 hasRelatedWork W2153913439 @default.
• W2129120879 hasRelatedWork W2351491280 @default.
• W2129120879 hasRelatedWork W2371447506 @default.
• W2129120879 hasRelatedWork W2386767533 @default.
• W2129120879 hasRelatedWork W2976797620 @default.
• W2129120879 hasRelatedWork W303980170 @default.
• W2129120879 hasRelatedWork W3086542228 @default.
• W2129120879 isParatext "false" @default.
• W2129120879 isRetracted "false" @default.
• W2129120879 magId "2129120879" @default.
• W2129120879 workType "article" @default.