Top-k Color Queries on Tree Paths

No abstract is available for this paper.

• Publication year

  2013

• Venue

  SPIRE

• Publication date

  2013-10-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-02432-5_15
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Determinacy and Rewriting of Top-Down and MSO Tree Transformations

  2013cited by this paper
• Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees

  2013cited by this paper
• Succinct Data Structures for Path Queries

  2012cited by this paper
• Top-k document retrieval in optimal time and linear space

  2012cited by this paper
• A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares

  2012cited by this paper
• Succinct representations of weighted trees supporting path queries

  2012cited by this paper
• Better Space Bounds for Parameterized Range Majority and Minority

  2012cited by this paper
• Algorithms – ESA 2012

  2012cited by this paper
• Linear-Space Data Structures for Range Minority Query in Arrays

  2012cited by this paper
• Range majority in constant time and linear space

  2011cited by this paper
• Linear-Space Data Structures for Range Mode Query in Arrays

  2011cited by this paper
• Improved Compressed Indexes for Full-Text Document Retrieval

  2011cited by this paper
• Finding Frequent Elements in Compressed 2D Arrays and Strings

  2011cited by this paper
• Path Queries in Weighted Trees

  2011cited by this paper
• Colored range queries and document retrieval

  2010cited by this paper
• Extracting Powers and Periods in a String from Its Runs Structure

  2010cited by this paper
• Top-K color queries for document retrieval

  2010influential reference
• Range Quantile Queries: Another Virtue of Wavelet Trees

  2009cited by this paper
• Towards Optimal Range Medians

  2009cited by this paper
• Space-Efficient Framework for Top-k String Retrieval Problems

  2009cited by this paper
• Algorithms and Data Structures

  2003cited by this paper
• Range Mode and Range Median Queries on Lists and Trees

  2003cited by this paper
• Efficient algorithms for document retrieval problems

  2002cited by this paper
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths

  1990cited by this paper
• A data structure for dynamic trees

  1981cited by this paper
• On Observing Nondeterminism and Concurrency

  1980cited by this paper

• Data Structures for Categorical Path Counting Queries

  2022cites this paper
• Succinct Indices for Path Minimum, with Applications

  2016cites this paper
• Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees

  2013cites this paper