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.).
Type de document :
Communication dans un congrès
Cezar Câmpeanu; Florin Manea; Jeffrey Shallit. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9777, pp.18-28, 2016, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-41114-9_2〉
Liste complète des métadonnées

Littérature citée [32 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01633954
Contributeur : Hal Ifip <>
Soumis le : lundi 13 novembre 2017 - 15:32:48
Dernière modification le : lundi 13 novembre 2017 - 15:35:34

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Gabriel Istrate, Cosmin Bonchiş. Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. Cezar Câmpeanu; Florin Manea; Jeffrey Shallit. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9777, pp.18-28, 2016, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-41114-9_2〉. 〈hal-01633954〉

Partager

Métriques

Consultations de la notice

17