default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLoïck Lhote
Person information
- affiliation: University of Caen, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Loïck Lhote, Béatrice Markhoff, Arnaud Soulet:
The Structure and Dynamics of Knowledge Graphs, with Superficiality. CoRR abs/2305.08116 (2023)
2010 – 2019
- 2019
- [c9]Ali Akhavi, Julien Clément
, Dimitri Darthenay, Loïck Lhote, Brigitte Vallée:
Dichotomic Selection on Words: A Probabilistic Analysis. CPM 2019: 19:1-19:19 - 2018
- [j7]Valérie Berthé, Loïck Lhote, Brigitte Vallée:
The Brun gcd algorithm in high dimensions is almost always subtractive. J. Symb. Comput. 85: 72-107 (2018) - 2017
- [c8]Philippe Regnault, Valérie Girardin, Loïck Lhote:
Weighted Closed Form Expressions Based on Escort Distributions for Rényi Entropy Rates of Markov Chains. GSI 2017: 648-656 - 2016
- [b1]Loïck Lhote:
Exemples d'analyses d'algorithmes en Arithmétique, Théorie de l'Information et Fouille de Données. Normandy University, France, 2016 - [j6]Valérie Berthé, Loïck Lhote, Brigitte Vallée:
Probabilistic analyses of the plain multiple gcd algorithm. J. Symb. Comput. 74: 425-474 (2016) - [c7]Valérie Berthé, Loïck Lhote, Brigitte Vallée:
Analysis of the Brun Gcd Algorithm. ISSAC 2016: 87-94 - 2015
- [j5]Julien David, Loïck Lhote, Arnaud Mary, François Rioult:
An average study of hypergraphs and their minimal transversals. Theor. Comput. Sci. 596: 124-141 (2015) - [j4]Valerie Girardin, Loïck Lhote:
Rescaling Entropy and Divergence Rates. IEEE Trans. Inf. Theory 61(11): 5868-5882 (2015) - 2013
- [c6]Valérie Berthé, Jean Creusefond, Loïck Lhote, Brigitte Vallée:
Multiple GCDs. probabilistic analysis of the plain algorithm. ISSAC 2013: 37-44 - 2011
- [j3]Gabriela Ciuperca, Valerie Girardin, Loïck Lhote:
Computation and Estimation of Generalized Entropy Rates for Denumerable Markov Chains. IEEE Trans. Inf. Theory 57(7): 4026-4034 (2011)
2000 – 2009
- 2009
- [j2]Eda Cesaratto, Julien Clément, Benoit Daireaux, Loïck Lhote, Véronique Maume-Deschamps, Brigitte Vallée:
Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms. J. Symb. Comput. 44(7): 726-767 (2009) - 2008
- [j1]Loïck Lhote, Brigitte Vallée:
Gaussian Laws for the Main Parameters of the Euclid Algorithms. Algorithmica 50(4): 497-554 (2008) - 2007
- [c5]Eda Cesaratto, Benoit Daireaux, Loïck Lhote, Véronique Maume-Deschamps, Brigitte Vallée:
Analysis of Fast Versions of the Euclid Algorithm. ANALCO 2007: 271-285 - 2006
- [c4]Loïck Lhote, Brigitte Vallée:
Sharp Estimates for the Main Parameters of the Euclid Algorithm. LATIN 2006: 689-702 - 2005
- [c3]Loïck Lhote, François Rioult, Arnaud Soulet:
Average Number of Frequent and Closed Patterns in Random Databases. CAP 2005: 345-360 - [c2]Loïck Lhote, François Rioult, Arnaud Soulet:
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases. ICDM 2005: 713-716 - 2004
- [c1]Loïck Lhote:
Computation of a Class of COntinued Fraction Constants. ALENEX/ANALC 2004: 199-210
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
