Search For:

Displaying 1-3 out of 3 total
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By M.L. Fredman, D.E. Willard
Issue Date:October 1990
pp. 719-725 vol.2
The fusion tree method is extended to develop a linear-time algorithm for the minimum spanning tree problem and an O(m+n log n/log log n) implementation of Dijkstra's shortest-path algorithm for a graph with n vertices and m edges. The shortest-path algori...
   
Optimal bi-weighted binary trees and the complexity of maintaining partial sums
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By H. Hampapuram, M.L. Fredman
Issue Date:November 1993
pp. 480-485
Let A be an array. The partial sum problem concerns the design of a data structure for implementing the following operations. The operation update(j,x) has the effect, A[j]/spl larr/A[j]+x, and the query operation sum(j) returns the partial sum, /spl Sigma...
   
Three stacks
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By M.L. Fredman, D.L. Goldsmith
Issue Date:October 1988
pp. 514-523
The storage allocation for three stacks has been traditionally accomplished by using pointers to store the stacks as linked lists or by relocating the stacks within memory when collisions take place. The former approach requires additional space to store t...
   
 1