Rank-Sensitive Priority Queues (Q3183452)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Rank-Sensitive Priority Queues	scientific article

Statements

scholarly article

0 references

Rank-Sensitive Priority Queues (English)

0 references

0 references

Zachary H. Jones

0 references

Lecture Notes in Computer Science

0 references

publication date

20 October 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-03367-4_16

0 references

Faster algorithms for the shortest path problem

0 references

Randomized search trees

0 references

A unified access bound on comparison-based dynamic dictionaries

0 references

Shortest paths algorithms: Theory and experimental evaluation

0 references

On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof

0 references

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences

0 references

0 references

Fishspear: a priority queue algorithm

0 references

0 references

0 references

Self-adjusting binary search trees

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-03367-4_16

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3183452

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3183452&oldid=35132447"