Noisy Tree Data Structures and Quantum Applications

Autor: Khadiev, Kamil, Savelyev, Nikita, Ziatdinov, Mansur, Melnikov, Denis

The paper presents a technique for constructing noisy data structures called a walking tree. We apply it for a Red-Black tree (an implementation of a Self-Balanced Binary Search Tree) and a segment tree. We obtain the same complexity of the main oper

Externí odkaz: http://arxiv.org/abs/2210.11197

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Comprehensive analysis of telomerase inhibition by gallotannin.

Autor: Savelyev N; Lomonosov Moscow State University, Department of Chemistry, and A.N. Belozersky Institute of Physico-Chemical Biology, Moscow, 119992, Russia., Baykuzina P; Lomonosov Moscow State University, Faculty of Bioengineering and Bioinformatics, Moscow, 119992, Russia., Dokudovskaya S; UMR 8126, CNRS, University Paris-Sud, Université Paris Saclay, Institut de Cancérologie Gustave-Roussy, 94805, Villejuif, France., Lavrik O; Institute of Chemical Biology and Fundamental Medicine, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090, Russia.; Novosibirsk State University, Novosibirsk, 630090, Russia., Rubtsova M; Lomonosov Moscow State University, Department of Chemistry, and A.N. Belozersky Institute of Physico-Chemical Biology, Moscow, 119992, Russia.; Skolkovo Institute of Science and Technology, Skolkovo, Moscow region, 143025, Russia., Dontsova O; Lomonosov Moscow State University, Department of Chemistry, and A.N. Belozersky Institute of Physico-Chemical Biology, Moscow, 119992, Russia.; Skolkovo Institute of Science and Technology, Skolkovo, Moscow region, 143025, Russia.

Publikováno v: Oncotarget [Oncotarget] 2018 Apr 10; Vol. 9 (27), pp. 18712-18719. Date of Electronic Publication: 2018 Apr 10 (Print Publication: 2018).