Succinct and Implicit Data Structures for Computational Geometry (Q2848977): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W180217369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range reporting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial match retrieval in implicit data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untangled monotonic chains and adaptive range search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of labeled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexes for strings, binary relations and multilabeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable searching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct geometric indexes supporting point location queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards in-place geometric algorithms and data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range searching on the RAM, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Approach to Data Structures and Its Use in Multidimensional Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Dynamic Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and storing similar lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: An in-place min-max priority search tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Range Majority Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representations of Arbitrary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum cocolorings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Data Structures for the Dictionary Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank/select on dynamic compressed sequences and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Data Structures for Dynamic Orthogonal Range Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Range Selection in Linear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Data Structures for Path Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Efficient Framework for Dynamic Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected asymptotically optimal planar point location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and select revisited and extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting points in halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Exact Worst Case Query Complexity of Planar Point Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved data structures for the orthogonal range successor problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:34, 6 July 2024

scientific article
Language Label Description Also known as
English
Succinct and Implicit Data Structures for Computational Geometry
scientific article

    Statements

    Succinct and Implicit Data Structures for Computational Geometry (English)
    0 references
    0 references
    13 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers