Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,654,625 papers from all fields of science
Search
Sign In
Create Free Account
Brodal queue
Known as:
Brodel queue
In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: for insertion, find-minimum, meld…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Best, worst and average case
Computer science
Dijkstra's algorithm
Fibonacci heap
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Practical Applicability of Advanced Implementations of Priority Queues in Finding Shortest Paths
Michal Mrena
,
P. Sedlaček
,
M. Kvassay
International Design and Test Workshop/Symposium
2019
Corpus ID: 201812705
A priority queue belongs to most useful abstract data types. It plays a key role in graph algorithms, such as Dijkstra’s or Prim…
Expand
1989
1989
A Computer Modeling Approach to Understanding the Inferior Olive and Its Relationships to the Cerebellar Cortex in Rats
Maurice Lee
,
J. Bower
Neural Information Processing Systems
1989
Corpus ID: 17527408
This paper presents the results of a simulation of the spatial relationship between the inferior olivary nucleus and folium crus…
Expand
1958
1958
Blickstörung durch Kleinhirnläsion
H. Solcher
,
H. Jensen
Deutsche Zeitschrift für Nervenheilkunde
1958
Corpus ID: 11727990
ZusammenfassungNach einer operativen Entfernung der 3 inneren Kleinhirnkerne, ohne wesentliche Schädigung der Nuclei dentati, kam…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE