Sciweavers

144 search results - page 2 / 29
» Generalized Dyck tilings
Sort
View
EJC
2010
13 years 5 months ago
Bijections for a class of labeled plane trees
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
Nancy S. S. Gu, Helmut Prodinger, Stephan Wagner
ESOP
2009
Springer
13 years 8 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 4 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
JCSS
2011
81views more  JCSS 2011»
12 years 11 months ago
Representing real numbers in a generalized numeration system
Abstract. We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider ...
Emilie Charlier, Marion Le Gonidec, Michel Rigo
ICS
2009
Tsinghua U.
13 years 11 months ago
Parametric multi-level tiling of imperfectly nested loops
Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multilevel tiled code is essential for maximizing da...
Albert Hartono, Muthu Manikandan Baskaran, C&eacut...