The periodic balanced sorting network

doi:10.1145/76359.76362

The periodic balanced sorting network

Full Text:

PDF

Buy this Article

Authors:	Martin Dowd	Rutgers Univ., New Brunswick, NJ
	Yehoshua Perl	New Jersey Institute of Technology, Newark
	Larry Rudolph	Hebrew Univ., Jerusalem, Israel
	Michael Saks	Rutgers Univ. New Brunswick, NJ

	1989 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 19 · Downloads (cumulative): 607 · Citation Count: 31

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 36 Issue 4, Oct. 1989
Pages 738-757
ACM New York, NY, USA
table of contents doi>10.1145/76359.76362

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms combinatorial algorithms design permutations and combinations recurrences and difference equations sorting and searching theory unbounded-action devices

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder