###
An Optimal *Decentralized* *Algorithm* for the *Distributed* *Trigger* *Counting* Problem

"... We study the distributed trigger counting problem. In this problem, we have a distributed system having n processors. These processors receive triggers from an external source. The goal is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is ..."

Abstract
- Add to MetaCart

O(log w) messages. In light of lowerbounds proved in prior work, this

*algorithm*is optimal in In this paper, we study the*distributed**trigger**counting*problem (DTCP). Consider*a**distributed*system having n processors. The processors receive*triggers*from an external source. The problem###
An Efficient *Decentralized* *Algorithm* for the *Distributed* *Trigger* *Counting* Problem

"... Abstract. Consider a distributed system with n processors, in which each processor receives some triggers from an external source. The distributed trigger counting problem is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is a user-specif ..."

Abstract
- Add to MetaCart

Abstract. Consider

*a**distributed*system with n processors, in which each processor receives some*triggers*from an external source. The*distributed**trigger**counting*problem is to raise an alert and report to*a*user when the number of*triggers*received by the system reaches w, where w is*a*user###
An Efficient Randomized *Decentralized* *Algorithm* for the *Distributed* *Trigger* *Counting* Problem

"... Consider a distributed system with n processors, in which each processor receives some triggers from an external source. The distributed trigger counting problem is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is a user-specified input. ..."

Abstract
- Add to MetaCart

that any deterministic

*algorithm*has message complexity Ω(n log w) and In this paper, we study the*distributed**trigger**counting*(DTC) problem. Consider*a**distributed*system with n processors, in which each processor receives some*triggers*from an external source. The*distributed**trigger**counting*problem###
An Efficient Randomized *Decentralized* *Algorithm* for the *Distributed* *Trigger* *Counting* Problem

"... Consider a distributed system with n processors, in which each processor receives some triggers from an external source. The distributed trigger counting problem is to raise an alert and report to a user when the number of triggers received by the system reaches w, where w is a user-specified input. ..."

Abstract
- Add to MetaCart

Consider

*a**distributed*system with n processors, in which each processor receives some*triggers*from an external source. The*distributed**trigger**counting*problem is to raise an alert and report to*a*user when the number of*triggers*received by the system reaches w, where w is*a*user-specified input###
*Announcements*

"... Related Conferences, Call For Papers/Participants.......................................................... 31 ..."

Abstract
- Add to MetaCart

Related Conferences, Call For Papers/Participants.......................................................... 31

###
*Decentralized*

"... Abstract Walknet comprises an artificial neural network that allows for the simulation of a considerable amount of behavioral data obtained from walking and standing stick insects. It has been tested by kinematic and dynamic sim-ulations as well as on a number of six-legged robots. Over the years, v ..."

Abstract
- Add to MetaCart

Abstract Walknet comprises an artificial neural network that allows for the simulation of

*a*considerable amount of behavioral data obtained from walking and standing stick insects. It has been tested by kinematic and dynamic sim-ulations as well as on*a*number of six-legged robots. Over the years###
*Brief* *Announcement*: Self-Stabilizing *Counting* in Mobile Sensor Networks

"... Distributed computing has to adapt its techniques to mo-bile sensor networks and cope with constraints like small memory size or lack of computation power. In this paper we extend the results of Angluin et al (see [1, 2, 3, 4]) by finding self-stabilizing algorithms to count the number of agents in ..."

Abstract
- Add to MetaCart

*Distributed*computing has to adapt its techniques to mo-bile sensor networks and cope with constraints like small memory size or lack of computation power. In this paper we extend the results of Angluin et al (see [1, 2, 3, 4]) by finding self-stabilizing

*algorithms*to

*count*the number of agents

###
*Brief* *Announcement*: Secure Anonymous Broadcast

"... Consider a network of n parties, where there is a private and authenticated communication channel between every pair of parties. In anonymous broadcast, one or more of the parties want to anonymously send messages to all parties. This problem is used in many applications such as anonymous communicat ..."

Abstract
- Add to MetaCart

communication, private information retrieval,

*distributed*auctions, and multi-party computation. To the best of our knowledge, known techniques for solving this problem either scale poorly with n or are vulnerable to jamming attacks [2,4], collisions [9], or traffic analysis [3]. We propose*a**decentralized*###
*Brief* *Announcement*: Tracking *Distributed* Aggregates over Time-based Sliding Windows

"... The area of distributed monitoring requires tracking the value of a function of distributed data as new observations are made. An important case is when attention is restricted to only a recent time period, such as the last hour of readings—the sliding window case. In this announcement, we outline a ..."

Abstract
- Add to MetaCart

The area of

*distributed*monitoring requires tracking the value of*a*function of*distributed*data as new observations are made. An important case is when attention is restricted to only*a*recent time period, such as the last hour of readings—the sliding window case. In this*announcement*, we outline