( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The New Class of g-Chain Periodic Sorters.

, , и . J. Parallel Distributed Comput., 54 (2): 206-222 (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ronald I U Rühmkorf

Nata i i

imun Ko i i

Slobodan Ru i i

Ronald Keipert

Acmella ciliata (H.B.K.) Cassini: phytochemische und enzymatische Untersuchungen, galenische Präformulierungen. FU Berlin, (2009)
 

Другие публикации лиц с тем же именем

The New Class of g-Chain Periodic Sorters., , и . J. Parallel Distributed Comput., 54 (2): 206-222 (1998)Drawing labelled directed binary graphs on a grid., и . ACM Southeast Regional Conference, стр. 30-34. ACM, (1982)Shifting Algorithms for Tree Partitioning with General Weighting Functions., и . J. Algorithms, 4 (2): 101-120 (1983)A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees., и . CAAP, стр. 63-72. Cambridge University Press, (1984)A Shifting Algorithm for Min-Max Tree Partitioning., , и . ICALP, том 85 из Lecture Notes in Computer Science, стр. 64-75. Springer, (1980)The errors in FFT estimation of the Fourier transform., и . IEEE Trans. Signal Process., 44 (8): 2073-2077 (1996)The Generalized Class of g-Chaln Periodic Sorting Networks., , и . IPPS, стр. 424-432. IEEE Computer Society, (1994)The New Class of g-Chain Periodic Sorters., , и . SPAA, стр. 356-364. ACM, (1993)Locating median paths on connected outerplanar graphs., , , и . Networks, 57 (3): 294-307 (2011)The Cent-dian Path Problem on Tree Networks., , , и . ISAAC, том 2223 из Lecture Notes in Computer Science, стр. 743-755. Springer, (2001)