A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
type: Item
instance of: scholarly article
title: A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
zbMATH Open document ID: 1078.68025
DOI: 10.1016/S0890-5401(03)00142-1
author: Mizuhito Ogawa
published in: Information and Computation
publication date: 2004-11-23T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 2118418
zbMATH Keywords: Well-quasi-ordering
zbMATH Keywords: Higman's lemma
zbMATH Keywords: Indefinite data
zbMATH Keywords: Query answering
zbMATH Keywords: Linear-time algorithm
MaRDI profile type: Publication
cites work: Q4518442
cites work: Proving termination with multiset orderings
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: Q4246946
cites work: Q2757811
cites work: Ordering by Divisibility in Abstract Algebras
cites work: On conjunctive queries containing inequalities
cites work: The complexity of query evaluation in indefinite temporal constraint databases
cites work: Q5734436
cites work: Q4944974
cites work: AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
cites work: Well quasi-ordered sets
cites work: Graph minors. XX: Wagner's conjecture
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Ordinal numbers and the Hilbert basis theorem
cites work: Q4385530
cites work: The complexity of querying indefinite data about linearly ordered domains
cites work: An intuitionistic proof of Kruskal's theorem
description: scientific article; zbMATH DE number 2118418