| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC) |
| Number of pages | 8 |
| Publication date | 2000 |
| Pages | 335-342 |
| Publication status | Published - 2000 |
| Externally published | Yes |
Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues
Arne Andersson, Mikkel Thorup
51
Citations
(Scopus)