13306 search results - page 418 / 2662 » Theoretical Computer Science |
149
Voted
RTA
2001
Springer
15 years 11 months ago
2001
Springer
The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta r...
147
click to vote
SPIN
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes a reduction technique which is very useful against the state explosion problem which occurs when model checking distributed systems with several instances of t...
165
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
187
Voted
WG
2001
Springer
15 years 11 months ago
2001
Springer
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
163
Voted
WG
2001
Springer
15 years 11 months ago
2001
Springer
We call an edge e of a perfect graph G critical if G − e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect gr...