首页 | 本学科首页   官方微博 | 高级检索  
     


Sorting Networks of Logarithmic Depth,Further Simplified
Authors:Joel Seiferas
Affiliation:(1) Computer Science Department, University of Rochester, Rochester, NY 14627-0226, USA
Abstract:We further simplify Paterson’s version of the Ajtai–Komlós–Szemerédi sorting network, and its analysis, mainly by tuning the invariant to be maintained.
Keywords:Sorting network  Comparison network  Comparator network  Oblivious sorting  Parallel sorting  Analysis of algorithms
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号