Failure correction techniques for large disk arrays
ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
On exact specification by examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Neighborhood preserving hashing and approximate queries
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
The width of random subsets of boolean lattices
Journal of Combinatorial Theory Series A
Combinatorics, Probability and Computing
Covering minimum spanning trees of random subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Stable sets of maximal size in Kneser-type graphs
European Journal of Combinatorics
Multicoloured extremal problems
Journal of Combinatorial Theory Series A
Stability theorems for cancellative hypergraphs
Journal of Combinatorial Theory Series B
Every decision tree has an in.uential variable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Complexity aspects of generalized Helly hypergraphs
Information Processing Letters
On a restricted cross-intersection problem
Journal of Combinatorial Theory Series A
Minimal paths and cycles in set systems
European Journal of Combinatorics
An AZ-style identity and Bollobás deficiency
Journal of Combinatorial Theory Series A
On the complexity of constrained VC-classes
Discrete Applied Mathematics
Aspects of discrete mathematics and probability in the theory of machine learning
Discrete Applied Mathematics
Graph colouring with no large monochromatic components
Combinatorics, Probability and Computing
Constrained versions of Sauer's lemma
Discrete Applied Mathematics
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On the complexity of binary samples
Annals of Mathematics and Artificial Intelligence
Linear CNF formulas and satisfiability
Discrete Applied Mathematics
Note: On decompositions of complete hypergraphs
Journal of Combinatorial Theory Series A
The communication complexity of correlation
IEEE Transactions on Information Theory
Journal of the ACM (JACM)
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
On learning random DNF formulas under the uniform distribution
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Boolean formulas and frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Designs, Codes and Cryptography
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Reliability in layered networks with random link failures
IEEE/ACM Transactions on Networking (TON)
PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases
Information Theory, Combinatorics, and Search Theory
Discrete Applied Mathematics
Approximately classic judgement aggregation
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.06 |