RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki

Zh. Vychisl. Mat. Mat. Fiz., 1999, Volume 39, Number 6, Pages 1032–1040 (Mi zvmmf1672)

Polynomial estimation of the complexity of algorithms
V. V. Voevodin

References

1. Voevodin V. V., Informatsionnaya struktura algoritmov, Izd-vo MGU, M., 1997
2. Voevodin V. V., “Information structure of sequential programs”, Russ. J. of Numer Analys and Modelling, 10:3 (1995), 279–286  crossref  mathscinet  zmath
3. Voevodin V. V,, Voevodin Vl. V., “V-Ray technology: a new approach to the old problems. Optimization of the TRFD Perfect Club Benchmark to CRAY Y-MP and CRAY T3D supercomputers”, Proc. High Performance Comput. Symposium'95 (Phoenix, Arizona, 1995), 380–385
4. Voevodin V. V., Mathematical foundation of parallel computing, Ser. Comput. Sci., 33, World Scient. Publ. Co., 1992  mathscinet  zmath


© Steklov Math. Inst. of RAS, 2025