Sciweavers

138
Voted
SOFSEM
2009
Springer
16 years 4 months ago
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
Thomas Chatain, Paul Gastin, Nathalie Sznajder
SOFSEM
2009
Springer
16 years 4 months ago
Implementing Services by Partial State Machines
Walter Dosch, Annette Stümpel
125
Voted
SOFSEM
2009
Springer
16 years 4 months ago
Unambiguous Erasing Morphisms in Free Monoids
Johannes C. Schneider
191
Voted
SOFSEM
2009
Springer
16 years 4 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
125
Voted
SOFSEM
2009
Springer
16 years 4 months ago
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
Taolue Chen, Wan Fokkink, Rob J. van Glabbeek
159
Voted
SOFSEM
2009
Springer
16 years 4 months ago
Adaptive Incentive-Compatible Sponsored Search Auction
Rica Gonen, Elan Pavlov
181
Voted
SOFSEM
2009
Springer
16 years 4 months ago
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
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...
Nguyen Kim Thang
120
Voted
SOFSEM
2009
Springer
16 years 4 months ago
Conjunctive Grammars with Restricted Disjunction
Alexander Okhotin, Christian Reitwießner
SOFSEM
2009
Springer
16 years 4 months ago
The Shortcut Problem - Complexity and Approximation
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...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...