Vote for your favorite mineral in #MinCup25! - Topaz vs. Kyanite
It's a battle of high-pressure colourful beauties of #topaz vs #kyanite. Which can stand the heat of round 1?
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., Moses, Yoram (1998) Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM Journal on Computing, 27 (1). 247-290 doi:10.1137/s0097539794265232

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleFully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
JournalSIAM Journal on Computing
AuthorsGaray, Juan A.Author
Moses, YoramAuthor
Year1998 (February)Volume27
Issue1
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794265232Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240151Long-form Identifiermindat:1:5:11240151:5
GUID0
Full ReferenceGaray, Juan A., Moses, Yoram (1998) Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM Journal on Computing, 27 (1). 247-290 doi:10.1137/s0097539794265232
Plain TextGaray, Juan A., Moses, Yoram (1998) Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM Journal on Computing, 27 (1). 247-290 doi:10.1137/s0097539794265232
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.

Halpern, Joseph Y., Moses, Yoram, Waarts, Orli (2001) A Characterization of Eventual Byzantine Agreement. SIAM Journal on Computing, 31 (3). 838-865 doi:10.1137/s0097539798340217
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
Dolev, D., Strong, H. R. (1983) Authenticated Algorithms for Byzantine Agreement. SIAM Journal on Computing, 12 (4). 656-666 doi:10.1137/0212045
Feldman, Pesech, Micali, Silvio (1997) An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement. SIAM Journal on Computing, 26 (4). 873-933 doi:10.1137/s0097539790187084
Moses, Yoram, Rajsbaum, Sergio (2002) A Layered Analysis of Consensus. SIAM Journal on Computing, 31 (4). 989-1021 doi:10.1137/s0097539799364006
Dolev, Danny, Hoch, Ezra N., Moses, Yoram (2012) An Optimal Self-Stabilizing Firing Squad. SIAM Journal on Computing, 41 (2). 415-435 doi:10.1137/090776512
Chakrabarty, Deeparnab, Chen, Yu, Khanna, Sanjeev (2023) A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection. SIAM Journal on Computing, 52 (1) 38-66 doi:10.1137/22m147685x
Nisan, Noam, Wigderson, Avi (1993) Rounds in Communication Complexity Revisited. SIAM Journal on Computing, 22 (1). 211-219 doi:10.1137/0222016
Barnes, Greg, Buss, Jonathan F., Ruzzo, Walter L., Schieber, Baruch (1998) A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. SIAM Journal on Computing, 27 (5). 1273-1282 doi:10.1137/s0097539793283151
Althaus, Ernst, Mehlhorn, Kurt (2001) Traveling Salesman-Based Curve Reconstruction in Polynomial Time. SIAM Journal on Computing, 31 (1). 27-66 doi:10.1137/s0097539700366115
Hochbaum, Dorit S., Shmoys, David B. (1988) A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach. SIAM Journal on Computing, 17 (3). 539-551 doi:10.1137/0217033
 
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 13, 2025 12:39:22
Go to top of page