We study algorithms for solving three problems on strings. These are sorting of n strings of
length k,“the Most Frequent String Search Problem”, and “searching intersection of two …

We study algorithms for solving three problems on strings. The first one is the Most
Frequently String Search Problem. The problem is the following. Assume that we have a …

We consider online algorithms as a request-answer game. An adversary that generates
input requests, and an online algorithm answers. We consider a generalized version of the …

KR Khadiev, DI Lin, “Quantum online algorithms for a model of the request-answer game with a
buffer”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 162 …

We study the classic frequent items problem in data streams, but from a competitive analysis
point of view. We consider the standard worst-case input model, as well as a weaker …

We consider online algorithms as a request-answer game. An adversary that generates
input requests, and an online algorithm answers. We consider a generalized version of the …

В статье онлайн-алгоритмы представляются в качестве игры «запрос-ответ». Это игра
двух игроков: алгоритма и противника. Противник, у которого хранятся входные …

Decentralized mining and information retrieval tasks in complex networks. Large scale
Internet and Web applications continuously perform data mining and information retrieval …