Sorting and Recognition Problems for Ordered Sets

DOI10.1137/0217007MaRDI QIDQ3777462zbMATH OpenOpenAlexFDO

Authors U. Faigle, Gy. Turán

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0217007

zbMATH Keywords

algorithmcomplexityidentificationordered setsrecognition problemsorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3909755
• scientific article; zbMATH DE number 3907780
• scientific article; zbMATH DE number 512933
• scientific article; zbMATH DE number 4041286
• On the complexity of partial order properties

Cited in

(13)

• Recognition of order-preserving maps
• On the complexity of partial order properties
• Scaling limits for width two partially ordered sets: the incomparability window
• Pictures from Mongolia. Extracting the top elements from a partially ordered set
• On generalized comparison-based sorting problems
• scientific article; zbMATH DE number 3907780 (Why is no real title available?)
• scientific article; zbMATH DE number 3909739 (Why is no real title available?)
• scientific article; zbMATH DE number 3909755 (Why is no real title available?)
• scientific article; zbMATH DE number 55950 (Why is no real title available?)
• scientific article; zbMATH DE number 512933 (Why is no real title available?)
• Algorithms for the generalized poset sorting problem
• On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting
• An optimal algorithm for sorting in trees

This page was built for publication: Sorting and Recognition Problems for Ordered Sets

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