The recursive structure of some ordering problems

DOI10.1007/BF01931280zbMATH Open0726.68041OpenAlexW2074891827MaRDI QIDQ802870FDOQ802870

Authors: N. E. Zubov 

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931280

Recommendations

• scientific article; zbMATH DE number 3861164
• Finding an Approximate Maximum
• On selecting the k largest with median tests
• Searching ordered structures
• Average case selection

zbMATH Keywords

ordering problemsUpper and lower boundsrelative complexity

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding the median
• Title not available (Why is that?)

Cited In (8)

• On the Complexity of Some Ordering Problems
• The number of preference orderings: a recursive approach
• Optimal composition ordering problems for piecewise linear functions
• Coupled bisection for root ordering
• The number of depth-first searches of an ordered set
• Title not available (Why is that?)
• A Knuth-Bendix-like ordering for orienting combinator equations
• Title not available (Why is that?)

This page was built for publication: The recursive structure of some ordering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802870)