The communication complexity of interval orders

DOI10.1016/0166-218X(92)90019-7zbMath0757.94002OpenAlexW2114061372MaRDI QIDQ1201817

Ulrich Faigle, Rainer Schrader, György Turán

Publication date: 17 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90019-7

zbMATH Keywords

communication complexitiescommunication complexity of interval ordersoptimal one-way protocol

Mathematics Subject Classification ID

Communication theory (94A05)

Related Items (2)

Partial orders and their convex subsets ⋮ Tree-visibility orders

Cites Work

• Interval orders without odd crowns are defect optimal
• On the complexity of interval orders and semiorders
• Intransitive indifference with unequal indifference intervals
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach

This page was built for publication: The communication complexity of interval orders