Sciweavers

ESA
1998
Springer
162views Algorithms» more  ESA 1998»
14 years 4 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
14 years 4 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
ESA
1998
Springer
175views Algorithms» more  ESA 1998»
14 years 4 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
14 years 4 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
ESA
1998
Springer
95views Algorithms» more  ESA 1998»
14 years 4 months ago
New Bounds for Oblivious Mesh Routing
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
14 years 4 months ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 4 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
14 years 4 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook