Gianluca De Marco

Tomasz Jurdzinski

Michal Rózanski

Grzegorz Stachowiak

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2015

Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Searching for majority with k-tuple queries.

[BibT_eX]

[DOI]

Evangelos Kranakis

Discret. Math. Algorithms Appl., 2015

Anonymous Processors with Synchronous Shared Memory.

[BibT_eX]

[DOI]

Bogdan S. Chlebus

Muhammed Talo

CoRR, 2015

2014

Scalable Wake-up of Multi-channel Single-Hop Radio Networks.

[BibT_eX]

[DOI]

Bogdan S. Chlebus

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

Contention Resolution in a Non-synchronized Multiple Access Channel.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

2011

Computing Majority with Triple Queries.

[BibT_eX]

[DOI]

Evangelos Kranakis

Gábor Wiener

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Towards Power-Sensitive Communication on a Multiple-Access Channel.

[BibT_eX]

[DOI]

Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

2008

Distributed broadcast in unknown radio networks.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2006

Distributed algorithm for a color assignment on asynchronous rings.

[BibT_eX]

[DOI]

Mauro Leoncini

Manuela Montangero

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005

The plurality problem with three colors and more.

[BibT_eX]

[DOI]

Martin Aigner

Manuela Montangero

Theor. Comput. Sci., 2005

Asynchronous Deterministic Rendezvous in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Faster Deterministic Wakeup in Multiple Access Channels.

[BibT_eX]

[DOI]

Marco Pellegrini

Giovanni Sburlati

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004

Approximation algorithms for a hierarchically structured bin packing problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

The Plurality Problem with Three Colors.

[BibT_eX]

[DOI]

Martin Aigner

Manuela Montangero

Proceedings of the STACS 2004, 2004

2003

Randomized Algorithms for Determining the Majority on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2001

Faster broadcasting in unknown radio networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Fast distributed graph coloring with O(Delta) colors.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Distributed Algorithm for Certain Assignment Problems.

[BibT_eX]

Proceedings of the Procedings of the 5th International Conference on Principles of Distributed Systems. OPODIS 2001, 2001

2000

Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults.

[BibT_eX]

[DOI]

Adele A. Rescigno

Parallel Process. Lett., 2000

Deterministic Broadcasting Time with Partial Knowledge of the Network.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1998

Broadcasting in Hypercubes and Star Graphs with Dynamic Faults.

[BibT_eX]

[DOI]

Ugo Vaccaro

Inf. Process. Lett., 1998

Concurrent Multicast in Weighted Networks.

[BibT_eX]

[DOI]