Inscriere cercetatori

Heapability, interactive particle systems, partial orders: results and open problems

Autori: Gabriel Istrate, Cosmin Bonchiș

Editorial: Proceedings of the 18th International Conference on Descriptive Complexity of Formal Systems (DCFS'2016), Lecture Notes in Computer Science, vol. 9777, p.18-28, Springer Verlag, 2016.


We outline results and open problems concerning partitioning of integer sequences and partial orders into heapable subsequences (previously defined and established by Byers et al.)