The communication complexity of interval orders

U. Faigle, Rainer Schrader, György Turan

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
75 Downloads (Pure)


The communication complexity of interval orders is studied within the following model. Two players choose two elements x and y and want to determine whether x<y holds by exchanging as few bits of information as possible. It is shown that an optimal one-way protocol exists by first establishing a rank-optimality result for a subclass of generalized interval orders. It turns out that the deterministic and nondeterministic communication complexities coincide for generalized interval orders. The analogous statement for the complementary relation is true for interval orders in the strict sense while it need not hold for generalized interval orders.
Original languageUndefined
Pages (from-to)19-28
Number of pages10
JournalDiscrete applied mathematics
Issue number1
Publication statusPublished - 1992


  • IR-29864
  • METIS-140498

Cite this