Searching in random partially ordered sets
type: Item
instance of: scholarly article
title: Searching in random partially ordered sets
zbMATH Open document ID: 1068.68050
author: Yoshiharu Kohayakawa
author: Renato Carmo
author: Jair Donadelli
author: Eduardo S. Laber
published in: Theoretical Computer Science
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2085534
zbMATH Keywords: Searching
zbMATH Keywords: Search trees
zbMATH Keywords: Random partial orders
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.06.001
OpenAlex ID: W2697349394
cites work: Linear extensions of a random partial order
cites work: Decision Trees for Geometric Models
cites work: On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
cites work: Optimal Search in Trees
cites work: Q4864308
cites work: The Structure of Random Graph Orders
cites work: Q3142411
cites work: The average number of linear extensions of a partial order
cites work: Constructing optimal binary decision trees is NP-complete
cites work: On tail distribution of interpost distance
cites work: Asymptotic Enumeration of Partial Orders on a Finite Set
cites work: Every poset has a central element
cites work: Searching ordered structures
cites work: Minimum average cost testing for partially ordered components
cites work: Q3221403
cites work: Counting partial orders with a fixed number of comparable pairs
cites work: Phase transitions in the evolution of partial orders
DOI: 10.1016/J.TCS.2003.06.001
description: scientific article; zbMATH DE number 2085534