A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these pr...
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
Abstract: A closer look at typical information systems shows that relatively simple routines often contribute significantly to the overall expenses of the software development proc...
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
The complexity of deploying high-performance spatial structures in transactional DBMS environments has motivated researchers to experiment with the idea of reusing the effort inve...