( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Latency effects on reachability in large-scale peer-to-peer networks.

, , и . SPAA, стр. 84-92. ACM, (2001)

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.

Matthias Frederichs

Marie-Catherine Frederiksen

Volker Frederking

Heinz Frede

Walter Fredehold

 

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

An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks., и . SIROCCO, стр. 176-187. Carleton Scientific, (1997)The lonely NATed node., , , , и . ACM SIGOPS European Workshop, стр. 36. ACM, (2004)Parallel Implementations of Graph Embeddings.. Heinz Nixdorf Symposium, том 678 из Lecture Notes in Computer Science, стр. 207-217. Springer, (1992)A Unified Approach to Off-Line Permutation Routing on Parallel Networks., и . SPAA, стр. 398-406. ACM, (1990)On Testing Consecutive-Ones Property in Parallel., и . SPAA, стр. 234-243. ACM, (1995)Ranking algorithms for Hamiltonian paths in hypercubic networks.. Interconnection Networks and Mapping and Scheduling Parallel Computations, том 21 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 1-7. DIMACS/AMS, (1994)Synthesis ranking with critic resonance., и . WebSci, стр. 15-23. ACM, (2012)A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs., и . WADS, том 955 из Lecture Notes in Computer Science, стр. 263-269. Springer, (1995)Fault Tolerance in Hypercube-Derivative Networks.. SPAA, стр. 179-188. ACM, (1989)A GPGPU Algorithm for c-Approximate r-Nearest Neighbor Search in High Dimensions., , и . IPDPS Workshops, стр. 2079-2088. IEEE, (2013)