| Publication | Date of Publication | Type |
|---|
Deterministic non-adaptive contention resolution on a shared channel
Journal of Computer and System Sciences | 2023-01-06 | Paper |
Concurrent multicast in weighted networks
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Deterministic non-adaptive contention resolution on a shared channel
(available as arXiv preprint) | 2022-09-27 | Paper |
Optimal channel utilization with limited feedback
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Anonymous processors with synchronous shared memory: Monte Carlo algorithms
(available as arXiv preprint) | 2020-07-30 | Paper |
Subquadratic non-adaptive threshold group testing
Journal of Computer and System Sciences | 2020-03-26 | Paper |
Optimal channel utilization with limited feedback
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Distributed balanced color assignment on arbitrary networks
Theoretical Computer Science | 2020-01-29 | Paper |
Naming a channel with beeps
Fundamenta Informaticae | 2018-01-05 | Paper |
Subquadratic non-adaptive threshold group testing
Fundamentals of Computation Theory | 2017-11-22 | Paper |
Asynchronous shared channel
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Contention resolution in a non-synchronized multiple access channel
Theoretical Computer Science | 2017-09-07 | Paper |
Scalable wake-up of multi-channel single-hop radio networks
Theoretical Computer Science | 2016-01-21 | Paper |
Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
SIAM Journal on Computing | 2015-08-03 | Paper |
Searching for majority with \(k\)-tuple queries
Discrete Mathematics, Algorithms and Applications | 2015-07-01 | Paper |
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
Random Structures & Algorithms | 2013-01-21 | Paper |
Computing majority with triple queries
Theoretical Computer Science | 2012-11-27 | Paper |
Computing majority with triple queries
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Distributed broadcast in unknown radio networks
SIAM Journal on Computing | 2011-01-17 | Paper |
| scientific article; zbMATH DE number 5764877 (Why is no real title available?) | 2010-08-06 | Paper |
Approximation algorithms for a hierarchically structured bin packing problem
Information Processing Letters | 2009-07-09 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics | 2007-05-30 | Paper |
Randomized Algorithms for Determining the Majority on Graphs
Combinatorics, Probability and Computing | 2007-02-07 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science | 2006-04-28 | Paper |
Broadcasting in hypercubes and star graphs with dynamic faults.
Information Processing Letters | 2006-01-17 | Paper |
The plurality problem with three colors and more.
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2080261 (Why is no real title available?) | 2004-08-04 | Paper |
Deterministic broadcasting time with partial knowledge of the network.
Theoretical Computer Science | 2003-08-17 | Paper |
Faster broadcasting in unknown radio networks
Information Processing Letters | 2002-07-14 | Paper |
| Fast distributed graph coloring with \(O(\Delta)\) colors | 2002-03-24 | Paper |
Concurrent multicast in weighted networks
Theoretical Computer Science | 2001-08-20 | Paper |
