Vote for your favorite mineral in #MinCup25! - Zunyite vs. Molybdenite
It's the visually-unmistakable #zunyite vs the physically funky #molybdenite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Leighton, Tom, Plaxton, C. Greg (1998) Hypercubic Sorting Networks. SIAM Journal on Computing, 27 (1). 1-47 doi:10.1137/s0097539794268406

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleHypercubic Sorting Networks
JournalSIAM Journal on Computing
AuthorsLeighton, TomAuthor
Plaxton, C. GregAuthor
Year1998 (February)Volume27
Issue1
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794268406Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240155Long-form Identifiermindat:1:5:11240155:3
GUID0
Full ReferenceLeighton, Tom, Plaxton, C. Greg (1998) Hypercubic Sorting Networks. SIAM Journal on Computing, 27 (1). 1-47 doi:10.1137/s0097539794268406
Plain TextLeighton, Tom, Plaxton, C. Greg (1998) Hypercubic Sorting Networks. SIAM Journal on Computing, 27 (1). 1-47 doi:10.1137/s0097539794268406
In(1998, February) SIAM Journal on Computing Vol. 27 (1) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Leighton, Tom, Ma, Yuan (1999) Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults. SIAM Journal on Computing, 29 (1). 258-273 doi:10.1137/s0097539796305298
Mettu, Ramgopal R., Plaxton, C. Greg (2003) The Online Median Problem. SIAM Journal on Computing, 32 (3). 816-832 doi:10.1137/s0097539701383443
Ghosh, Bhaskar, Leighton, F. T., Maggs, Bruce M., Muthukrishnan, S., Plaxton, C. Greg, Rajaraman, R., Richa, Andréa W., Tarjan, Robert E., Zuckerman, David (1999) Tight Analyses of Two Local Load Balancing Algorithms. SIAM Journal on Computing, 29 (1). 29-64 doi:10.1137/s0097539795292208
Yao, Andrew C., Yao, F. Frances (1985) On Fault-Tolerant Networks for Sorting. SIAM Journal on Computing, 14 (1). 120-128 doi:10.1137/0214009
Leighton, F. Thomson, Maggs, Bruce M., Sitaraman, Ramesh K. (1998) On the Fault Tolerance of Some Popular Bounded-Degree Networks. SIAM Journal on Computing, 27 (5). 1303-1333 doi:10.1137/s0097539793255163
Cypher, Robert (1993) A Lower Bound on the Size of Shellsort Sorting Networks. SIAM Journal on Computing, 22 (1). 62-71 doi:10.1137/0222006
Zave, Derek A. (1977) Optimal Polyphase Sorting. SIAM Journal on Computing, 6 (1). 1-39 doi:10.1137/0206001
Frederickson, Greg N., Janardan, Ravi (1990) Space-Efficient Message Routing inc-Decomposable Networks. SIAM Journal on Computing, 19 (1). 164-181 doi:10.1137/0219011
Liu, C. L. (1972) Analysis and Synthesis of Sorting Algorithms. SIAM Journal on Computing, 1 (4). 290-304 doi:10.1137/0201021
Sibeyn, Jop F. (1998) Row-Major Sorting on Meshes. SIAM Journal on Computing, 28 (3). 847-863 doi:10.1137/s009753979427011x
Malajovich, Gregorio, Meer, Klaus (1998) On the Structure of $\cal NP_\Bbb C$. SIAM Journal on Computing, 28 (1). 27-35 doi:10.1137/s0097539795294980
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 12, 2025 18:36:36
Go to top of page