Sciweavers

1802 search results - page 29 / 361
» Complexity Theory for Operators in Analysis
Sort
View
POPL
2008
ACM
16 years 5 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
15 years 6 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
CCGRID
2003
IEEE
15 years 10 months ago
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
Farnoush Banaei Kashani, Cyrus Shahabi
CICLING
2005
Springer
15 years 10 months ago
A Computational Model of the Spanish Clitic System
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
Luis Alberto Pineda, Ivan V. Meza
CADE
2008
Springer
16 years 5 months ago
Model Stack for the Pervasive Verification of a Microkernel-based Operating System
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
Jan Dörrenbächer, Matthias Daum, Sebasti...