On the public citation graph
Generating and approximating nondominated coteries
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1995.1157openalex-snapshot
Complexity of Identification and Dualization of Positive Boolean Functions
inferredcites →https://doi.org/10.1006/inco.1995.1169openalex-snapshot
The Availability of Quorum Systems
inferredcites →https://doi.org/10.1007/3-540-27477-4_16openalex-snapshot
The Complexity of Boolean Functions
inferredcites →https://doi.org/10.1007/3-540-54945-5_54openalex-snapshot
Identifying 2-monotonic positive boolean functions in polynomial time
inferredcites →https://doi.org/10.1007/3-540-58325-4_196openalex-snapshot
The maximum latency and identification of positive Boolean functions
inferredcites →https://doi.org/10.1007/978-94-009-2099-6openalex-snapshot
Coherent Structures and Simple Games
inferredcites →https://doi.org/10.1007/bf02242737openalex-snapshot
Optimal coteries for rings and related networks
inferredcites →https://doi.org/10.1007/bf02293050openalex-snapshot
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
inferredcites →https://doi.org/10.1016/0012-365x(94)00053-lopenalex-snapshot
Decompositions of positive self-dual boolean functions
inferredcites →https://doi.org/10.1016/0020-0190(88)90065-8openalex-snapshot
On generating all maximal independent sets
inferredcites →https://doi.org/10.1016/0095-8956(71)90033-5openalex-snapshot
On the composition and decomposition of clutters
inferredcites →https://doi.org/10.1016/0166-218x(85)90040-xopenalex-snapshot
Polynomial-time algorithms for regular set-covering and threshold synthesis
inferredcites →https://doi.org/10.1016/0166-218x(87)90056-4openalex-snapshot
Dualization of regular Boolean functions
inferredcites →https://doi.org/10.1016/0166-218x(95)00026-nopenalex-snapshot
Reverse search for enumeration
inferredcites →https://doi.org/10.1109/71.238300openalex-snapshot
A theory of coteries: mutual exclusion in distributed systems
inferredcites →https://doi.org/10.1109/pgec.1965.264136openalex-snapshot
Enumeration of Seven-Argument Threshold Functions
inferredcites →https://doi.org/10.1109/reldis.1988.25789openalex-snapshot
Vote assignments in weighted voting mechanisms
inferredcites →https://doi.org/10.1109/t-c.1970.223046openalex-snapshot
Enumeration of Threshold Functions of Eight Variables
inferredcites →https://doi.org/10.1109/tc.1987.1676860openalex-snapshot
The Reliability of Voting Mechanisms
inferredcites →https://doi.org/10.1137/s0097539793250299openalex-snapshot
Identifying the Minimal Transversals of a Hypergraph and Related Problems
inferredcites →https://doi.org/10.1137/s0097539794276324openalex-snapshot
The Maximum Latency and Identification of Positive Boolean Functions
inferredcites →https://doi.org/10.1145/109648.109659openalex-snapshot
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
inferredcites →https://doi.org/10.1145/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/6420.6421openalex-snapshot
The vulnerability of vote assignments
inferredcites →https://doi.org/10.1145/72981.72994openalex-snapshot
Efficient solution to the distributed mutual exclusion problem
inferredcites →https://doi.org/10.1145/90417.90749openalex-snapshot
Replicated data and partition failures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-40992-0_16openalex-snapshot
Self-duality of Bounded Monotone Boolean Functions and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24840-8_23openalex-snapshot
Average Case Self-Duality of Monotone Boolean Functions
inferred← citeshttps://doi.org/10.1016/j.dam.2007.07.023openalex-snapshot
Self-duality of bounded monotone boolean functions and related problems
inferred← citeshttps://doi.org/10.1016/j.dam.2008.01.017openalex-snapshot
Counting and enumerating aggregate classifiers
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00311-8openalex-snapshot
Byzantine quorum systems with maximum availability
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00096-7openalex-snapshot
Minimum self-dual decompositions of positive dual-minor Boolean functions
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00101-8openalex-snapshot
Inner-core and outer-core functions of partially defined Boolean functions
inferred← citeshttps://doi.org/10.1016/s0920-5489(02)00105-8openalex-snapshot
A survey of permission-based distributed mutual exclusion algorithms
inferred← citeshttps://doi.org/10.1051/ro/2014034openalex-snapshot
A complete classification of equational classes of threshold functions included in clones
inferred← citeshttps://doi.org/10.1080/03081070903463536openalex-snapshot
Invariant continuous aggregation functions
inferred← citeshttps://doi.org/10.1109/12.780882openalex-snapshot
Improving the availability of mutual exclusion systems on incomplete networks
inferred← citeshttps://doi.org/10.1109/71.762814openalex-snapshot
Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes
inferred← citeshttps://doi.org/10.1109/71.954617openalex-snapshot
Coterie join operation and tree structured k-coteries
inferred← citeshttps://doi.org/10.1109/tpds.2005.25openalex-snapshot
Transversal merge operation: a nondominated coterie construction method for distributed mutual exclusion
inferred← citeshttps://doi.org/10.1137/s0895480100371110openalex-snapshot
Transformations on Regular Nondominated Coteries and Their Applications
inferred← citeshttps://doi.org/10.1145/343477.343629openalex-snapshot
Efficient generation of all regular non-dominated coteries
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95485openalex-snapshot
Structural and computational aspects of simple and influence games
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.