Vote for your favorite mineral in #MinCup25! - Pollucite vs. Tugtupite
It's the cesium #pollucite against the optical changeling #tugtupite for this match.
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

Garay, Juan A., Kutten, Shay, Peleg, David (1998) A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM Journal on Computing, 27 (1). 302-316 doi:10.1137/s0097539794261118

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
JournalSIAM Journal on Computing
AuthorsGaray, Juan A.Author
Kutten, ShayAuthor
Peleg, DavidAuthor
Year1998 (February)Volume27
Issue1
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794261118Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240147Long-form Identifiermindat:1:5:11240147:8
GUID0
Full ReferenceGaray, Juan A., Kutten, Shay, Peleg, David (1998) A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM Journal on Computing, 27 (1). 302-316 doi:10.1137/s0097539794261118
Plain TextGaray, Juan A., Kutten, Shay, Peleg, David (1998) A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM Journal on Computing, 27 (1). 302-316 doi:10.1137/s0097539794261118
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.

Kutten, Shay, Peleg, David (2000) Tight Fault Locality. SIAM Journal on Computing, 30 (1). 247-268 doi:10.1137/s0097539797319109
Peleg, David, Rubinovich, Vitaly (2000) A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction. SIAM Journal on Computing, 30 (5). 1427-1442 doi:10.1137/s0097539700369740
Czumaj, Artur, Sohler, Christian (2009) Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time. SIAM Journal on Computing, 39 (3). 904-922 doi:10.1137/060672121
Cidon, Israel, Kutten, Shay, Mansour, Yishay, Peleg, David (1995) Greedy Packet Scheduling. SIAM Journal on Computing, 24 (1). 148-157 doi:10.1137/s0097539791217695
Awerbuch, Baruch, Cidon, Israel, Kutten, Shay, Mansour, Yishay, Peleg, David (1998) Optimal Broadcast with Partial Knowledge. SIAM Journal on Computing, 28 (2). 511-524 doi:10.1137/s0097539795279931
Emek, Yuval, Peleg, David (2009) Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs. SIAM Journal on Computing, 38 (5). 1761-1781 doi:10.1137/060666202
Chin, F., Ting, H. F. (1990) Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees. SIAM Journal on Computing, 19 (4). 612-626 doi:10.1137/0219041
Chazelle, Bernard, Rubinfeld, Ronitt, Trevisan, Luca (2005) Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM Journal on Computing, 34 (6). 1370-1379 doi:10.1137/s0097539702403244
Lotker, Zvi, Patt-Shamir, Boaz, Pavlov, Elan, Peleg, David (2005) Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds. SIAM Journal on Computing, 35 (1). 120-131 doi:10.1137/s0097539704441848
Cheriton, David, Tarjan, Robert Endre (1976) Finding Minimum Spanning Trees. SIAM Journal on Computing, 5 (4). 724-742 doi:10.1137/0205051
Czumaj, Artur, Ergün, Funda, Fortnow, Lance, Magen, Avner, Newman, Ilan, Rubinfeld, Ronitt, Sohler, Christian (2005) Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing, 35 (1). 91-109 doi:10.1137/s0097539703435297
 
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 8, 2025 11:21:04
Go to top of page