|
|
Sequential and parallel . . .
– Sung Eun Bae
- 2007
|
|
|
Selecting Sums in Arrays
– Gerth Stølting Brodal, Allan Grønlund Jørgensen
|
|
1
|
Algorithms for Finding the Weight-Constrained k Longest Paths in a Tree and the Length-Constrained k Maximum-Sum Segments of a Sequence
– Hsiao-fei Liu, Kun-mao Chao
- 2008
|
|
1
|
Ranking Cartesian Sums and K-maximum subarrays
– Sung Eun Bae, Tadao Takaoka
- 2006
|
|
1
|
A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
– Sung Eun Bae, Tadao Takaoka
|
|
13
|
Improved algorithms for the k-maximum subarray problem for small k
– Sung E. Bae, Tadao Takaoka
- 2005
|
|
3
|
Computing maximum-scoring segments in almost linear time
– Fredrik Bengtsson, Fredrik Bengtsson, Jingsen Chen, Jingsen Chen
- 2006
|
|
|
AVERAGE CASE ANALYSIS OF ALGORITHMS FOR THE MAXIMUM SUBARRAY PROBLEM
– Mohammad Bashar
- 2007
|
|
|
On
– Asish Mukhopadhyay, Eugene Greene
|
|
|
On
– Asish Mukhopadhyay, Eugene Greene
|
|
|
External Examiner Supervisor
– Mohammed Thaher
|
|
3
|
A note on ranking k maximum sums
– Fredrik Sweden Bengtsson, Fredrik Bengtsson, Fredrik Bengtsson, Jingsen Chen, Jingsen Chen, Jingsen Chen
|
|
3
|
An O(n 3 log log n / log n) Time Algorithm for the All-Pairs Shortest Path Problem
– Tadao Takaoka
- 2004
|
|
9
|
Portable Distributed Priority Queues with MPI
– Bernard Mans, North Queensland
- 1995
|
|
23
|
A Performance Comparison of Event Calendar Algorithms: an Empirical Approach
– Kehsiung Chung, Janche Sang, Vernon Rego
- 1993
|
|
15
|
Optimal Purely Functional Priority Queues
– Gerth Stølting Brodal, Gerth Stlting Brodal, Chris Okasaki, Chris Okasaki
- 1996
|
|
1
|
Parallel Algorithms for the k Shortest Paths and Related Problems
– Eric Ruppert
- 1996
|
|
73
|
Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees
– Greg N. Frederickson
- 1991
|
|
1
|
On sorting, heaps, and minimum spanning trees
– Gonzalo Navarro, Rodrigo Paredes
|
