From exponential to almost linear decomposability of finite or infinite trees

Khalil Djelloul

Conference Papers Year : 2009

From exponential to almost linear decomposability of finite or infinite trees

(1)

1

Khalil Djelloul

Function : Author
PersonId : 845747

Laboratoire d'Informatique Fondamentale d'Orléans

Domains

Logic in Computer Science [cs.LO]

Khalil Djelloul : Connect in order to contact the contributor

https://hal.science/hal-00474386

Submitted on : Monday, April 19, 2010-8:22:39 PM

Last modification on : Saturday, June 25, 2022-10:11:21 AM

Dates and versions

hal-00474386 , version 1 (19-04-2010)

Identifiers

HAL Id : hal-00474386 , version 1

Cite

Khalil Djelloul. From exponential to almost linear decomposability of finite or infinite trees. ACM Symposium on applied computing (SAC), Mar 2009, United States. pp.897-902. ⟨hal-00474386⟩

From exponential to almost linear decomposability of finite or infinite trees

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share