In many pattern matching applications the text has some properties attached to various of its parts. Pattern Matching with Properties (Property Matching, for short), involves a string matchingâ€¦ (More)

Suffix trees and suffix arrays are two of the most widely used data structures for text indexing. Each uses linear space and can be constructed in linear time for polynomially sized alphabets.â€¦ (More)

The well-known problem of the longest common subsequence (LCS), of two strings of lengths n and m respectively, is O(nm)-time solvable and is a classical distance measure for strings. Anotherâ€¦ (More)

2012 IEEE 53rd Annual Symposium on Foundations ofâ€¦

2012

The problem of Text Indexing is a fundamental algorithmic problem in which one wishes to preprocess a text in order to quickly locate pattern queries within the text. In the ever evolving world ofâ€¦ (More)

In edge orientations, the goal is usually to orient (direct) the edges of an undirected network (modeled by a graph) such that all outdegrees are bounded. When the network is fully dynamic, i.e.,â€¦ (More)

Recently there has been much interest in the Property Indexing Problem ([1, 13, 14]), where one is interested to preprocess a text T of size n over alphabet Î£ (which we assume is of constant size),â€¦ (More)

We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O (âˆš n(log logn)2 logn ) and constant query time. This improves on the previous bestâ€¦ (More)