On the public citation graph
Bit-vector encoding for partially ordered sets
0 signed · 42 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.1007/3-540-17660-8_58openalex-snapshot
Efficient representation of taxonomies
inferredcites →https://doi.org/10.1007/3-540-18088-5_35openalex-snapshot
Posets, boolean representations and quick path searching
inferredcites →https://doi.org/10.1007/3-540-56979-0_15openalex-snapshot
Efficient retrieval from hierarchies of objects using lattice operations
inferredcites →https://doi.org/10.1007/3-540-58328-9_19openalex-snapshot
Exploiting the induced order on type-labeled graphs for fast knowledge retrieval
inferredcites →https://doi.org/10.1007/bf00383950openalex-snapshot
Primes, irreducibles and extremal lattices
inferredcites →https://doi.org/10.1007/bf02115811openalex-snapshot
Computing on-line the lattice of maximal antichains of posets
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.1016/0097-3165(84)90085-2openalex-snapshot
A Sperner theorem on unrelated chains of subsets
inferredcites →https://doi.org/10.1016/0304-3975(90)90125-2openalex-snapshot
On locally presented posets
inferredcites →https://doi.org/10.1016/0304-3975(95)00232-4openalex-snapshot
Tree structure for distributive lattices and its applications
inferredcites →https://doi.org/10.1016/s0304-0208(08)73833-7openalex-snapshot
Codages Et Dimensions De Relations Binaires
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0360386-3openalex-snapshot
The Factorization and Representation of Lattices
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/165854.165905openalex-snapshot
Efficient handling of multiple inheritance hierarchies
inferredcites →https://doi.org/10.1145/165854.165931openalex-snapshot
Building and maintaining analysis-level class hierarchies using Galois Lattices
inferredcites →https://doi.org/10.1145/59287.59293openalex-snapshot
Efficient implementation of lattice operations
inferredcites →https://doi.org/10.1145/66926.66950openalex-snapshot
Efficient management of transitive relationships in large data and knowledge bases
inferredcites →https://doi.org/10.1145/67544.66950openalex-snapshot
Efficient management of transitive relationships in large data and knowledge bases
inferredcites →https://doi.org/10.56021/9780801844256openalex-snapshot
Combinatorics and Partially Ordered 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/spe.1022openalex-snapshot
Coloring, a versatile technique for implementing object‐oriented languages
inferred← citeshttps://doi.org/10.1007/3-540-45337-7_10openalex-snapshot
A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests
inferred← citeshttps://doi.org/10.1007/3-540-47993-7_23openalex-snapshot
Polychotomic Encoding: A Better Quasi-Optimal Bit-Vector Encoding of Tree Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-030-00979-3_44openalex-snapshot
Algorithms for a Bit-Vector Encoding of Trees
inferred← citeshttps://doi.org/10.1007/bfb0053377openalex-snapshot
Near optimal hierarchical encoding of types
inferred← citeshttps://doi.org/10.1007/s11083-009-9135-7openalex-snapshot
The Complexity of Embedding Orders into Small Products of Chains
inferred← citeshttps://doi.org/10.1007/s11083-013-9300-xopenalex-snapshot
Lattice Classification by Cut-through Coding
inferred← citeshttps://doi.org/10.1007/s11083-015-9376-6openalex-snapshot
Embedding Ordered Sets into Distributive Lattices
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00232-4openalex-snapshot
Tree structure for distributive lattices and its applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.029openalex-snapshot
Computational aspects of the 2-dimension of partially ordered sets
inferred← citeshttps://doi.org/10.1134/s0361768809040021openalex-snapshot
LP structures on type lattices and some refactoring problems
inferred← citeshttps://doi.org/10.1137/15m1030054openalex-snapshot
The Secret Life of Keys: On the Calculation of Mechanical Lock Systems
inferred← citeshttps://doi.org/10.1137/s0097539794274404openalex-snapshot
An Efficient Data Structure for Lattice Operations
inferred← citeshttps://doi.org/10.1145/1086642.1086643openalex-snapshot
Efficient subtyping tests with PQ-encoding
inferred← citeshttps://doi.org/10.1145/1391956.1391960openalex-snapshot
Perfect hashing as an almost perfect subtype test
inferred← citeshttps://doi.org/10.1145/504282.504290openalex-snapshot
Efficient subtyping tests with PQ-encoding
inferred← citeshttps://doi.org/10.1145/582419.582434openalex-snapshot
Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching
inferred← citeshttps://doi.org/10.26456/mfcsics-21-6openalex-snapshot
Основанные на решетках алгебраические системы и их приложения в задачах управления знаниями
inferred← citeshttps://doi.org/10.3115/1073012.1073066openalex-snapshot
Tractability and structural closures in attribute logic type signatures
inferred← citeshttps://doi.org/10.4108/eai.27-2-2017.152339openalex-snapshot
Encoding Partial Orders Through Modular Decomposition
inferred← citeshttps://doi.org/10.5121/ijdms.2013.5103openalex-snapshot
Search Algorithms for Conceptual Graph Databases
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.