SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study th...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairnes...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
We propose a new type of canonical decision diagrams, which allows a more efficient symbolic state-space generation for general asynchronous systems by allowing on-the-fly extensi...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the int...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension of event-clock automata. The class of ECVPAs, on one hand, can model simple real-...