|
151 |
Graph algorithms= iteration + data structures? Erwig, Martin. - Hagen : Fernuniv., 1992
|
|
|
152 |
Grid- and point-oriented multilevel algorithms Griebel, Michael. - München : TUM, Inst. für Informatik, SFB 342, 1992
|
|
|
153 |
Ideals, varieties, and algorithms Cox, David R.. - New York : Springer, 1992
|
|
|
154 |
Improved multilevel algorithms for full and sparse grid problems Griebel, Michael. - München : TUM, SFB 342, 1992
|
|
|
155 |
Improving multigrid and conventional relaxation algorithms for propagators Kalkreuter, Thomas. - Hamburg : DESY, 1992
|
|
|
156 |
Limit theorems for recursive algorithms Feldman, Philipp. - Münster : Univ., 1992
|
|
|
157 |
Maximum k-chains in planar point sets Felsner, Stefan. - Berlin : Freie Univ., Fachbereich Mathematik, 1992
|
|
|
158 |
NC-algorithms for operations on binary decision diagrams Sieling, Detlef. - Dortmund : Dekanat Informatik, Univ., 1992
|
|
|
159 |
Neural network constructive algorithms Śmieja, Frank. - Sankt Augustin : GMD, 1992
|
|
|
160 |
On derandomized approximation algorithms Srivastav, Anand. - Bonn : Forschungsinst. für Diskrete Mathematik, 1992
|
|