Faster deterministic wakeup in multiple access channels
type: Item
instance of: scholarly article
title: Faster deterministic wakeup in multiple access channels
zbMATH Open document ID: 1115.68029
author: Gianluca De Marco
author: Marco Pellegrini
author: Giovanni Sburlati
published in: Discrete Applied Mathematics
publication date: 2007-05-30T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5159554
zbMATH Keywords: algorithms
zbMATH Keywords: clock
zbMATH Keywords: synchrony
zbMATH Keywords: wakeup problem
zbMATH Keywords: multiple access channel
MaRDI profile type: Publication
full work available at URL: j.dam.2006.08.009
OpenAlex ID: W2152985036
cites work: Automata, Languages and Programming
cites work: A better wake-up in radio networks
cites work: Q5501363
cites work: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
cites work: Theoretical Computer Science
cites work: Q4010313
cites work: On the Integers Relatively Prime to $n$ and a Number-Theoretic Function Considered by Jacobsthal.
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: A perspective on multiaccess channels
cites work: The wakeup problem in synchronous broadcast systems
cites work: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
cites work: Q5772619
cites work: Analysis of Backoff Protocols for Multiple Access Channels
cites work: ON THE PROBLEM OF JACOBSTHAL
cites work: Q4427874
cites work: Nonrandom binary superimposed codes
cites work: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
DOI: 10.1016/J.DAM.2006.08.009
description: scientific article; zbMATH DE number 5159554