P-tree structures and event horizon: efficient event-set implementations (Q2508375): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3951448 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3685243 / 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: Q4428915 / 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: Meldable heaps and boolean union-find / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Concurrent access of priority queues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity Analyses of Event Set Algorithms / rank | |||
Normal rank | |||
Latest revision as of 21:41, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | P-tree structures and event horizon: efficient event-set implementations |
scientific article |
Statements
P-tree structures and event horizon: efficient event-set implementations (English)
0 references
12 October 2006
0 references
discrete-event simulation
0 references
event set algorithms
0 references
hold model
0 references
event horizon
0 references
data structures
0 references
heap
0 references
\(P\)-tree
0 references
\(P\)-tree structures
0 references
