M. L. Fredman & D. E. Willard, "Trans-dichotomous algorithms for minimum spanning trees and shortest paths," Proc. 31st Annual IEEE Symposium on Foundations of Computer Science (1990). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Word-based RAM Priority Queues - Liu (2001) (Correct)
....queue. However, with a unit cost RAM model, the priority queue operations can be signi cantly speeded up. In the literature, this was rst proposed by van Emde Boas [3, 4] whose data structure supported priority queue operations in O(log log u) worst case time. Fredman and Willard s Fusion Trees [5, 6, 7] gave these operations an O( log n) time bound. Andersson s search trees [2] also provided O( log n) time bound but only used AC operations. And nally Thorup proposed an O(log log n) algorithm [8] which is known so far as the fastest data structure supporting priority queues. In this ....
....log n) amortized time. This algorithm requires look up tables with constant access time. With hash tables, the algorithm needs linear space O(n) 3 Comparison between RAM Priority Queues There are two other important word based RAM data structures, namely Fredman and Willard s fusion trees [5, 6, 7] and Andersson s O( log n) search trees [2] Although both of them achieve the same time bounds, the fusion trees need constant time multiplication which is not a AC operation. Without this assumption, fusion trees may not be faster than van Emde Boas trees. 8 Table 1 summarizes the time ....
[Article contains additional citation context not shown here]
F. W. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48(3):533-551, 1994.
Interval selection: Applications, algorithms, and lower bounds - Erlebach, Spieksma (Correct)
....denotes the running time for any algorithm for finding a shortest path in a directed graph with O(n) arcs and positive arc weights. With an e#cient implementation of Dijkstra s algorithm, for example, S(n) can be taken as O(n log n) There are algorithms that are asymptotically faster (see, e.g. [13, 21] and further references given in [25] however, these algorithms seem of theoretical interest only and do not achieve a linear running time. The only linear time shortest paths algorithm known so far is due to Thorup [25] it works for undirected graphs. In Section 4, we analyze the ....
M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48(3):533--551, 1994.
Succinct Dynamic Data Structures - Raman, Raman, Rao (Correct)
....than ffl w bits for sufficiently large w. As observed by Dietz, sum(i) can be computed by adding to B[i] a corrective term obtained by using C to index into a pre computed table. We now show how to perform select in O(1) time. For this, we use the Q heap structure given by Fredman and Willard [6], which solves the following dynamic predecessor problem: Theorem 1. 6] For any 0 M 2 , given a set of at most (lg M) 1=4 integers of O(w) bits each, one can support the operations insert, delete, predecessor and successor operations in constant time where predecessor(x) successor(x) ....
....can be computed by adding to B[i] a corrective term obtained by using C to index into a pre computed table. We now show how to perform select in O(1) time. For this, we use the Q heap structure given by Fredman and Willard [6] which solves the following dynamic predecessor problem: Theorem 1. [6] For any 0 M 2 , given a set of at most (lg M) 1=4 integers of O(w) bits each, one can support the operations insert, delete, predecessor and successor operations in constant time where predecessor(x) successor(x) returns the largest (smallest) element y in the set such that y x (y ....
M. L. Fredman and D. E. Willard, "Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths", Journal of Computer Systems Science, 48, 533-551 (1994).
Iterated Nearest Neighbors and Finding Minimal Polytopes - Eppstein, Erickson (1994) (34 citations) (Correct)
....the presence of the item at that position. Each insert or delete can be performed with O(1) steps of integer arithmetic on a random access machine, as can the operation of moving from one element to the next in a given version of the list. By analogy to the atomic heaps of Fredman and Willard [23]we call this data structure an atomic list. This completes the description of each slab, whichwe summarize below. Lemma 3.2. Given n points in the plane, sorted from left to right, we can in time and space O(n) construct a data structure for which, given a value x,we can find the points with the ....
....n) chunks and hence O(m) potential neighbors. We reduce this to m neighbors using a linear time selection algorithm. Using a global list of all points, sorted by x y,we can represent priorities as O(log n) bit integers, so we can perform priority queue operations in O(1) time using atomic heaps [23]. Lemma 3.3. For any fixed m,we can preprocess a set of n points in the plane, in time and space O(n log n) so that the m nearest rectilinear neighbors to any query point can be found in time O(m logn) Proof: The query time is O(m logn) once wehave determined the version of the chunk list to ....
[Article contains additional citation context not shown here]
F. W. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. In 31st IEEE Symp. Found. Comput. Sci., pages 719--725, 1990.
Faster Shortest-Path Algorithms for Planar Graphs - Monika Henzinger Cornell (1997) (17 citations) (Correct)
No context found.
M. L. Fredman & D. E. Willard, "Trans-dichotomous algorithms for minimum spanning trees and shortest paths," Proc. 31st Annual IEEE Symposium on Foundations of Computer Science (1990).
Efficient Algorithms for Single Link Failure Recovery and Its - Application To Atm (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. JCSS, 48:533-551, 1994.
Improved Algorithms for Replacement Paths Problems in Restricted.. - Bhosle (2005) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. JCSS, 48:533-551, 1994.
Integer Sorting in O(n √(log log n)) Expected Time and.. - Han, Thorup (2005) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci., 48:533--551, 1994.
Melding Priority Queues - Mendelson, Tarjan, Thorup, Zwick (2004) (Correct)
No context found.
M.L. Fredman and D.E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533--551, 1994.
Melding Priority Queues - Ran Mendelson Robert (2004) (Correct)
No context found.
M.L. Fredman and D.E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533--551, 1994.
Melding Priority Queues - Ran Mendelson Robert (2004) (Correct)
No context found.
M.L. Fredman and D.E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533--551, 1994.
A Practical Shortest Path Algorithm with Linear Expected Time - Goldberg (2001) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comp. and Syst. Sci., 48:533-551, 1994.
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) (Correct)
No context found.
M.L. Fredman and D.E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533-551, 1994.
Two Linear Time Algorithms for MST on Minor Closed Graph.. - Martin Mare Department (2002) (Correct)
No context found.
M. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. In Proceedings of FOCS'90, pages 719-725, 1990.
Efficient Algorithms for Single Link Failure Recovery and.. - Bhosle, Gonzalez (2003) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. JCSS, 48:533-551, 1994.
Hierarchical Image Partitioning with Dual Graph Contraction - Haxhimusa, Kropatsch (2003) (2 citations) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. In 31st IEEE Symp. Foundations of Comp. Sci., pages 719--725, 1990.
An Incremental Algorithm for a Generalization of the.. - Ramalingam And Thomas (1992) (46 citations) (Correct)
No context found.
Fredman, M.L. and Willard, D.E., "Trans-dichotomous algorithms for minimum spanning trees and shortest paths," pp. 719-725 in Proceedings of the 31st Annual Symposium on Foundations of Computer Science Volume II (St. Louis, Missouri, October 1990), IEEE Computer Society, Washington, DC (1990).
Implementations of Dijkstra's Algorithm Based on.. - Goldberg, Silverstein (1995) (2 citations) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comp. and Syst. Sci., 48:533--551, 1994.
An Incremental Algorithm for a Generalization of the.. - Ramalingam And Thomas (1992) (46 citations) (Correct)
No context found.
Fredman, M.L. and Willard, D.E., "Trans-dichotomous algorithms for minimum spanning trees and shortest paths," pp. 719-725 in Proceedings of the 31st Annual Symposium on Foundations of Computer Science Volume II (St. Louis, Missouri, October 1990), IEEE Computer Society, Washington, DC (1990).
A Simple Shortest Path Algorithm with Linear Average Time - Goldberg (13 citations) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comp. and Syst. Sci., 48:533--551, 1994.
Hashing, Randomness and Dictionaries - Pagh (2002) (Correct)
No context found.
Michael L. Fredman and Dan E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. System Sci., 48(3):533--551, 1994.
Algorithms for Single Link Failure Recovery and Related Problems - Bhosle, Gonzalez (2003) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. JCSS, 48:533-551, 1994.
Shortest Path Algorithms: Engineering Aspects - Goldberg (2001) (4 citations) (Correct)
No context found.
M. L. Fredman and D. E. Willard. Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comp. and Syst. Sci., 48:533--551, 1994.
A Shortest Path Algorithm for Real-Weighted Undirected Graphs - Pettie, Ramachandran (2002) (Correct)
No context found.
M. L. Fredman, D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. of Comput. and Syst. Sci. 48 (1994), no. 3, 533-551.
A Linear-Work Parallel Algorithm for Finding Minimum.. - Cole, Klein, Tarjan (1994) (15 citations) (Correct)
No context found.
M. Fredman and D. E. Willard, \Trans-dichotomous algorithms for minimum spanning trees and shortest paths," Science, IEEE Computer Society Press, Los Alamitos, CA, 1986, pp. 478-491.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC