Sciweavers

7811 search results - page 1276 / 1563
» computing 2004
Sort
View
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
15 years 9 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 9 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
CONCUR
2004
Springer
15 years 9 months ago
The Pros and Cons of Netcharts
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
Nicolas Baudru, Rémi Morin
CONCUR
2004
Springer
15 years 9 months ago
Type Based Discretionary Access Control
Abstract. Discretionary Access Control (DAC) systems provide powerful mechanisms for resource management based on the selective distribution of capabilities to selected classes of ...
Michele Bugliesi, Dario Colazzo, Silvia Crafa
CONCUR
2004
Springer
15 years 9 months ago
Probabilistic Event Structures and Domains
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
Daniele Varacca, Hagen Völzer, Glynn Winskel
« Prev « First page 1276 / 1563 Last » Next »