Abstract
Davenport-Schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. We show that the maximal length of a Davenport-Schinzel sequence composed of n symbols is Θ(nα(n)),where α(n) is the functional inverse of Ackermann's function, and is thus very slow growing. This is achieved by establishing an equivalence between such sequences and generalized path compression schemes on rooted trees, and then by analyzing these schemes.
| Original language | English |
|---|---|
| Title of host publication | 25th Annual Symposium on Foundations of Computer Science, FOCS 1984 |
| Publisher | IEEE Computer Society |
| Pages | 313-319 |
| Number of pages | 7 |
| ISBN (Electronic) | 081860591X |
| State | Published - 1984 |
| Externally published | Yes |
| Event | 25th Annual Symposium on Foundations of Computer Science, FOCS 1984 - Singer Island, United States Duration: 24 Oct 1984 → 26 Oct 1984 |
Publication series
| Name | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
|---|---|
| Volume | 1984-October |
| ISSN (Print) | 0272-5428 |
Conference
| Conference | 25th Annual Symposium on Foundations of Computer Science, FOCS 1984 |
|---|---|
| Country/Territory | United States |
| City | Singer Island |
| Period | 24/10/84 → 26/10/84 |
Bibliographical note
Publisher Copyright:© 1984 IEEE.