Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems - Descriptional Complexity of Formal Systems (DCFS 2016) Access content directly
Conference Papers Year : 2016

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

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

Domains

Computer Science [cs]
Fichier principal
Vignette du fichier
416473_1_En_2_Chapter.pdf (246.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01633954

Submitted on : Monday, November 13, 2017-3:32:48 PM

Last modification on : Tuesday, February 27, 2024-10:22:04 AM

Long-term archiving on: Wednesday, February 14, 2018-3:31:29 PM

Download

Dates and versions

hal-01633954 , version 1 (13-11-2017)

Licence

Attribution

Identifiers

Cite

Gabriel Istrate, Cosmin Bonchiş. Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.18-28, ⟨10.1007/978-3-319-41114-9_2⟩. ⟨hal-01633954⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC1 IFIP-WG IFIP-DCFS IFIP-LNCS-9777 IFIP-WG1-2
50 View
137 Download

Altmetric

Share

Gmail Facebook X LinkedIn More