article

Anonymous wireless rings

Authors:

Krzysztof Diks,

Evangelos Kranakis,

Adam Malinowski,

Andrzej PelcAuthors Info & Claims

Theoretical Computer Science, Volume 145, Issue 1-2

Pages 95 - 109

https://doi.org/10.1016/0304-3975(94)00178-L

Published: 10 July 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Dereniowski DPelc A(2016)Topology recognition and leader election in colored networksTheoretical Computer Science10.1016/j.tcs.2016.01.037621:C(92-102)Online publication date: 28-Mar-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.01.037
Fusco EPelc A(2015)Knowledge, level of symmetry, and time of leader electionDistributed Computing10.1007/s00446-014-0237-028:4(221-232)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1007/s00446-014-0237-0
Fraigniaud PHirvonen JSuomela J(2015)Node Labels in Local DecisionPost-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 943910.1007/978-3-319-25258-2_3(31-45)Online publication date: 14-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-319-25258-2_3
Show More Cited By

Recommendations

An efficient anonymous communication protocol for wireless sensor networks

Anonymous communication is very important for many wireless sensor networks, because it can be used to hide the identity of important nodes, such as the base station and a source node. In sensor networks, anonymous communication includes several ...
Construction of MDS self-dual codes over Galois rings

The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of (Kim and Lee, J Combin Theory ser A, 105:79---95). We give a ...
Construction of self-dual codes over finite rings Zpm

We present an efficient method for constructing self-dual or self-orthogonal codes over finite rings Z"p"^"m (or Z"m) with p an odd prime and m a positive integer. This is an extension of the previous work [J.-L. Kim, Y. Lee, Euclidean and Hermitian ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 145, Issue 1-2

July 10, 1995

386 pages

ISSN:0304-3975

Editor:
M. Nivat
Univ. de Paris VII, Moiselles, France

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 10 July 1995

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dereniowski DPelc A(2016)Topology recognition and leader election in colored networksTheoretical Computer Science10.1016/j.tcs.2016.01.037621:C(92-102)Online publication date: 28-Mar-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.01.037
Fusco EPelc A(2015)Knowledge, level of symmetry, and time of leader electionDistributed Computing10.1007/s00446-014-0237-028:4(221-232)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1007/s00446-014-0237-0
Fraigniaud PHirvonen JSuomela J(2015)Node Labels in Local DecisionPost-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 943910.1007/978-3-319-25258-2_3(31-45)Online publication date: 14-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-319-25258-2_3
Dereniowski DPelc A(2014)Leader election for anonymous asynchronous agents in arbitrary networksDistributed Computing10.1007/s00446-013-0196-x27:1(21-38)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1007/s00446-013-0196-x
Hella LJärvisalo MKuusisto ALaurinharju JLempiäinen TLuosto KSuomela JVirtema JKowalski DPanconesi A(2012)Weak models of distributed computing, with connections to modal logicProceedings of the 2012 ACM symposium on Principles of distributed computing10.1145/2332432.2332466(185-194)Online publication date: 16-Jul-2012
https://dl.acm.org/doi/10.1145/2332432.2332466
Fusco EPelc A(2012)Distributed tree comparison with nodes of limited memoryNetworks10.1002/net.2146360:4(235-244)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1002/net.21463
Fusco EPelc A(2011)How much memory is needed for leader electionDistributed Computing10.1007/s00446-011-0131-y24:2(65-78)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1007/s00446-011-0131-y
Fusco E(2011)Communication complexity of consensus in anonymous message passing systemsProceedings of the 15th international conference on Principles of Distributed Systems10.1007/978-3-642-25873-2_14(191-206)Online publication date: 13-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25873-2_14
Fusco EPelc A(2010)How much memory is needed for leader electionProceedings of the 24th international conference on Distributed computing10.5555/1888781.1888815(251-266)Online publication date: 13-Sep-2010
https://dl.acm.org/doi/10.5555/1888781.1888815
Fusco EPelc A(2010)Distributed tree comparison with nodes of limited memoryProceedings of the 17th international conference on Structural Information and Communication Complexity10.1007/978-3-642-13284-1_12(142-156)Online publication date: 7-Jun-2010
https://dl.acm.org/doi/10.1007/978-3-642-13284-1_12
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

An efficient anonymous communication protocol for wireless sensor networks

Construction of MDS self-dual codes over Galois rings

Construction of self-dual codes over finite rings Zpm

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations