Sciweavers

1007 search results - page 85 / 202
» The Complexity of Futile Questioning
Sort
View
CORR
2004
Springer
114views Education» more  CORR 2004»
15 years 3 months ago
Quantum Communication Cannot Simulate a Public Coin
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 10 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...
CSL
2009
Springer
15 years 10 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
MODELS
2007
Springer
15 years 9 months ago
Using Domain-Specific Modeling to Generate User Interfaces for Wizards
The rising adoption and incorporation of computers into everyday life requires human-computer interaction methods to be efficient and easy to understand. Simultaneously, complexit...
Enis Afgan, Jeffrey G. Gray, Purushotham Bangalore
CCS
2007
ACM
15 years 7 months ago
Efficient policy analysis for administrative role based access control
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...
Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, M...