 | 2012 |
| 12 |  | Jérôme Javelle,
Mehdi Mhalla,
Simon Perdrix:
On the Minimum Degree up to Local Complementation: Bounds and Complexity
CoRR abs/1204.4564: (2012) |
| 2011 |
| 11 |  | Sylvain Gravier,
Jérôme Javelle,
Mehdi Mhalla,
Simon Perdrix:
Optimal accessing and non-accessing structures for graph protocols
CoRR abs/1109.6181: (2011) |
| 10 |  | Sylvain Gravier,
Jérôme Javelle,
Mehdi Mhalla,
Simon Perdrix:
On Weak Odd Domination and Graph-based Quantum Secret Sharing
CoRR abs/1112.2495: (2011) |
| 2009 |
| 9 |  | Elham Kashefi,
Damian Markham,
Mehdi Mhalla,
Simon Perdrix:
Information Flow in Secret Sharing Protocols.
DCM 2009: 87-97 |
| 2008 |
| 8 |  | Mehdi Mhalla,
Simon Perdrix:
Finding Optimal Flows Efficiently.
ICALP (1) 2008: 857-868 |
| 2006 |
| 7 |  | Peter Høyer,
Mehdi Mhalla,
Simon Perdrix:
Resources Required for Preparing Graph States.
ISAAC 2006: 638-649 |
| 6 |  | Sylvain Gravier,
Philippe Jorrand,
Mehdi Mhalla,
Charles Payan:
Quantum Octal Games.
Int. J. Found. Comput. Sci. 17(4): 919-932 (2006) |
| 5 |  | Christoph Dürr,
Mark Heiligman,
Peter Høyer,
Mehdi Mhalla:
Quantum Query Complexity of Some Graph Problems.
SIAM J. Comput. 35(6): 1310-1328 (2006) |
| 2005 |
| 4 |  | Éric Duchêne,
Sylvain Gravier,
Mehdi Mhalla:
Around Wythoff's game.
Electronic Notes in Discrete Mathematics 22: 167-172 (2005) |
| 2004 |
| 3 |  | Christoph Dürr,
Mark Heiligman,
Peter Høyer,
Mehdi Mhalla:
Quantum Query Complexity of Some Graph Problems.
ICALP 2004: 481-493 |
| 2003 |
| 2 |  | Philippe Jorrand,
Mehdi Mhalla:
Separability Of Pure N-Qubit States: Two Characterizations.
Int. J. Found. Comput. Sci. 14(5): 797-814 (2003) |
| 1 |  | Sylvain Gravier,
Mehdi Mhalla,
Eric Tannier:
On a modular domination game.
Theor. Comput. Sci. 306(1-3): 291-303 (2003) |