Sciweavers

40 search results - page 3 / 8
» icalp 2003
Sort
View
ICALP
2003
Springer
13 years 10 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
ICALP
2003
Springer
13 years 10 months ago
Oracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
Ph. Schnoebelen
ICALP
2003
Springer
13 years 10 months ago
Discounting the Future in Systems Theory
Discounting the future means that the value, today, of a unit payoff is 1 if the payoff occurs today, a if it occurs tomorrow, a2 if it occurs the day after tomorrow,
Luca de Alfaro, Thomas A. Henzinger, Rupak Majumda...
ICALP
2003
Springer
13 years 10 months ago
Bisimulation Proof Methods for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
Massimo Merro, Francesco Zappa Nardelli