Author:
Mathieu Claire,Ohrimenko Olga
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference7 articles.
1. B. Bosek, T. Krawczyk, The sub-exponential upper bound for on-line chain partitioning, in: FOCS, 2010, pp. 347–354.
2. On-line chain partitions of orders: A survey;Bosek;Order,2011
3. A. Chi-Chih Yao, Probabilistic computations: Toward a unified measure of complexity (extended abstract), in: FOCS, 1977, pp. 222–227.
4. A decomposition theorem for partially ordered sets;Dilworth;Ann. of Math.,1950
5. On-line chain partitions of orders;Felsner;Theoret. Comput. Sci.,1997