Sciweavers

RTA
1998
Springer
13 years 11 months ago
Decidable and Undecidable Second-Order Unification Problems
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...
Jordi Levy
RTA
1998
Springer
13 years 11 months ago
An On-line Problem Database
Nachum Dershowitz, Ralf Treinen
RTA
1998
Springer
13 years 11 months ago
The Decidability of Simultaneous Rigid E-Unification with One Variable
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...
Anatoli Degtyarev, Yuri Gurevich, Paliath Narendra...
RTA
1998
Springer
13 years 11 months ago
Higher-Order Rewriting and Partial Evaluation
Olivier Danvy, Kristoffer Høgsbro Rose
RELMICS
1998
Springer
13 years 11 months ago
Towards a uniform relational semantics for tabular expressions
Jules Desharnais, Ridha Khédri, Ali Mili
RELMICS
1998
Springer
13 years 11 months ago
Coping with semilattices of relations in logics with relative accessibility relations
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...
Stéphane Demri
RANDOM
1998
Springer
13 years 11 months ago
"Balls into Bins" - A Simple and Tight Analysis
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...
Martin Raab, Angelika Steger
RANDOM
1998
Springer
13 years 11 months ago
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey
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...
Alan M. Frieze