Lattice path combinatorics and linear probing (Q1075065): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0378-3758(86)90013-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001040331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Measures for Ordered Lists in Random-Access Files / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to the Analysis of Linear Probing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Policies for Data Base Reorganization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A batch-ballot problem and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Extendible Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probability Law of the Busy Period for Two Types of Queuing Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Methods in the Theory of Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583504 / rank
 
Normal rank

Latest revision as of 12:52, 17 June 2024

scientific article
Language Label Description Also known as
English
Lattice path combinatorics and linear probing
scientific article

    Statements

    Lattice path combinatorics and linear probing (English)
    0 references
    0 references
    1986
    0 references
    data structures
    0 references
    Ballot theorem
    0 references
    Urn models
    0 references
    direct-access storage and retrieval
    0 references
    direct-access file
    0 references
    hashing
    0 references
    lattice-path counting
    0 references

    Identifiers