Search results for "decrease-key"

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.	SPAA	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).	SWAT	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.	ACM Trans. Algorithms	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.	STOC	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.	STOC	2002	DBLP DOI BibTeX RDF
23	John Iacono, Riko Jacob, Konstantinos Tsakalidis	External memory priority queues with decrease-key and applications to graph algorithms.	CoRR	2019	DBLP BibTeX RDF
23	John Iacono, Riko Jacob, Konstantinos Tsakalidis	External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms.	ESA	2019	DBLP DOI BibTeX RDF
23	John Iacono, Özgür Özkan	A Tight Lower Bound for Decrease-Key in the Pure Heap Model.	CoRR	2014	DBLP BibTeX RDF
23	John Iacono, Özgür Özkan	Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not.	ICALP (1)	2014	DBLP DOI BibTeX RDF
23	John Iacono	Why some heaps support constant-amortized-time decrease-key operations, and others do not	CoRR	2013	DBLP BibTeX RDF
23	Mikkel Thorup	Integer priority queues with decrease key in constant time and the single source shortest paths problem.	J. Comput. Syst. Sci.	2004	DBLP DOI BibTeX RDF
12	Ran Mendelson, Mikkel Thorup, Uri Zwick	Meldable RAM priority queues and minimum directed spanning trees.	SODA	2004	DBLP BibTeX RDF
12	Amr Elmasry	Layered Heaps.	SWAT	2004	DBLP DOI BibTeX RDF
6	Amr Elmasry	Pairing heaps with O(log log n) decrease cost.	SODA	2009	DBLP DOI BibTeX RDF
6	Tadao Takaoka	Theory of Trinomial Heaps.	COCOON	2000	DBLP DOI BibTeX RDF
6	Michael L. Fredman	A Priority Queue Transform.	WAE	1999	DBLP BibTeX RDF
6	Tadao Takaoka	Theory of 2-3 Heaps.	COCOON	1999	DBLP DOI BibTeX RDF