|
131 |
Polynomial time decomposition of modules over algebras and its application
Chistov, Aleksandr L.. - Bonn : Inst. für Informatik, 1996
|
|
|
|
132 |
Randomization and the computational power of analytic and algebraic decision trees
Grigoriev, Dima. - Bonn : Inst. für Informatik, 1996
|
|
|
|
133 |
Randomized Ο(n2) [omega n 2] lower bound for Knapsack
Grigoriev, Dima. - Bonn : Inst. für Informatik, 1996
|
|
|
|
134 |
1.757 and 1.267 - approximation algorithms for the network and rectilinear Steiner tree problems
Karpiński, Marek. - Bonn : Inst. für Informatik, 1995
|
|
|
|
135 |
A lower bound on the size of algebraic decision trees for the MAX problem
Grigoriev, Dima. - Bonn : Inst. für Informatik, 1995
|
|
|
|
136 |
A new approach to approximation of Steiner trees
Karpiński, Marek. - Bonn : Inst. für Informatik, 1995
|
|
|
|
137 |
Algorithms for interpolation of sparse rational functions using polynomial number of evaluations
Chistov, Aleksandr L.. - Bonn : Inst. für Informatik, 1995
|
|
|
|
138 |
Alphabet independent optimal parallel search for three-dimensional patterns
Karpiński, Marek. - Bonn : Inst. für Informatik, 1995
|
|
|
|
139 |
An improved pattern matching algorithm for strings with short descriptions
Karpiński, Marek. - Bonn : Inst. für Informatik, 1995
|
|
|
|
140 |
Correctness of constructing optimal alphabetic trees revisited
Karpiński, Marek. - Bonn : Inst. für Informatik, 1995
|
|
Administration
