An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms

Tushar S. Kulkarni, Bernd S. W. Schröder. An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms. In Rokia Missaoui, Jürg Schmid, editors, Formal Concept Analysis, 4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006, Proceedings. Volume 3874 of Lecture Notes in Computer Science, pages 30-44, Springer, 2006. [doi]

@inproceedings{KulkarniS06:1,
  title = {An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms},
  author = {Tushar S. Kulkarni and Bernd S. W. Schröder},
  year = {2006},
  doi = {10.1007/11671404_2},
  url = {http://dx.doi.org/10.1007/11671404_2},
  researchr = {https://researchr.org/publication/KulkarniS06%3A1},
  cites = {0},
  citedby = {0},
  pages = {30-44},
  booktitle = {Formal Concept Analysis, 4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006, Proceedings},
  editor = {Rokia Missaoui and Jürg Schmid},
  volume = {3874},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-32203-5},
}