A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks

C. G. Plaxton

doi:10.1007/s002240010001

A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks

Theory of Computing Systems ◽

10.1007/s002240010001 ◽

2000 ◽

Vol 33 (3) ◽

pp. 233-254

Author(s):

C. G. Plaxton

Keyword(s):

Lower Bound ◽

Sorting Networks

Download Full-text

A computer assisted optimal depth lower bound for sorting networks with nine inputs

Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89 ◽

10.1145/76263.76280 ◽

1989 ◽

Cited By ~ 3

Author(s):

I. Parberry

Keyword(s):

Lower Bound ◽

Computer Assisted ◽

Sorting Networks ◽

Optimal Depth

Download Full-text

A computer-assisted optimal depth lower bound for nine-input sorting networks

Mathematical Systems Theory ◽

10.1007/bf02090393 ◽

1991 ◽

Vol 24 (1) ◽

pp. 101-116 ◽

Cited By ~ 23

Author(s):

Ian Parberry

Keyword(s):

Lower Bound ◽

Computer Assisted ◽

Sorting Networks ◽

Optimal Depth

Download Full-text

A lower bound for sorting networks based on the shuffle permutation

Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures - SPAA '92 ◽

10.1145/140901.140909 ◽

1992 ◽

Cited By ~ 1

Author(s):

C. Greg Plaxton ◽

Torsten Suel

Keyword(s):

Lower Bound ◽

Sorting Networks

Download Full-text

An Improved Lower Bound for Sorting Networks

IEEE Transactions on Computers ◽

10.1109/tc.1972.5009021 ◽

1972 ◽

Vol C-21 (6) ◽

pp. 612-613 ◽

Cited By ~ 8

Author(s):

David C. Van Voorhis

Keyword(s):

Lower Bound ◽

Sorting Networks

Download Full-text

Toward a Lower Bound for Sorting Networks

Complexity of Computer Computations ◽

10.1007/978-1-4684-2001-2_12 ◽

1972 ◽

pp. 119-129 ◽

Cited By ~ 7

Author(s):

David C. Van Voorhis

Keyword(s):

Lower Bound ◽

Sorting Networks

Download Full-text

A lower bound for sorting networks based on the shuffle permutation

Mathematical Systems Theory ◽

10.1007/bf01184936 ◽

1994 ◽

Vol 27 (5) ◽

pp. 491-508 ◽

Cited By ~ 2

Author(s):

C. G. Plaxton ◽

T. Suel

Keyword(s):

Lower Bound ◽

Sorting Networks

Download Full-text

A super-logarithmic lower bound for hypercubic sorting networks

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-58201-0_103 ◽

1994 ◽

pp. 618-629 ◽

Cited By ~ 3

Author(s):

C. Greg Plaxton ◽

Torsten Suel

Keyword(s):

Lower Bound ◽

Sorting Networks

Download Full-text

A Lower Bound on the Size of Shellsort Sorting Networks

SIAM Journal on Computing ◽

10.1137/0222006 ◽

1993 ◽

Vol 22 (1) ◽

pp. 62-71 ◽

Cited By ~ 9

Author(s):

Robert Cypher

Keyword(s):

Lower Bound ◽

Sorting Networks

Download Full-text

New results and applications for the Ideal Extended Kalman Filter asa Cramer-Rao lower bound estimator

10.2514/6.1992-4596 ◽

1992 ◽

Cited By ~ 2

Author(s):

MARTIN MOORMAN ◽

THOMAS BULLOCK

Keyword(s):

Kalman Filter ◽

Lower Bound ◽

Extended Kalman Filter ◽

Cramer Rao Lower Bound ◽

The Ideal

Download Full-text

Lower bound for the lifespan of solutions to the generalized KdV equation with low-degree of nonlinearity

The Role of Metrics in the Theory of Partial Differential Equations ◽

10.2969/aspm/08510303 ◽

2020 ◽

Author(s):

Hayato Miyazaki

Keyword(s):

Lower Bound ◽

Kdv Equation ◽

Generalized Kdv Equation ◽

Low Degree

Download Full-text