On the public citation graph

Improved Algorithms for the Distributed Trigger Counting Problem

0 signed · 24 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-69903-3_23openalex-snapshot
Distributed Disaster Disclosure
inferredcites →https://doi.org/10.1007/978-3-642-15763-9_38openalex-snapshot
Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting
inferredcites →https://doi.org/10.1007/978-3-642-17679-1_5openalex-snapshot
An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem
inferredcites →https://doi.org/10.1017/cbo9780511813603openalex-snapshot
Probability and Computing
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1109/icdcs.2007.93openalex-snapshot
Communication-Efficient Tracking of Distributed Cumulative Triggers
inferredcites →https://doi.org/10.1145/1142473.1142507openalex-snapshot
Communication-efficient distributed monitoring of thresholded counts
inferredcites →https://doi.org/10.1145/1183401.1183439openalex-snapshot
Scalable algorithms for global snapshots in distributed systems
inferredcites →https://doi.org/10.1145/1281100.1281127openalex-snapshot
Controller and estimator for dynamic networks
inferredcites →https://doi.org/10.1145/1582716.1582799openalex-snapshot
Brief announcement
inferredcites →https://doi.org/10.1145/1835698.1835742openalex-snapshot
Efficient threshold detection in a distributed environment
inferredcites →https://doi.org/10.1145/1921659.1921667openalex-snapshot
Algorithms for distributed functional monitoring
inferredcites →https://doi.org/10.1145/227595.227596openalex-snapshot
Local management of a global resource in a communication network
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/wcm.2698openalex-snapshot
Distributed trigger counting algorithms for arbitrary network topology
inferred← citeshttps://doi.org/10.1007/978-3-642-17679-1_5openalex-snapshot
An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem
inferred← citeshttps://doi.org/10.1007/s00224-012-9405-4openalex-snapshot
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem
inferred← citeshttps://doi.org/10.1016/j.icte.2024.05.005openalex-snapshot
A simple and efficient Distributed Trigger Counting algorithm based on local thresholds
inferred← citeshttps://doi.org/10.1109/compsac.2013.34openalex-snapshot
Solving the Distributed Trigger Counting Problem without Any Global Assumption
inferred← citeshttps://doi.org/10.1109/tpds.2012.139openalex-snapshot
Flexible Symmetrical Global-Snapshot Algorithms for Large-Scale Distributed Systems
inferred← citeshttps://doi.org/10.1109/tsp.2015.7296230openalex-snapshot
Efficient Distributed Trigger Counting algorithms for dynamic network topology
inferred← citeshttps://doi.org/10.1177/0037549713485499openalex-snapshot
An optimal distributed trigger counting algorithm for large-scale networked systems
inferred← citeshttps://doi.org/10.3390/electronics11071127openalex-snapshot
A Simple and Efficient Tree-Based Algorithm for the Distributed Trigger Counting Problem
inferred← citeshttps://doi.org/10.3390/s20226446openalex-snapshot
DDR-coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.