| Publication | Date of Publication | Type |
|---|
Anonymous adversarial dynamic networks with logarithmic memory and communication
Theoretical Computer Science | 2026-02-12 | Paper |
On the amount of randomness needed for improving distributed wireless link scheduling under arbitrary interference
IEEE Transactions on Information Theory | 2025-07-11 | Paper |
Verifiable crowd computing: coping with bounded rationality
Theoretical Computer Science | 2024-06-19 | Paper |
Correction to: ``Dynamic multiple-message broadcast: bounding throughput in the affectance model''
Theory of Computing Systems | 2023-10-30 | Paper |
Dynamic multiple-message broadcast: bounding throughput in the affectance model
Theory of Computing Systems | 2023-08-17 | Paper |
Verifiable crowd computing: coping with bounded rationality
Frontiers of Algorithmic Wisdom | 2023-08-03 | Paper |
Dynamic windows scheduling with reallocation
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
| Polynomial anonymous dynamic distributed computing without a unique leader | 2022-07-21 | Paper |
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework
Theoretical Computer Science | 2022-01-18 | Paper |
Polynomial anonymous dynamic distributed computing without a unique leader
Journal of Computer and System Sciences | 2021-10-28 | Paper |
Polynomial anonymous dynamic distributed computing without a unique leader
Journal of Computer and System Sciences | 2021-10-28 | Paper |
Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
(available as arXiv preprint) | 2021-07-28 | Paper |
Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
Journal of the ACM | 2020-11-11 | Paper |
Station assignment with reallocation
Algorithmica | 2019-03-11 | Paper |
A faster exact-counting protocol for anonymous dynamic networks
Algorithmica | 2019-01-11 | Paper |
| Station assignment with applications to sensing | 2018-10-17 | Paper |
scientific article; zbMATH DE number 6917148 (Why is no real title available?)
(available as arXiv preprint) | 2018-08-13 | Paper |
A faster counting protocol for anonymous dynamic networks
(available as arXiv preprint) | 2017-09-29 | Paper |
Fault-tolerant aggregation: flow-updating meets mass-distribution
Distributed Computing | 2017-09-04 | Paper |
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing
IEEE Transactions on Computers | 2017-06-20 | Paper |
Initializing sensor networks of non-uniform density in the weak sensor model
Algorithmica | 2015-09-03 | Paper |
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
Computational Geometry | 2015-03-06 | Paper |
Brief announcement: Achieving reliability in master-worker computing via evolutionary dynamics
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Bootstrapping a hop-optimal network in the weak sensor model
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Deterministic recurrent communication and synchronization in restricted sensor networks | 2014-03-25 | Paper |
Unbounded contention resolution in multiple-access channels
Algorithmica | 2013-11-11 | Paper |
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing | 2013-08-22 | Paper |
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing | 2013-08-22 | Paper |
Crowd computing as a cooperation problem: An evolutionary approach
Journal of Statistical Physics | 2013-06-07 | Paper |
Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
Theoretical Computer Science | 2013-03-04 | Paper |
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
Distributed Computing | 2013-02-04 | Paper |
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Deterministic recurrent communication in restricted sensor networks
Theoretical Computer Science | 2012-03-13 | Paper |
Unbounded contention resolution in multiple-access channels
Lecture Notes in Computer Science | 2011-10-28 | Paper |
CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Lower Bounds for Clear Transmissions in Radio Networks
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Sensor Network Gossiping or How to Break the Broadcast Lower Bound
Algorithms and Computation | 2008-05-27 | Paper |
INSERTION SORT is O(n n)
Theory of Computing Systems | 2007-02-13 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
