24 citations · 57 across the 5 of their papers we have counts for
6 papers
Unbalancing Binary Trees
Matthew L. Ginsberg
Assuming Zipf's Law to be accurate, we show that existing techniques for partially optimizing binary trees produce results that are approximately 10% worse than true optimal. We pr…
Dr.Fill: Crosswords and an Implemented Solver for Singly Weighted CSPs
Matthew L. Ginsberg
We describe Dr.Fill, a program that solves American-style crossword puzzles. From a technical perspective, Dr.Fill works by converting crosswords to weighted CSPs, and then using a…
Implementing Probabilistic Reasoning
Matthew L. Ginsberg
General problems in analyzing information in a probabilistic database are considered. The practical difficulties (and occasional advantages) of storing uncertain data, of using it…
Generalizing Boolean Satisfiability III: Implementation
H. E. Dixon, M. L. Ginsberg, D. Hofer +2
This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern hi…
Generalizing Boolean Satisfiability II: Theory
H. E. Dixon, M. L. Ginsberg, E. M. Luks +1
This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of…
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
H. E. Dixon, M. L. Ginsberg, A. J. Parkes
This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of m…