TLCA
2005
Springer
14 years 6 months ago
2005
Springer
We give a monadic semantics in the category of FM-cpos to a higher-order CBV language with recursion and dynamically allocated mutable references that may store both ground data an...
TLCA
2005
Springer
14 years 6 months ago
2005
Springer
Proof animation is a way of executing proofs to nd errors in the formalization of proofs. It is intended to be \testing in proof engineering". Although the realizability inter...
TLCA
2005
Springer
14 years 6 months ago
2005
Springer
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
STACS
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
STACS
2005
Springer
14 years 6 months ago
2005
Springer
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...
STACS
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
STACS
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
STACS
2005
Springer
14 years 6 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
STACS
2005
Springer
14 years 6 months ago
2005
Springer
We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami [1]. Guruswami showed that if one can explicitly construct optimal extractors then o...
STACS
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...