Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, HKen_US
dc.contributor.authorYUAN, SMen_US
dc.date.accessioned2014-12-08T15:27:52Z-
dc.date.available2014-12-08T15:27:52Z-
dc.date.issued1994en_US
dc.identifier.isbn0-8186-5840-1en_US
dc.identifier.issn1063-6927en_US
dc.identifier.urihttp://hdl.handle.net/11536/20128-
dc.language.isoen_USen_US
dc.titleMESSAGE COMPLEXITY OF THE TREE QUORUM ALGORITHM FOR DISTRIBUTED MUTUAL EXCLUSIONen_US
dc.typeProceedings Paperen_US
dc.identifier.journalPROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMSen_US
dc.citation.spage76en_US
dc.citation.epage80en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1994BB07B00009-
Appears in Collections:Conferences Paper