Sciweavers

Share
ICALP
2000
Springer
8 years 9 months ago
Temporal Rewards for Performance Evaluation
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
Jeroen Voeten
ICALP
2000
Springer
8 years 9 months ago
Lax Logical Relations
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relatio...
Gordon D. Plotkin, John Power, Donald Sannella, Ro...
ICALP
2000
Springer
8 years 9 months ago
Dispersing Hash Functions
Rasmus Pagh
ICALP
2000
Springer
8 years 9 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
ICALP
2000
Springer
8 years 9 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick
ICALP
2000
Springer
8 years 9 months ago
A Statically Allocated Parallel Functional Language
Abstract. We describe SAFL, a call-by-value first-order functional language which is syntactically restricted so that storage may be statically allocated to fixed locations. Evalua...
Alan Mycroft, Richard Sharp
ICALP
2000
Springer
8 years 9 months ago
The Many Faces of a Translation
First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this ch...
Pierre McKenzie, Thomas Schwentick, Denis Th&eacut...
ICALP
2000
Springer
8 years 9 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
ICALP
2000
Springer
8 years 9 months ago
Hardness of Set Cover with Intersection 1
V. S. Anil Kumar, Sunil Arya, H. Ramesh
books