Zobrazeno 1 - 10
of 436
pro vyhledávání: '"Belazzougui D"'
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only $n^{1+\delta}$ bits of memory, for any constant $\delta > 0$. The input keys are random wrt a wider class of the well studied and practically important
Externí odkaz:
http://arxiv.org/abs/1104.4353
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Belazzougui, D.1 Djamal.Belazzougui@cs.helsinki.fi, Kolpakov, R.2 foroman@mail.ru, Raffinot, M.3 raffinot@liafa.univ-paris-diderot.fr
Publikováno v:
Journal of Mathematical Sciences. Aug2018, Vol. 233 Issue 1, p1-9. 9p.
Autor:
Cunial F; Max Planck Institute for Molecular Cell Biology and Genetics (MPI-CBG and CSBD), Dresden 01307, Germany., Denas O; Blue River Technology, Sunnyvale, CA 94086, USA., Belazzougui D; CAPA, DTISI, Centre de Recherche sur l'Information Scientifique et Techique, Algiers, Algeria.
Publikováno v:
Bioinformatics (Oxford, England) [Bioinformatics] 2022 Mar 28; Vol. 38 (7), pp. 1838-1845.
Autor:
Shibuya Y; LIGM, Université Gustave Eiffel, Marne-la-Vallée, France., Belazzougui D; CAPA, DTISI, Centre de Recherche sur l'Information Scientifique et Technique, Algiers, DZ, Algeria., Kucherov G; LIGM, Université Gustave Eiffel, Marne-la-Vallée, France. gregory.kucherov@univ-eiffel.fr.; Skolkovo Institute of Science and Technology, Moscow, Russia. gregory.kucherov@univ-eiffel.fr.
Publikováno v:
Algorithms for molecular biology : AMB [Algorithms Mol Biol] 2022 Mar 21; Vol. 17 (1), pp. 5. Date of Electronic Publication: 2022 Mar 21.
Autor:
Shibuya Y; LIGM, Modèles et Algorithmes Group, Université Gustave Eiffel, Marne-la-Vallée, France., Belazzougui D; CAPA, DTISI, Centre de Reacherche sur l'Information Scientifique et Technique, Algiers, Algeria., Kucherov G; LIGM, CNRS, Modèles et Algorithmes Group, Université Gustave Eiffel, Marne-la-Vallée, France.; Skolkovo Institute of Science and Technology, Moscow, Russia.
Publikováno v:
Journal of computational biology : a journal of computational molecular cell biology [J Comput Biol] 2022 Feb; Vol. 29 (2), pp. 140-154. Date of Electronic Publication: 2022 Jan 18.
Autor:
Hadj Bouzid AI; CERIST, Research Center on Scientific and Technical Information, Algiers, Algeria., Yahiaoui S; CERIST, Research Center on Scientific and Technical Information, Algiers, Algeria., Lounis A; CERIST, Research Center on Scientific and Technical Information, Algiers, Algeria., Berrani SA; National Polytechnic School, Algiers, Algeria., Belbachir H; CERIST, Research Center on Scientific and Technical Information, Algiers, Algeria., Naïli Q; Centre d'imagerie scintigraphique, Blida, Algeria., Abdi MEH; Centre d'imagerie scintigraphique, Blida, Algeria., Bensalah K; CERIST, Research Center on Scientific and Technical Information, Algiers, Algeria., Belazzougui D; CERIST, Research Center on Scientific and Technical Information, Algiers, Algeria.
Publikováno v:
Studies in health technology and informatics [Stud Health Technol Inform] 2021 May 27; Vol. 281, pp. 332-336.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Belazzougui D., Venturini R.
Publikováno v:
24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 229–240, New orleans, Louisiana, USA, 5 gennaio 2013
info:cnr-pdr/source/autori:Belazzougui D.; Venturini R./congresso_nome:24th Annual ACM-SIAM Symposium on Discrete Algorithms/congresso_luogo:New orleans, Louisiana, USA/congresso_data:5 gennaio 2013/anno:2013/pagina_da:229/pagina_a:240/intervallo_pagine:229–240
info:cnr-pdr/source/autori:Belazzougui D.; Venturini R./congresso_nome:24th Annual ACM-SIAM Symposium on Discrete Algorithms/congresso_luogo:New orleans, Louisiana, USA/congresso_data:5 gennaio 2013/anno:2013/pagina_da:229/pagina_a:240/intervallo_pagine:229–240
Given a set of integer keys from a bounded universe along with associated data, the dictionary problem asks to answer two queries: membership and retrieval. Membership has to tell whether a given element is in the dictionary or not; Retrieval has to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9939ac5dc8ed6b38c37e66e856423ee4
https://openportal.isti.cnr.it/doc?id=people______::9939ac5dc8ed6b38c37e66e856423ee4
https://openportal.isti.cnr.it/doc?id=people______::9939ac5dc8ed6b38c37e66e856423ee4