We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
A serious defect with the Halpern-Pearl (HP) definition of causality is repaired by combining a theory of causality with a theory of defaults. In addition, it is shown that (despi...
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
In this paper, we review some potential applications of random Vandermonde matrices in the field of signal processing and wireless communications. Using asymptotic results based on...
As the saying goes, "In theory there is no difference between theory and practice. But, in practice, there is." Networking research has a wealth of good papers on both s...
We discuss the work of Paul Cohen in set theory and its influence, especially the background, discovery, development of forcing. Paul Joseph Cohen (1934
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...