SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
66
Voted
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
69
Voted
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
105
Voted
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
98
Voted
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
105
Voted
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
59
Voted
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
109
click to vote
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
77
Voted
SOFSEM
2009
Springer
15 years 11 months ago
2009
Springer