Vote for your favorite mineral in #MinCup25! - Taenite vs. Nontronite
It's a mineral found mostly in the farthest reaches of space vs one so common an exhaustive list of localities is nigh impossible as alloy #taenite faces off against clay #nontronite.
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

MacKenzie, Philip D. (1997) The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. SIAM Journal on Computing, 26 (6). 1559-1580 doi:10.1137/s0097539791224030

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleThe Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
JournalSIAM Journal on Computing
AuthorsMacKenzie, Philip D.Author
Year1997 (December)Volume26
Issue6
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539791224030Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240114Long-form Identifiermindat:1:5:11240114:0
GUID0
Full ReferenceMacKenzie, Philip D. (1997) The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. SIAM Journal on Computing, 26 (6). 1559-1580 doi:10.1137/s0097539791224030
Plain TextMacKenzie, Philip D. (1997) The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. SIAM Journal on Computing, 26 (6). 1559-1580 doi:10.1137/s0097539791224030
In(1997, December) SIAM Journal on Computing Vol. 26 (6) Society for Industrial & Applied Mathematics (SIAM)

See Also

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

Attiya, Hagit, Censor-Hillel, Keren (2010) Lower Bounds for Randomized Consensus under a Weak Adversary. SIAM Journal on Computing, 39 (8). 3885-3904 doi:10.1137/090751906
Cheriyan, Joseph (1997) Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory. SIAM Journal on Computing, 26 (6). 1635-1655 doi:10.1137/s0097539793256223
Alon, Noga, Kahale, Nabil (1997) A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM Journal on Computing, 26 (6). 1733-1748 doi:10.1137/s0097539794270248
Goldberg, Leslie Ann, Jerrum, Mark, MacKenzie, Philip D. (1998) An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks. SIAM Journal on Computing, 27 (4). 1083-1098 doi:10.1137/s0097539794272569
Alon, N., Azar, Y. (1988) The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. SIAM Journal on Computing, 17 (6). 1178-1192 doi:10.1137/0217074
Klein, Philip N. (1996) Efficient Parallel Algorithms for Chordal Graphs. SIAM Journal on Computing, 25 (4). 797-827 doi:10.1137/s0097539789166880
Minster, Rachel, Li, Zitong, Ballard, Grey (2024) Parallel Randomized Tucker Decomposition Algorithms. SIAM Journal on Scientific Computing, 46 (2) doi:10.1137/22m1540363
Breslauer, Dany, Galil, Zvi (1992) A Lower Bound for Parallel String Matching. SIAM Journal on Computing, 21 (5). 856-862 doi:10.1137/0221050
Ramanan, Prakash (1994) A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem. SIAM Journal on Computing, 23 (4). 834-851 doi:10.1137/s0097539790190077
Crochemore, Maxime, Galil, Zvi, Gasieniec, Leszek, Park, Kunsoo, Rytter, Wojciech (1997) Constant-Time Randomized Parallel String Matching. SIAM Journal on Computing, 26 (4). 950-960 doi:10.1137/s009753979528007x
Rajasekaran, Sanguthevar, Reif, John H. (1989) Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms. SIAM Journal on Computing, 18 (3). 594-607 doi:10.1137/0218041
 
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 15, 2025 15:01:56
Go to top of page