Gianluca De Marco

Orcid: 0000-0002-1204-0646

According to our database1, Gianluca De Marco authored at least 38 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Deterministic non-adaptive contention resolution on a shared channel.
J. Comput. Syst. Sci., May, 2023

2022
Time and Energy Efficient Contention Resolution in Asynchronous Shared Channels.
CoRR, 2022

Contention Resolution Without Collision Detection: Constant Throughput And Logarithmic Energy.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

2021
Optimal channel utilization with limited feedback.
J. Comput. Syst. Sci., 2021

Deterministic Contention Resolution without Collision Detection: Throughput vs Energy.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020
Distributed balanced color assignment on arbitrary networks.
Theor. Comput. Sci., 2020

Subquadratic non-adaptive threshold group testing.
J. Comput. Syst. Sci., 2020

2019
A distributed message-optimal assignment on rings.
J. Parallel Distributed Comput., 2019

Deterministic Contention Resolution on a Shared Channel.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

2018
Brief Announcement: Deterministic Contention Resolution on a Shared Channel.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2017
Contention resolution in a non-synchronized multiple access channel.
Theor. Comput. Sci., 2017

Naming a Channel with Beeps.
Fundam. Informaticae, 2017

Asynchronous Shared Channel.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Distributed Beta-assignment on Graphs.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

Subquadratic Non-adaptive Threshold Group Testing.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Scalable wake-up of multi-channel single-hop radio networks.
Theor. Comput. Sci., 2016

2015
Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel.
SIAM J. Comput., 2015

Searching for majority with k-tuple queries.
Discret. Math. Algorithms Appl., 2015

Anonymous Processors with Synchronous Shared Memory.
CoRR, 2015

2013
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness.
Random Struct. Algorithms, 2013

2012
Computing majority with triple queries.
Theor. Comput. Sci., 2012

2010
Distributed Broadcast in Unknown Radio Networks.
SIAM J. Comput., 2010

Towards Power-Sensitive Communication on a Multiple-Access Channel.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

2007
Faster deterministic wakeup in multiple access channels.
Discret. Appl. Math., 2007

2006
Asynchronous deterministic rendezvous in graphs.
Theor. Comput. Sci., 2006

Randomized Algorithms for Determining the Majority on Graphs.
Comb. Probab. Comput., 2006

Distributed algorithm for a color assignment on asynchronous rings.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
The plurality problem with three colors and more.
Theor. Comput. Sci., 2005

2004
Approximation algorithms for a hierarchically structured bin packing problem.
Inf. Process. Lett., 2004

The Plurality Problem with Three Colors.
Proceedings of the STACS 2004, 2004

2003
Deterministic broadcasting time with partial knowledge of the network.
Theor. Comput. Sci., 2003

2001
Concurrent multicast in weighted networks.
Theor. Comput. Sci., 2001

Faster broadcasting in unknown radio networks.
Inf. Process. Lett., 2001

Fast distributed graph coloring with O(Delta) colors.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Distributed Algorithm for Certain Assignment Problems.
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.
Parallel Process. Lett., 2000

1998
Broadcasting in Hypercubes and Star Graphs with Dynamic Faults.
Inf. Process. Lett., 1998


  Loading...