185
Voted
RTA
1998
Springer
16 years 23 hour ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
182
Voted
RTA
1998
Springer
16 years 23 hour ago
1998
Springer
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
129
Voted
RELMICS
1998
Springer
16 years 1 days ago
1998
Springer
146
Voted
RELMICS
1998
Springer
16 years 1 days ago
1998
Springer
198
click to vote
RELMICS
1998
Springer
16 years 1 days ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
177
click to vote
RANDOM
1998
Springer
16 years 1 days ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
190
Voted
RANDOM
1998
Springer
16 years 1 days ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...