P-tree structures and event horizon: efficient event-set implementations (Q2508375)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5062813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | P-tree structures and event horizon: efficient event-set implementations |
scientific article; zbMATH DE number 5062813 |
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
0.7248318791389465
0 references
0.7157462239265442
0 references
0.7032277584075928
0 references
