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

Autor:	Cosmin Bonchis, Gabriel Istrate
Přispěvatelé:	West University of Timișoara [Roumanie] (WUT), Institute e-Austria Timisoara (IeAT), Cezar Câmpeanu, Florin Manea, Jeffrey Shallit, TC 1, WG 1.2
Jazyk:	angličtina
Rok vydání:	2016
Předmět:	Particle system Discrete mathematics 010201 computation theory & mathematics Heapable sequences Posets 010102 general mathematics Integer sequence [INFO]Computer Science [cs] 0102 computer and information sciences 0101 mathematics 01 natural sciences Mathematics
Zdroj:	Lecture Notes in Computer Science 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS) 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⟩ Descriptional Complexity of Formal Systems ISBN: 9783319411132 DCFS
DOI:	10.1007/978-3-319-41114-9_2⟩
Popis:	International audience; 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.).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a2a6804d3f9ecc5e088c76c8d3ab7ec https://hal.inria.fr/hal-01633954/file/416473_1_En_2_Chapter.pdf Zobrazit plný text záznamu