In this paper, we consider two versions of the Text Assembling problem. ...
The lecture notes contain three parts. The first part is Grover's Search...
The paper presents a technique for constructing noisy data structures ca...
In this paper, we study quantum Ordered Binary Decision Diagrams(OBDD)
m...
We present the quantum algorithm for the Longest Trail Problem. The prob...
In this work, we consider the performance of using a quantum algorithm t...
In this paper, we consider the “Shortest Superstring Problem”(SSP) or th...
We consider the recognition problem of the Dyck Language generalized for...
We consider online algorithms for the k-server problem on trees. Chrobak...
We study the quantum query complexity of two problems.
First, we consi...
We study the applicability of quantum algorithms in computational game t...
We consider online algorithms for the k-servers problem on trees. There ...
We study algorithms for solving the problem of constructing a text (long...
We study algorithms for solving three problems on strings. The first one...
We consider the problem of determining if a sequence of parentheses is w...
In the paper, we focus on complexity of C5.0 algorithm for constructing
...
Finding a marked vertex in a graph can be a complicated task when using
...
We study algorithms for solving Subtraction games, which sometimes are
r...
In this paper, we present Quantum Dynamic Programming approach for probl...
Online algorithms are known model that is investigated with respect to a...
We introduce a new type of nonuniform two--way automaton that can use a
...
In this paper, we consider online algorithms. Typically the model is
inv...
Online algorithm is a well-known computational model. We introduce quant...