Sciweavers

ICALP
2005
Springer
14 years 6 months ago
Weighted Automata and Weighted Logics
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
Manfred Droste, Paul Gastin
ICALP
2005
Springer
14 years 6 months ago
Optimal Cover Time for a Graph-Based Coupon Collector Process
Nedialko B. Dimitrov, C. Greg Plaxton
ICALP
2005
Springer
14 years 6 months ago
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be...
Martin Dietzfelbinger, Christoph Weidling
ICALP
2005
Springer
14 years 6 months ago
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
Scott Diehl, Dieter van Melkebeek
ICALP
2005
Springer
14 years 6 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
ICALP
2005
Springer
14 years 6 months ago
On the Wake-Up Problem in Radio Networks
Abstract. Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the property that multiple messages arriving s...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
ICALP
2005
Springer
14 years 6 months ago
Worst Case Optimal Union-Intersection Expression Evaluation
Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazad...
ICALP
2005
Springer
14 years 6 months ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch
ICALP
2005
Springer
14 years 6 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
ICALP
2005
Springer
14 years 6 months ago
The Complexity of Stochastic Rabin and Streett Games'
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...