The Sub-exponential Upper Bound for On-Line Chain Partitioning.

MLA

Bosek, B., and T. Krawczyk. “The Sub-Exponential Upper Bound for On-Line Chain Partitioning.” 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), Jan. 2010, pp. 347–54. EBSCOhost, https://doi.org/10.1109/FOCS.2010.40.

APA

Bosek, B., & Krawczyk, T. (2010). The Sub-exponential Upper Bound for On-Line Chain Partitioning. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 347–354. https://doi.org/10.1109/FOCS.2010.40

Chicago

Bosek, B., and T. Krawczyk. 2010. “The Sub-Exponential Upper Bound for On-Line Chain Partitioning.” 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), January, 347–54. doi:10.1109/FOCS.2010.40.