Data Structures Maxima
Identifieur interne : 00D742 ( Main/Exploration ); précédent : 00D741; suivant : 00D743Data Structures Maxima
Auteurs : G. Louchard ; C. Kenyon ; R. SchottSource :
English descriptors
Abstract
This paper concerns the maximum size reached by a dynamic data structure over a long period of time. The notion of ``maximum'' is basic to resource preallocation. The expected value of the maximum size had already been studied with elementary methods. Our goal here is two-fold\, : \begin{itemize} \item[-] Derive more precise asymptotic expressions for the expected maximum (with lower order terms). \item[-] When possible, find the whole distribution of the maximum size. \end{itemize}
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 000A80
- to stream Crin, to step Curation: 000A80
- to stream Crin, to step Checkpoint: 003819
- to stream Main, to step Merge: 00E020
- to stream Main, to step Curation: 00D742
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" wicri:score="-7">Data Structures Maxima</title></titleStmt><publicationStmt><idno type="RBID">CRIN:louchard91a</idno><date when="1991" year="1991">1991</date><idno type="wicri:Area/Crin/Corpus">000A80</idno><idno type="wicri:Area/Crin/Curation">000A80</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000A80</idno><idno type="wicri:Area/Crin/Checkpoint">003819</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003819</idno><idno type="wicri:Area/Main/Merge">00E020</idno><idno type="wicri:Area/Main/Curation">00D742</idno><idno type="wicri:Area/Main/Exploration">00D742</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="fr">Data Structures Maxima</title><author><name sortKey="Louchard, G" sort="Louchard, G" uniqKey="Louchard G" first="G." last="Louchard">G. Louchard</name></author><author><name sortKey="Kenyon, C" sort="Kenyon, C" uniqKey="Kenyon C" first="C." last="Kenyon">C. Kenyon</name></author><author><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>data structures</term><term>diffusion process</term><term>limiting distribution</term><term>maxima</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="627">This paper concerns the maximum size reached by a dynamic data structure over a long period of time. The notion of ``maximum'' is basic to resource preallocation. The expected value of the maximum size had already been studied with elementary methods. Our goal here is two-fold\, : \begin{itemize} \item[-] Derive more precise asymptotic expressions for the expected maximum (with lower order terms). \item[-] When possible, find the whole distribution of the maximum size. \end{itemize}</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Kenyon, C" sort="Kenyon, C" uniqKey="Kenyon C" first="C." last="Kenyon">C. Kenyon</name><name sortKey="Louchard, G" sort="Louchard, G" uniqKey="Louchard G" first="G." last="Louchard">G. Louchard</name><name sortKey="Schott, R" sort="Schott, R" uniqKey="Schott R" first="R." last="Schott">R. Schott</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00D742 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00D742 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:louchard91a
|texte= Data Structures Maxima
}}
| This area was generated with Dilib version V0.6.33. |  |