|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 6 keywords
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
53 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
Cache-oblivious shortest paths in graphs using buffer heap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain, pp. 245-254, 2004, ACM, 1-58113-840-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
buffer heap, cache-aware model, cache-oblivious model, decrease-key, tournament tree, shortest paths, priority queue |
51 | Sridhar Ramachandran, K. Rajasekar, C. Pandu Rangan |
Probabilistic Data Structures for Priority Queues (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings, pp. 143-154, 1998, Springer, 3-540-64682-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
probabilistic data structures, decrease key, meld, bottom-up sampling, buffering technique, priority queue, skip list, amortization |
33 | Haim Kaplan, Robert Endre Tarjan |
Thin heaps, thick heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 3:1-3:14, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
binomial queue, decrease key operation, fibonacci heap, melding, thick heap, thin heap, Data structure, priority queue, heap |
29 | Mikkel Thorup |
Integer priority queues with decrease key in constant time and the single source shortest paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 149-158, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Fibonacci heaps, single source shortest paths, priority queues |
25 | Haim Kaplan, Nira Shafrir, Robert Endre Tarjan |
Meldable heaps and boolean union-find. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 573-582, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | John Iacono, Riko Jacob, Konstantinos Tsakalidis |
External memory priority queues with decrease-key and applications to graph algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.03147, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | John Iacono, Riko Jacob, Konstantinos Tsakalidis |
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 60:1-60:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | John Iacono, Özgür Özkan |
A Tight Lower Bound for Decrease-Key in the Pure Heap Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1407.6665, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
23 | John Iacono, Özgür Özkan |
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pp. 637-649, 2014, Springer, 978-3-662-43947-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | John Iacono |
Why some heaps support constant-amortized-time decrease-key operations, and others do not ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1302.6641, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Mikkel Thorup |
Integer priority queues with decrease key in constant time and the single source shortest paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 69(3), pp. 330-353, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Ran Mendelson, Mikkel Thorup, Uri Zwick |
Meldable RAM priority queues and minimum directed spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 40-48, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
12 | Amr Elmasry |
Layered Heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 212-222, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
6 | Amr Elmasry |
Pairing heaps with O(log log n) decrease cost. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 471-476, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
6 | Tadao Takaoka |
Theory of Trinomial Heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings, pp. 362-372, 2000, Springer, 3-540-67787-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
6 | Michael L. Fredman |
A Priority Queue Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings, pp. 244-258, 1999, Springer, 3-540-66427-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
6 | Tadao Takaoka |
Theory of 2-3 Heaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 41-50, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|