First, I would like to thank my advisor Friedhelm Meyer auf der Heide. He was a great advisor, collaborator, who greatly influenced my research in Paderborn. I would like to thank Wojciech Rytter, my first advisor during my stay in Warsaw, who took care through first years of my research. He built basis for my research and advised me to work on parallel algorithms. I would like to thank Volker Stemann. We spent a lot of time on joint discussions and (fascinating) joint research. Special thanks to Leszek G��asieniec. He always influenced me by his fresh ideas and I benefited greatly from many hours of joint discussions. Endre Szemer'edi was always ready to discuss and to explain me the beauty of mathematics and theoretical computer science. His influence is much beyond this what one can find in the thesis. It was Krzysztof Diks who first suggested to think about algorithms and computer science. He was always ready to discuss with me.
|
5824
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
2003
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
515
|
Proof verification and hardness of approximation problems
– Arora, Lund, et al.
- 1992
|
|
470
|
Universal classes of hash functions
– Carter, Wegman
- 1979
|
|
380
|
Sorting networks and their applications
– Batcher
- 1968
|
|
377
|
A fast string searching algorithm
– Boyer, Moore
- 1977
|
|
307
|
Text Algorithms
– Crochemore, Rytter
- 1994
|
|
295
|
Parallel Merge Sort
– Cole
- 1988
|
|
224
|
The parallel evaluation of general arithmetic expressions,J
– Brent
- 1974
|
|
99
|
Algorithms for finding patterns in strings
– Aho
- 1994
|
|
72
|
The power of reconfiguration
– Ben-Asher, Peleg, et al.
- 1991
|
|
63
|
Approximate and exact parallel scheduling with applications to list, tree, and graph problems
– Cole, Vishkin
- 1986
|
|
58
|
Linear Approximation of Shortest Superstring
– Blum, Jiang, et al.
- 1994
|
|
47
|
Recursive star-tree parallel data structures
– Berkman, Vishkin
- 1993
|
|
38
|
Parallel Construction of a Suffix Tree with
– Apostolico, Iliopoulos, et al.
- 1988
|
|
32
|
Fast parallel space allocation, estimation and integer sorting
– Bast, Hagerup
- 1991
|
|
32
|
Efficient NC algorithms for set cover with applications to learning and geometry
– Berger, Rompel, et al.
- 1994
|
|
27
|
An Optimal O(log log n) Time Parallel String Matching Algorithm
– Breslauer, Galil
- 1990
|
|
27
|
A lower bound for parallel string matching
– Breslauer, Galil
- 1992
|
|
19
|
Optimal separation between concurrent-write parallel machines
– Boppana
- 1989
|
|
18
|
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
– Cole, Crochemore, et al.
- 1993
|
|
16
|
The complexity of reconfiguring network models
– Ben-Asher, Lange, et al.
- 1992
|
|
16
|
Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems
– Czumaj
- 1993
|
|
13
|
Parallel and sequential approximation of shortest superstrings
– Czumaj, Ggsieniec, et al.
|
|
12
|
Efficient self-simulation algorithms for reconfigurable arrays
– Asher, Gordon, et al.
- 1995
|
|
12
|
Work-time-optimal parallel algorithms for string problems
– Czumaj, Galil, et al.
- 1995
|
|
10
|
Parallel Alternating-Direction Access Machine
– Chlebus, Czumaj, et al.
- 1996
|
|
9
|
Improved optimal shared memory simulations, and the power of reconfiguration
– Czumaj, Heide, et al.
- 1995
|
|
8
|
Matrix Chain Ordering in Polylog Time with n=lg n Processors
– Bradford, Rawlins, et al.
- 1992
|
|
8
|
An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications
– Czumaj
- 1992
|
|
7
|
Efficient Parallel Dynamic Programming
– Bradford
- 1992
|
|
6
|
Transforming comparison model lower bounds to the parallel-random-accessmachine
– Breslauer, Czumaj, et al.
- 1995
|
|
5
|
Optimal pattern matching on meshes
– Chlebus, Gasieniec
- 1994
|
|
5
|
Sequential and parallel approximation of shortest superstrings
– Czumaj, Gasieniec, et al.
- 1997
|
|
3
|
A 2 4 -approximation algorithm for the shortest superstring problem
– Armen, Stein
- 1994
|
|
3
|
Fast and reliable hashing
– Bast, Hagerup
- 1991
|
|
2
|
Sorting in average time o(log n
– Ajtai, Karabeg, et al.
- 1989
|
|
2
|
An efficient algorithm for the row minima of a totally monotone matrix
– Atallah, Kosaraju
- 1991
|
|
1
|
Broadcasting information by exclusive-read PRAMs
– Beame, Kutylowski, et al.
- 1994
|
|
1
|
Improved parallel approximation of shortest superstrings, " Manuscript
– Chen
- 1995
|
|
1
|
Lower bound for string matching on PRAM
– Czumaj, Heide, et al.
- 1995
|
|
