103 search results - page 1 / 21 » Pattern avoidance in binary trees |
JCT
2010
13 years 3 months ago
2010
JFP
2006
13 years 4 months ago
2006
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
ESOP
2004
Springer
13 years 10 months ago
2004
Springer
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approac...
PPOPP
2010
ACM
14 years 2 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
LATA
2010
Springer
13 years 8 months ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...