Analysis of tree algorithms for the simulation event list (Q760216): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Optimizing Partitioned Sequencing Sets For Discrete Event Simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the Time Indexed List Procedure for Synchronization of Discrete Event Simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient data structure for the simulation event set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of an algorithm for priority queue administration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of simulation event list algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of Event Times for the notices in a Simulation Event List / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00290143 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001337228 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:18, 30 July 2024

scientific article
Language Label Description Also known as
English
Analysis of tree algorithms for the simulation event list
scientific article

    Statements

    Analysis of tree algorithms for the simulation event list (English)
    0 references
    1985
    0 references
    See the preview in Zbl 0545.68096.
    0 references
    analysis of algorithms
    0 references
    simulation event list
    0 references
    priority queue
    0 references
    average- case performance
    0 references
    binary search tree
    0 references
    p-tree algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references