13 papers:
- CSCW-2015-CheatleJ #collaboration
- Digital Entanglements: Craft, Computation and Collaboration in Fine Art Furniture Production (AC, SJJ), pp. 958–968.
- LICS-2015-Hadzihasanovic #axiom #diagrams #quantum
- A Diagrammatic Axiomatisation for Qubit Entanglement (AH), pp. 573–584.
- ICALP-v1-2014-ChaillouxS #exponential #game studies #parallel
- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost (AC, GS), pp. 296–307.
- ICALP-v1-2014-MancinskaV #bound #probability
- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability (LM, TV), pp. 835–846.
- BX-2014-CheneyMSGA #monad
- Entangled State Monads (JC, JM, PS, JG, FAS), pp. 108–111.
- SIGMOD-2011-GuptaKRBGK #coordination #data-driven #declarative #query
- Entangled queries: enabling declarative data-driven coordination (NG, LK, SR, GB, JG, CK), pp. 673–684.
- VLDB-2011-GuptaNRBKGK #transaction
- Entangled Transactions (NG, MN, SR, GB, LK, JG, CK), pp. 887–898.
- STOC-2011-KempeV #game studies #parallel
- Parallel repetition of entangled games (JK, TV), pp. 353–362.
- ICALP-v2-2010-CoeckeK #composition #multi #quantum
- The Compositional Structure of Multipartite Quantum Entanglement (BC, AK), pp. 297–308.
- SAS-2008-Perdrix #abstract interpretation #analysis #quantum
- Quantum Entanglement Analysis Based on Abstract Interpretation (SP), pp. 270–282.
- ICALP-2007-MontanaroW #bound #communication #complexity #quantum
- A Lower Bound on Entanglement-Assisted Quantum Communication Complexity (AM, AJW), pp. 122–133.
- STOC-2003-Gurvits #complexity #problem #quantum
- Classical deterministic complexity of Edmonds’ Problem and quantum entanglement (LG), pp. 10–19.
- STOC-2002-NayakS #communication #on the #quantum
- On communication over an entanglement-assisted quantum channel (AN, JS), pp. 698–704.