| Publication | Date of Publication | Type |
|---|
| Vertex-minor universal graphs for generating entangled quantum subsystems | 2026-01-14 | Paper |
| Contextuality and expressivity of non-locality | 2024-11-28 | Paper |
Smash and grab: the \(0 \cdot 6\) scoring game on graphs
Theoretical Computer Science | 2024-02-20 | Paper |
A formalization of the CHSH inequality and Tsirelson's upper-bound in Isabelle/HOL
Journal of Automated Reasoning | 2024-02-06 | Paper |
A strict constrained superposition calculus for graphs
Lecture Notes in Computer Science | 2023-11-24 | Paper |
scientific article; zbMATH DE number 7724195 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
| scientific article; zbMATH DE number 7447795 (Why is no real title available?) | 2021-12-17 | Paper |
scientific article; zbMATH DE number 7447795 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-17 | Paper |
Polarization of Quantum Channels Using Clifford-Based Channel Combining
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
| Information flow in secret sharing protocols | 2021-01-26 | Paper |
Information flow in secret sharing protocols
(available as arXiv preprint) | 2021-01-26 | Paper |
Contextuality in multipartite pseudo-telepathy graph games
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Contextuality in multipartite pseudo-telepathy graph games
Lecture Notes in Computer Science | 2017-11-22 | Paper |
New protocols and lower bounds for quantum secret sharing with graph states
Theory of Quantum Computation, Communication, and Cryptography | 2015-12-03 | Paper |
Which Graph States are Useful for Quantum Information Processing?
Theory of Quantum Computation, Communication, and Cryptography | 2015-11-20 | Paper |
On weak odd domination and graph-based quantum secret sharing
Theoretical Computer Science | 2015-09-16 | Paper |
On the minimum degree up to local complementation: bounds and complexity
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
| Optimal accessing and non-accessing structures for graph protocols | 2011-09-28 | Paper |
| Combinatorial graph games | 2011-02-11 | Paper |
Rainbow and orthogonal paths in factorizations of K_n
Journal of Combinatorial Designs | 2010-08-03 | Paper |
Finding Optimal Flows Efficiently
Automata, Languages and Programming | 2008-08-28 | Paper |
Resources Required for Preparing Graph States
Algorithms and Computation | 2008-04-24 | Paper |
Around Wythoff's game
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
QUANTUM OCTAL GAMES
International Journal of Foundations of Computer Science | 2006-08-21 | Paper |
Quantum Query Complexity of Some Graph Problems
SIAM Journal on Computing | 2006-06-01 | Paper |
SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
On a modular domination game.
Theoretical Computer Science | 2004-03-14 | Paper |
