P-tree structures and event horizon: efficient event-set implementations (Q2508375): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11390-006-0019-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2055649782
@@ Property / OpenAlex ID: W2055649782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3951448
@@ Property / cites work: Q3951448 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3685243
@@ Property / cites work: Q3685243 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient data structure for the simulation event set
+Normal rank
@@ Property / cites work @@
+Q4428915
@@ Property / cites work: Q4428915 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of an algorithm for priority queue administration
+Normal rank
@@ Property / cites work @@
+Meldable heaps and boolean union-find
@@ Property / cites work: Meldable heaps and boolean union-find / rank @@
+Normal rank
@@ Property / cites work @@
+Concurrent access of priority queues
@@ Property / cites work: Concurrent access of priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Analyses of Event Set Algorithms
@@ Property / cites work: Complexity Analyses of Event Set Algorithms / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2508375