%0 Conference Proceedings
%T Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
%+ Universitatea de Vest din Timișoara [România] = West University of Timișoara [Romania] = Université Ouest de Timișoara [Roumanie] (UVT)
%+ Institute e-Austria Timisoara (IeAT)
%A Istrate, Gabriel
%A Bonchiş, Cosmin
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
%C Bucharest, Romania
%Y Cezar Câmpeanu
%Y Florin Manea
%Y Jeffrey Shallit
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-9777
%P 18-28
%8 2016-07-05
%D 2016
%R 10.1007/978-3-319-41114-9_2
%K Heapable sequences
%K Posets
%Z Computer Science [cs]Conference papers
%X 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.).
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01633954/document
%2 https://inria.hal.science/hal-01633954/file/416473_1_En_2_Chapter.pdf
%L hal-01633954
%U https://inria.hal.science/hal-01633954
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-LNCS-9777
%~ IFIP-WG1-2