scientific article; zbMATH DE number 1827438

zbMATH Open1028.68518MaRDI QIDQ4781246

Yu. B. Nikitin

Publication date: 13 November 2002

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexitypartially ordered setssorting algorithmsapplication of graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Searching and sorting (68P10)

Related Items (1)

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Some optimal algorithms for decomposed partially ordered sets 👍 👎
• On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms 👍 👎
• On the upper bound of the complexity of sorting 👍 👎
• Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime 👍 👎
• On the complexity of sorting Cartesian products of partially ordered sets 👍 👎
• Algorithms over partially ordered sets 👍 👎

This page was built for publication:

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