Get started
Keyword

priority queues

Description: An abstract data type that stores elements with priorities and returns or removes an element according to its priority, commonly used in algorithms.
Wikidata ID: wiki/Q629283
OpenAlex ID: keywords/priority-queues
Applied Probability and Queues
1987 · Upendra Dave, Soren Asmussen · Journal of the Operational Research Society · 2,704
Fibonacci heaps and their uses in improved network optimization algorithms
1987 · Michael L. Fredman, Robert Endre Tarjan · Journal of the ACM · 2,657
PDF
Stochastic Modeling and the Theory of Queues
1989 · Ronald W. Wolff · 1,605
Applied Probability and Queues
2003 · Asmussen, Søren · Springer eBooks · 1,452
Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications
2000 · D. Down, G. Bolch, et al. · Journal of the American Statistical Association · 1,147
Efficient Algorithms for Shortest Paths in Sparse Networks
1977 · Donald B. Johnson · Journal of the ACM · 1,041
PDF
Hybrid image segmentation using watersheds and fast region merging
1998 · K. Haris, S.N. Efstratiadis, et al. · IEEE Transactions on Image Processing · 735
Priority queues
1968 · N. K. Jaiswal · 605
ML for the Working Programmer
1996 · Larry C. Paulson · Cambridge University Press eBooks · 593
ROAMing terrain: Real-time Optimally Adapting Meshes
2002 · M. Duchaineau, M. Wolinsky, et al. · 592
PDF
Faster algorithms for the shortest path problem
1990 · Ravindra K. Ahuja, Kurt Mehlhorn, et al. · Journal of the ACM · 554
PDF
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
1986 · Harold N. Gabow, Zvi Galil, et al. · COMBINATORICA · 518
Design and implementation of an efficient priority queue
1976 · P. Emde Boas, R. Kaas, et al. · Theory of Computing Systems · 511
LEDA: A platform for combinatorial and geometric computing
2000 · Computers & Mathematics with Applications · 489
Blossom V: a new implementation of a minimum cost perfect matching algorithm
2009 · Vladimir Kolmogorov · Mathematical Programming Computation · 416
Priority Assignment in Waiting Line Problems
1954 · Alan Cobham · Journal of the Operations Research Society of America · 416
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
1988 · R. Brown · Communications of the ACM · 396
PDF
Performance by Design: Computer Capacity Planning By Example
2004 · Daniel A. Menascé, Lawrence W. Dowdy, et al. · CERN Document Server (European Organization for Nuclear Research) · 384
An Efficient Domain-Independent Algorithm for Detecting Approximately Duplicate Database Records.
1997 · Alvaro Monge, Charles Elkan · 356
Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1
1993 · Yutaka Takahashi · Computer Networks and ISDN Systems · 353
The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
1966 · Linus E. Schrage, Louis W. Miller · Operations Research · 342
The ASTOOT approach to testing object-oriented programs
1994 · Roong-Ko Doong, Phyllis G. Frankl · ACM Transactions on Software Engineering and Methodology · 321
PDF
A data structure for manipulating priority queues
1978 · Jean Vuillemin · Communications of the ACM · 315
PDF
Linear Time Maximally Stable Extremal Regions
2008 · David Nistér, Henrik Stewénius · Lecture notes in computer science · 308
An improved genetic algorithm for task scheduling in the cloud environments using the priority queues: Formal verification, simulation, and statistical testing
2016 · Bahman Keshanchi, Alireza Souri, et al. · Journal of Systems and Software · 299
Works count: 4,450
Citation count: 53,080
Year
Topic
Type