Part of the Lecture Notes in Computer Science book series (LNCS, volume 9777)
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
- Cite this paper as:
- Istrate G., Bonchiş C. (2016) Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. In: Câmpeanu C., Manea F., Shallit J. (eds) Descriptional Complexity of Formal Systems. DCFS 2016. Lecture Notes in Computer Science, vol 9777. Springer, Cham
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.).
KeywordsHeapable sequences Posets
© IFIP International Federation for Information Processing 2016