Results 201 to 210 of about 2,336,702 (258)
Embedded Gatekeeping, Comparativeness, and Hidden Curriculum Create Feelings of Impostorism for Biology Doctoral Students. [PDF]
CBE Life Sci EducSteele A +4 more
europepmc +1 more source
Prediction of eukaryotic cellular complexity in Asgard archaea using structural modelling. [PDF]
Nat MicrobiolKöstlbacher S +7 more
europepmc +1 more source
Intracranial mapping of linguistic structure building during listening speech comprehension. [PDF]
Imaging Neurosci (Camb)Lu L +7 more
europepmc +1 more source
Role of friction on the formation of confined granular structures. [PDF]
Sci RepOliveira VPS +3 more
europepmc +1 more source
MC3D: the materials cloud computational database of experimentally known stoichiometric inorganics.
Digit DiscovHuber SP +9 more
europepmc +1 more source
Correction for Szewczyk et al., Liganded LolCDE structures reveal a common substrate-LolE interaction guiding bacterial lipoprotein transport. [PDF]
Proc Natl Acad Sci U S Aeuropepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1991
Summary: The purpose of this paper is to analyze the maxima properties (value and position) of some data structures. Our theorems concern the distribution of these random variables. Previously known results usually dealt with the mean and sometimes the variance of the random variables. Many of our results rely on diffusion techniques.
Louchard, Guy +2 more
openaire +1 more source
Summary: The purpose of this paper is to analyze the maxima properties (value and position) of some data structures. Our theorems concern the distribution of these random variables. Previously known results usually dealt with the mean and sometimes the variance of the random variables. Many of our results rely on diffusion techniques.
Louchard, Guy +2 more
openaire +1 more source
1990
We discuss data structures and their methods of analysis. In particular, we treat the unweighted and weighted dictionary problem, self-organizing data structures, persistent data structures, the union-find-split problem, priority queues, the nearest common ancestor problem, the selection and merging problem, and dynamization techniques.
Mehlhorn, Kurt, Tsakalidis, A.
openaire +3 more sources
We discuss data structures and their methods of analysis. In particular, we treat the unweighted and weighted dictionary problem, self-organizing data structures, persistent data structures, the union-find-split problem, priority queues, the nearest common ancestor problem, the selection and merging problem, and dynamization techniques.
Mehlhorn, Kurt, Tsakalidis, A.
openaire +3 more sources
SIAM Journal on Computing, 1988
We consider the problem of answering a series of on-line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data-structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries.
Karp, Richard M. +2 more
openaire +1 more source
We consider the problem of answering a series of on-line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data-structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries.
Karp, Richard M. +2 more
openaire +1 more source