Author of the publication

Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.

. WG, volume 2573 of Lecture Notes in Computer Science, page 413-420. Springer, (2002)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Design and experimental evaluation of multiple adaptation layers in self-optimizing particle swarm optimization., , and . IEEE Congress on Evolutionary Computation, page 1-8. IEEE, (2010)Bitonic Sorting on Dynamically Reconfigurable Architectures., , , and . IPDPS Workshops, page 314-317. IEEE, (2011)Paralleles Sortieren auf mehrdimensionalen Gittern.. University of Paderborn, Germany, (1995)Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks., , and . SPAA, page 119-128. ACM, (1995)Particle swarm optimization almost surely finds local optima., and . GECCO, page 1629-1636. ACM, (2013)3-SAT on CUDA: Towards a massively parallel SAT solver., , , and . HPCS, page 306-313. IEEE, (2010)Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax., , , , and . FOGA, page 13-24. ACM, (2017)Periodification scheme: constructing sorting networks with constant period., , , and . J. ACM, 47 (5): 944-967 (2000)Playing Tetris on Meshes and Multi-Dimensional SHEARSORT., and . ISAAC, volume 1350 of Lecture Notes in Computer Science, page 32-41. Springer, (1997)Strongly Adaptive Token Distribution., , and . ICALP, volume 700 of Lecture Notes in Computer Science, page 398-409. Springer, (1993)