Correction to "An asymptotically nonadaptive algorithm for conflict resolution i

Authors:
János Komlós;Albert G. Greenberg
Affiliations:
Hungarian Academy of Sciences, Budapest and Univ. of California at San Diego, La Jolla, CA;AT&T Bell Laboratories, Murray Hill, NJ
Venue:
IEEE Transactions on Information Theory
Year:
1985

Citing 0
Cited 23

On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On contention resolution protocols and associated probabilistic phenomena

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Journal of the ACM (JACM)
On contention resolution protocols and associated probabilistic phenomena

Journal of the ACM (JACM)
Fast distributed graph coloring with O(&Dgr;) colors

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The do-all problem in broadcast networks

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Fast broadcasting and gossiping in radio networks

Journal of Algorithms
Deterministic Broadcasting Time with Partial Knowledge of the Network

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Randomized Algorithm for Gossiping in Radio Networks

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels

Theoretical Computer Science
On selection problem in radio networks

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Adversarial queuing on the multiple-access channel

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Secure communication over radio channels

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Generalized framework for selectors with applications in optimal group testing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimal monotone encodings

IEEE Transactions on Information Theory
Deterministic communication in the weak sensor model

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Contention resolution in multiple-access channels: k-selection in radio networks

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Adversarial Queuing on the Multiple Access Channel

ACM Transactions on Algorithms (TALG)
Unbounded contention resolution in multiple-access channels

DISC'11 Proceedings of the 25th international conference on Distributed computing
On many-to-many communication in packet radio networks

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Deterministic recurrent communication in restricted Sensor Networks

Theoretical Computer Science
Almost optimal explicit selectors

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

First Page of the Article