File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/BF01788564
- Scopus: eid_2-s2.0-34249966155
- WOS: WOS:A1988R440900003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Distributed election in complete networks
| Title | Distributed election in complete networks |
|---|---|
| Authors | |
| Keywords | Asynchronous Complete Networks Distributed Election Algorithms Expected Message Complexity Synchronous Complete Networks |
| Issue Date | 1988 |
| Publisher | Springer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00446/index.htm |
| Citation | Distributed Computing, 1988, v. 3 n. 1, p. 19-22 How to Cite? |
| Abstract | An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and an O(n) expected message complexity is shown. © 1988 Springer-Verlag. |
| Persistent Identifier | http://hdl.handle.net/10722/152352 |
| ISSN | 2023 Impact Factor: 1.3 2023 SCImago Journal Rankings: 1.025 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chan, MY | en_US |
| dc.contributor.author | Chin, FYL | en_US |
| dc.date.accessioned | 2012-06-26T06:37:32Z | - |
| dc.date.available | 2012-06-26T06:37:32Z | - |
| dc.date.issued | 1988 | en_US |
| dc.identifier.citation | Distributed Computing, 1988, v. 3 n. 1, p. 19-22 | en_US |
| dc.identifier.issn | 0178-2770 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/152352 | - |
| dc.description.abstract | An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and an O(n) expected message complexity is shown. © 1988 Springer-Verlag. | en_US |
| dc.language | eng | en_US |
| dc.publisher | Springer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00446/index.htm | en_US |
| dc.relation.ispartof | Distributed Computing | en_US |
| dc.subject | Asynchronous Complete Networks | en_US |
| dc.subject | Distributed Election Algorithms | en_US |
| dc.subject | Expected Message Complexity | en_US |
| dc.subject | Synchronous Complete Networks | en_US |
| dc.title | Distributed election in complete networks | en_US |
| dc.type | Article | en_US |
| dc.identifier.email | Chin, FYL:chin@cs.hku.hk | en_US |
| dc.identifier.authority | Chin, FYL=rp00105 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.doi | 10.1007/BF01788564 | en_US |
| dc.identifier.scopus | eid_2-s2.0-34249966155 | en_US |
| dc.identifier.volume | 3 | en_US |
| dc.identifier.issue | 1 | en_US |
| dc.identifier.spage | 19 | en_US |
| dc.identifier.epage | 22 | en_US |
| dc.identifier.isi | WOS:A1988R440900003 | - |
| dc.publisher.place | Germany | en_US |
| dc.identifier.scopusauthorid | Chan, MY=7402597863 | en_US |
| dc.identifier.scopusauthorid | Chin, FYL=7005101915 | en_US |
| dc.identifier.issnl | 0178-2770 | - |