Searching in trees, series-parallel and interval orders
SIAM Journal on Computing
Enumerative combinatorics
Constructive combinatorics
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Local and temporal predicates in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Gray codes and efficient generation of combinatorial structures
Gray codes and efficient generation of combinatorial structures
Techniques to Tackle State Explosion in Global Predicate Detection
IEEE Transactions on Software Engineering
Elements of distributed computing
Elements of distributed computing
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Principles of Distributed Systems
Principles of Distributed Systems
Computation Slicing: Techniques and Theory
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A CAT algorithm for generating permutations with a fixed number of inversions
Information Processing Letters
On Slicing a Distributed Computation
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Characterizing isometries on the order polytope with an application to the theory of fuzzy measures
Information Sciences: an International Journal
Adjacency on the order polytope with applications to the theory of fuzzy measures
Fuzzy Sets and Systems
| Hi-index | 5.23 |
A combinatorial problem usually requires enumerating, counting or ascertaining existence of structures that satisfy a given property B in a set of structures L. This paper describes a technique based on a generalization of Birkhoff's theorem of representation of finite distributive lattices that can be used for solving such problems mechanically and efficiently. Specifically, we give an efficient (polynomial time) algorithm to enumerate, count or detect structures that satisfy B when the total set of structures is large but the set of structures satisfying B is small. We illustrate our techniques by analyzing problems in integer partitions, set families, and set of permutations.