Author:
Ehara Shogo,Iwama Kazuo,Teruyama Junichi
Publisher
Springer International Publishing
Reference18 articles.
1. Ayala-Rincón, M., De Abreu, B.T., De Siqueira, J.: A variant of the Ford-Johnson algorithm that is more space efficient. Inf. Process. Lett. 102(5), 201–207 (2007)
2. Brightwell, G., Winkler, P.: Counting linear extensions. Order 8(3), 225–242 (1991)
3. Cooper, J.: Linear Extension Counting is Fixed-Parameter Tractable in Essential Width. AMS Southeastern Sectional Fall 2013. www.math.louisville.edu/~biro/ams/cooper.pdf
4. Edelkamp, S., Weiß, A.: QuickXsort: efficient sorting with $$n \log n - 1.399n + o(n)$$ n log n - 1.399 n + o ( n ) comparisons on average. In: CSR 2014, pp. 139–152 (2014)
5. Ford, L.R., Johnson, S.M.: A tournament problem. Am. Math. Mon. 66(5), 387–389 (1959)