International Workshop on Descriptional Complexity of Formal Systems

DCFS 2016: Descriptional Complexity of Formal Systems pp 18-28

Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems

Conference paper

DOI: 10.1007/978-3-319-41114-9_2

Volume 9777 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.).

Keywords

Heapable sequences Posets 

Copyright information

© IFIP International Federation for Information Processing 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceWest University of TimişoaraTimişoaraRomania
  2. 2.e-Austria Research InstituteTimişoaraRomania