Add to ORKGWe present a randomized and a deterministic data structure for maintaining a dynamic family of sequences under equality tests of pairs of sequences and creations of new sequences by joining or splitting existing sequences. Both data structures support equality tests in O(1) time. The randomized version supports new sequence creations in O(log(2) n) expected time where n is the length of the sequence created. The deterministic solution supports sequence creations in O(log n (log m log* m + log n)) time for the mth operation
Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalizethe correctness of two fun...
Background: Tandem duplication, in the context of molecular biology, occurs as a result of mutationa...
) Yossi Matias Uzi Vishkin University of Maryland & Tel-Aviv University Abstract We present a n...
We present a randomized and a deterministic data structure for maintaining a dynamic family of seque...
We present a randomized and a deterministic data structure for maintaining a dynamic family of seque...
This paper is concerned with data structures for representing an arbitrary number of sets such that ...
In this paper we present deterministic fully dynamic algorithms for maintaining several properties o...
A dynamic data structure is given that maintains the minimal distance of a set of n points in k-dime...
International audienceWe present a general framework for computing parameters of dynamic networks wh...
Deterministic regular expressions are widely used in XML processing. For instance, all regular expre...
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmi...
We present dynamic programming algorithms for two exact statistical tests that frequently arise in c...
Sequence comparison, or the process of determining the similarity between two sequences, is an impor...
Abstract. Algorithms working on sequences are influenced by the statistical properties of the sequen...
An optimization method is introduced for generating minimum-length test sequences taking into accoun...
Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalizethe correctness of two fun...
Background: Tandem duplication, in the context of molecular biology, occurs as a result of mutationa...
) Yossi Matias Uzi Vishkin University of Maryland & Tel-Aviv University Abstract We present a n...
We present a randomized and a deterministic data structure for maintaining a dynamic family of seque...
We present a randomized and a deterministic data structure for maintaining a dynamic family of seque...
This paper is concerned with data structures for representing an arbitrary number of sets such that ...
In this paper we present deterministic fully dynamic algorithms for maintaining several properties o...
A dynamic data structure is given that maintains the minimal distance of a set of n points in k-dime...
International audienceWe present a general framework for computing parameters of dynamic networks wh...
Deterministic regular expressions are widely used in XML processing. For instance, all regular expre...
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmi...
We present dynamic programming algorithms for two exact statistical tests that frequently arise in c...
Sequence comparison, or the process of determining the similarity between two sequences, is an impor...
Abstract. Algorithms working on sequences are influenced by the statistical properties of the sequen...
An optimization method is introduced for generating minimum-length test sequences taking into accoun...
Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalizethe correctness of two fun...
Background: Tandem duplication, in the context of molecular biology, occurs as a result of mutationa...
) Yossi Matias Uzi Vishkin University of Maryland & Tel-Aviv University Abstract We present a n...