ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Average search and update costs in skip lists (1992)
    Springer
    BIT 32 (1992), S. 316-332 
    Details
    ISSN: 1572-9125
    Keywords: E.1 ; F.2.2 ; 68E05 ; skip lists ; dictionary ; probabilistic algorithms ; asymptotic analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Skip lists, introduced by Pugh, provide an alternative to search trees, although a precise analysis of their behaviour had been elusive. The exact value of the expected cost for the search of themth element in a skip list ofn elements is derived first in terms of previously studied functions, and secondly as an asymptotic expression. The latter suggests that Pugh's upper bound of the expected search cost is fairly tight for the interesting cases. Assuming a uniform query distribution, the exact and an asymptotic value of the average (over allm) expected search cost in a skip list ofn elements is also derived. Finally, all insert and delete costs are obtained.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01994884
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A note on the height of thekth element in a heap (1993)
    Springer
    BIT 33 (1993), S. 411-412 
    Details
    ISSN: 1572-9125
    Keywords: E.1 ; F.2.2 ; G.2.1 ; heaps ; expected height ; digital search trees
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract De Graaf and Kosters have studied the expected height of thekth element in a heap. They conjecture that, for largek, this is asymptotic to log2 k + 0.72 .... We show that the height of thekth element is related to the depth of insertion in a digital search tree, and use this relation to prove their conjecture.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01990524
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Searchability in merging and implicit data structures (1987)
    Springer
    BIT 27 (1987), S. 324-329 
    Details
    ISSN: 1572-9125
    Keywords: E.1 ; F.2.2
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We introduce the notion ofsearchability as a property of an in place merging algorithm. We show that a pair of sorted arrays can be merged in place in linear time, so that a search can be performed in logarithmic time at any point during the merging process. We apply this method to devise an implicit data structure which can support searches inO(log2 n) time in the worst case, andO(logn) on the average, and insertions inO(logn) time, in the worst case.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01933727
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    facet.materialart.
    Unknown
    Delivery of epitopes by the Salmonella type III secretion system for vaccine development (1998)
    American Association for the Advancement of Science (AAAS)
    Details
    Publication Date: 1998-07-24
    Description: Avirulent strains of Salmonella typhimurium are being considered as antigen delivery vectors. During its intracellular stage in the host, S. typhimurium resides within a membrane-bound compartment and is not an efficient inducer of class I-restricted immune responses. Viral epitopes were successfully delivered to the host-cell cytosol by using the type III protein secretion system of S. typhimurium. This resulted in class I-restricted immune responses that protected vaccinated animals against lethal infection. This approach may allow the efficient use of S. typhimurium as an antigen delivery system to control infections by pathogens that require this type of immune response for protection.〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Russmann, H -- Shams, H -- Poblete, F -- Fu, Y -- Galan, J E -- Donis, R O -- New York, N.Y. -- Science. 1998 Jul 24;281(5376):565-8.〈br /〉〈span class="detail_caption"〉Author address: 〈/span〉Department of Molecular Genetics and Microbiology, School of Medicine, State University of New York at Stony Brook, Stony Brook, NY 11794-5222, USA.〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/9677200" target="_blank"〉PubMed〈/a〉
    Keywords: Animals ; *Antigen Presentation ; Antigens, Viral/immunology/metabolism ; Bacterial Proteins/genetics/*metabolism ; Cytosol/*immunology ; Endoplasmic Reticulum/immunology/metabolism ; Epitopes/*immunology ; Histocompatibility Antigens Class I/immunology ; Hybridomas ; Lymphocytic Choriomeningitis/prevention & control ; Lymphocytic choriomeningitis virus/immunology ; Mice ; Mice, Inbred C57BL ; Nucleoproteins/immunology/metabolism ; Peptide Fragments/immunology/metabolism ; Protein Tyrosine Phosphatases/genetics/*metabolism ; Recombinant Fusion Proteins/immunology/metabolism ; *Salmonella typhimurium/metabolism/pathogenicity ; T-Lymphocytes/immunology ; T-Lymphocytes, Cytotoxic/immunology ; Tumor Cells, Cultured ; Vaccines, Synthetic/*administration & dosage/immunology ; Viral Core Proteins/immunology/metabolism ; Viral Vaccines/immunology
    Print ISSN: 0036-8075
    Electronic ISSN: 1095-9203
    Topics: Biology , Chemistry and Pharmacology , Computer Science , Medicine , Natural Sciences in General , Physics
    Published by American Association for the Advancement of Science (AAAS)
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...