共 50 条
- [31] Rearranging Algorithms for Log2 (N, 0, p) Switching Networks with Even Number of Stages HPSR: 2009 INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING, 2009, : 134 - +
- [33] Online List Labeling: Breaking the log2 n Barrier 2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 980 - 990
- [36] On a class of concatenated (2log(2)N-1)-stage interconnection networks SECOND INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN '96), PROCEEDINGS, 1996, : 537 - 543
- [37] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
- [38] The control algorithm and WSNB operation of log2(N, 1, p) switching fabrics GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11, 2007, : 2374 - +
- [40] The universality of a class of (2log(2)N-1)-stage interconnection networks PROCEEDINGS OF THE SIXTH IEEE COMPUTER SOCIETY WORKSHOP ON FUTURE TRENDS OF DISTRIBUTED COMPUTING SYSTEMS, 1997, : 92 - 97