Effective nearest neighbors searching on the hyper-cube, with applications to molecular clustering
Proceedings of the fourteenth annual symposium on Computational geometry
Partitioning the Boolean lattice into chains of large minimum size
Journal of Combinatorial Theory Series A
Discrete Mathematics - Kleitman and combinatorics: a celebration
On the average size of sets in intersecting sperner families
Discrete Mathematics - Kleitman and combinatorics: a celebration
A local-global principle for vertex-isoperimetric problems
Discrete Mathematics - Kleitman and combinatorics: a celebration
Sperner theory in a difference of boolean lattices
Discrete Mathematics - Kleitman and combinatorics: a celebration
Normalized matching property of the subgroup lattice of an abelian p-group
Discrete Mathematics - Kleitman and combinatorics: a celebration
The width of random subsets of boolean lattices
Journal of Combinatorial Theory Series A
The t-intersection problem in the truncated Boolean lattice
European Journal of Combinatorics
Partitioning the boolean lattice into a minimal number of chains of relatively uniform size
European Journal of Combinatorics
Forbidden (0,1)-Vectors in Hyperplanes of \Bbb{R}n: The Restricted Case
Designs, Codes and Cryptography
A Meshalkin theorem for projective geometries
Journal of Combinatorial Theory Series A
Integer partitions and the Sperner property
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Computational aspects of the 2-dimension of partially ordered sets
Theoretical Computer Science
On the log-concavity of sequences arising from integer bases
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
A new approach to Macaulay posets
Journal of Combinatorial Theory Series A
On quotients of posets, with an application to the q-analog of the hypercube
European Journal of Combinatorics
A new matching property for posets and existence of disjoint chains
Journal of Combinatorial Theory Series A
Nested chain partitions of LYM posets
Discrete Applied Mathematics
Enumeration of certain affine invariant extended cyclic codes
Journal of Combinatorial Theory Series A
Forbidden (0,1)-vectors in Hyperplanes of $$\mathbb{R}^{n}$$: The unrestricted case
Designs, Codes and Cryptography
Largest family without A ∪ B ⊆ C ∩ D
Journal of Combinatorial Theory Series A
Intersection theorems under dimension constraints
Journal of Combinatorial Theory Series A
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
Theoretical Computer Science - Logic, language, information and computation
Identification of fuzzy measures from sample data with genetic algorithms
Computers and Operations Research
Construction of asymmetric connectors of depth two
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
Combinatorics, Probability and Computing
An upper bound on computing all X-minimal models
AI Communications
On the polytope of non-additive measures
Fuzzy Sets and Systems
A pommaret division algorithm for computing Grobner bases in boolean rings
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A generalization of Sperner's theorem and an application to graph orientations
Discrete Applied Mathematics
Optimal matrix-segmentation by rectangles
Discrete Applied Mathematics
Interactive Communication, Diagnosis and Error Control in Networks
Algorithmics of Large and Complex Networks
The necklace poset is a symmetric chain order
Journal of Combinatorial Theory Series A
Cross-intersecting families and primitivity of symmetric systems
Journal of Combinatorial Theory Series A
A tour of M-part L-Sperner families
Journal of Combinatorial Theory Series A
Minimal half-spaces and external representation of tropical polyhedra
Journal of Algebraic Combinatorics: An International Journal
Intersecting antichains and shadows in linear lattices
Journal of Combinatorial Theory Series A
Symmetric chains, Gelfand---Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
Journal of Algebraic Combinatorics: An International Journal
Optimal fingerprinting strategies with one-sided error
Quantum Information & Computation
Counting the orderings for multisets in consecutive ones property and PQ-trees
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Some new bounds on partition critical hypergraphs
European Journal of Combinatorics
Sparse asymmetric connectors in communication networks
General Theory of Information Transfer and Combinatorics
ACM Transactions on Database Systems (TODS)
On Security of Statistical Databases
SIAM Journal on Discrete Mathematics
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Information and Computation
Annals of Mathematics and Artificial Intelligence
Inequalities for cross-unions of collections of finite sets
European Journal of Combinatorics
Information Theory, Combinatorics, and Search Theory
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
Counting inequivalent monotone Boolean functions
Discrete Applied Mathematics
| Hi-index | 0.00 |