Journal of the ACM Bibliography
Nicholas Pippenger and Leslie G. Valiant.
Shifting graphs and their applications. Journal of the ACM,
23(3):423-432, July 1976.
[BibTeX entry]
Selected papers that cite this one
- Sanjeev Arora, F. T. Leighton, and Bruce M. Maggs. On-line algorithms
for path selection in a nonblocking network. SIAM Journal on
Computing, 25(3):600-625, June 1996.
- Nabil Kahale, Tom Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, and
Endre Szemerédi. Lower bounds for
sorting networks. In Proceedings of the Twenty-Seventh Annual
ACM Symposium on the Theory of Computing, pages 437-446, Las
Vegas, Nevada, 29 May-1 June 1995.
- R. Kannan. Circuit-size
lower bounds and non-reducibility to sparse sets. Information
and Control, 55(1-3):40-56, October/November/December 1982.
- T. Leighton, Y. Ma, and T. Suel. On probabilistic
networks for selection, merging, and sorting. Theory of
Computing Systems, 30(6):559-582, November/December 1997.
- Peter Bro Miltersen, Mike Paterson, and Jun Tarui. The asymptotic complexity of
merging networks. Journal of the ACM, 43(1):147-165,
January 1996.
- Pavel Pudlák, Vojt\v{e}ch Rödl, and Ji\v{r}í Sgall.
Boolean
circuits, tensor ranks, and communication complexity. SIAM
Journal on Computing, 26(3):605-633, June 1997.
Shortcuts: