On the public citation graph

Computing on-line the lattice of maximal antichains of posets

https://doi.org/10.1007/bf02115811
0 signed · 38 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/3-540-56610-4_94openalex-snapshot
Reachability analysis on distributed executions
inferredcites →https://doi.org/10.1007/3-540-57155-8_285openalex-snapshot
Greedy algorithms for the on-line steiner tree and generalized steiner problems
inferredcites →https://doi.org/10.1007/978-3-642-01815-2_23openalex-snapshot
RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_15openalex-snapshot
Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
inferredcites →https://doi.org/10.1007/bf00383449openalex-snapshot
Finding all closed sets: A general approach
inferredcites →https://doi.org/10.1007/bf00383950openalex-snapshot
Primes, irreducibles and extremal lattices
inferredcites →https://doi.org/10.1016/0012-365x(91)90016-uopenalex-snapshot
The jump number and the lattice of maximal antichains
inferredcites →https://doi.org/10.1090/s0002-9947-1937-1501929-xopenalex-snapshot
Partially Ordered Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0360386-3openalex-snapshot
The Factorization and Representation of Lattices
inferredcites →https://doi.org/10.1109/fscs.1990.89568openalex-snapshot
Coloring inductive graphs on-line
inferredcites →https://doi.org/10.1145/122759.122774openalex-snapshot
Consistent detection of global predicates
inferredcites →https://doi.org/10.1145/200994.201005openalex-snapshot
Local and temporal predicates in distributed systems
inferredcites →https://doi.org/10.1145/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
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.1215/s0012-7094-37-00323-5openalex-snapshot
An extended arithmetic
inferredcites →https://doi.org/10.1215/s0012-7094-37-00334-xopenalex-snapshot
Rings of sets

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119069706.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/11880561_12openalex-snapshot
Efficient Lazy Algorithms for Minimal-Interval Semantics
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_387openalex-snapshot
Upward drawing on the plane grid using less ink
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_12openalex-snapshot
Lattice Completion Algorithms for Distributed Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_17openalex-snapshot
Maximal Antichain Lattice Algorithms for Distributed Computations
inferred← citeshttps://doi.org/10.1007/bf00389839openalex-snapshot
Simplicial elimination schemes, extremal lattices and maximal antichain lattices
inferred← citeshttps://doi.org/10.1007/bfb0019423openalex-snapshot
Bit-vector encoding for partially ordered sets
inferred← citeshttps://doi.org/10.1007/bfb0024488openalex-snapshot
Weak-order extensions of an order
inferred← citeshttps://doi.org/10.1007/bfb0054922openalex-snapshot
Stepwise construction of the Dedekind-MacNeille completion
inferred← citeshttps://doi.org/10.1016/j.dam.2008.10.010openalex-snapshot
Enumeration aspects of maximal cliques and bicliques
inferred← citeshttps://doi.org/10.1016/j.jalgor.2005.08.001openalex-snapshot
Lowest common ancestors in trees and directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.036openalex-snapshot
Efficient optimally lazy algorithms for minimal-interval semantics
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00349-7openalex-snapshot
A partition-based approach towards constructing Galois (concept) lattices
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00108-8openalex-snapshot
A fast algorithm for building lattices
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00132-4openalex-snapshot
Weak-order extensions of an order
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00200-4openalex-snapshot
On-line algorithms for orders
inferred← citeshttps://doi.org/10.1051/ita/1995290302271openalex-snapshot
On-line computations of the ideal lattice of posets
inferred← citeshttps://doi.org/10.1080/09528130210164152openalex-snapshot
A fast incremental algorithm for building lattices
inferred← citeshttps://doi.org/10.1111/0824-7935.00082openalex-snapshot
An Algorithm for Minimal Insertion in a Type Lattice
inferred← citeshttps://doi.org/10.1145/3307630.3342407openalex-snapshot
Exploring the Variability of Interconnected Product Families with Relational Concept Analysis
inferred← citeshttps://doi.org/10.1155/2013/692645openalex-snapshot
Another Note on Dilworth's Decomposition Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.0710.1525openalex-snapshot
Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics
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.