13306 search results - page 344 / 2662 » Theoretical Computer Science |
164
click to vote
RTA
1987
Springer
15 years 10 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
162
click to vote
STACS
1987
Springer
15 years 10 months ago
1987
Springer
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-ti...
222
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
158
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
188
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
Abstract: Especially data on social network services (SNS) is linked to online personas. Our analysis has shown that no reliably solution for origin authentication is in widespread...