How to assign votes in a distributed system
From MaRDI portal
Recommendations
Cited in
(73)- On the fractional chromatic number of monotone self-dual Boolean functions
- Lower bounds for three algorithms for transversal hypergraph generation
- On generating all maximal independent sets
- \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
- A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data
- A new transformation method for nondominated coterie design
- A distributed k-mutual exclusion algorithm using k-coterie
- Optimal coteries and voting schemes
- Nondominated \(k\)-coteries for multiple mutual exclusion
- Using integer programming to verify general safety and liveness properties
- A fully distributed quorum consensus method with high fault-tolerance and low communication overhead
- Planar quorums
- Voting fairly: Transitive maximal intersecting families of sets
- Local majorities, coalitions and monopolies in graphs: A review
- Bounding the open \(k\)-monopoly number of strong product graphs
- Hypercube quorum consensus for mutual exclusion and replicated data management
- A simple scheme to construct \(k\)-coteries with \(O(\sqrt{N})\) uniform quorum sizes
- Dynamic monopolies of constant size
- Byzantine quorum systems with maximum availability.
- Probabilistic quorum systems
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- \((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem
- Decompositions of positive self-dual Boolean functions
- Nondominated local coteries for resource allocation in grids and clouds
- Probabilistic quorums for dynamic systems
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- New heuristics for the multidimensional vote assignment problem
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- On the structure of minimal winning coalitions in simple voting games
- Maximal sensitivity of Boolean nested canalizing functions
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- Signed quorum systems
- On quorum systems for group resources allocation
- On the fixed-parameter tractability of the equivalence test of monotone normal forms
- A fast search algorithm for the quorumcast routing problem.
- A short technical paper: Determining whether a vote assignment is dominated
- Modeling k-coteries by well-covered graphs
- Billiard quorums on the grid
- Optimal availability quorum systems: theory and practice
- A quorum based \(k\)-mutual exclusion by weighted \(k\)-quorum systems
- Generating all maximal models of a Boolean expression
- A distributed voting scheme to maximize preferences
- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
- Quorum systems towards an asynchronous communication in cognitive radio networks
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
- Achieving new upper bounds for the hypergraph duality problem through logic
- Load balancing in quorum systems
- The complexity of open \(k\)-monopolies in graphs for negative \(k\)
- On multilevel voting
- Optimal coteries for rings and related networks
- Crumbling walls: a class of practical and efficient quorum systems
- Synchronous Byzantine quorum systems
- Access cost for asynchronous Byzantine quorum systems
- A self-stabilizing quorum-based protocol for maxima computing
- The congenial talking philosophers problem in computer networks
- Consensus in Data Management: From Distributed Commit to Blockchain
- Scalable and dynamic quorum systems
- Average probe complexity in quorum systems
- Analysis of quorum-based protocols for distributed (k+1)-exclusion
- A highly fault-tolerant quorum consensus method for managing replicated data
- Competitive evaluation of threshold functions in the priced information model
- Planar quorums
- Asymmetric distributed trust
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- Threshold protocols in survivor set systems
- The availability of crumbling wall quorum systems
- On the average-case complexity of Berge algorithm
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Exploiting logical structures in replicated databases
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Self-duality of bounded monotone Boolean functions and related problems
This page was built for publication: How to assign votes in a distributed system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771671)
