Laura Mancinska

Orcid: 0000-0001-9727-4961

Affiliations:
  • University of Copenhagen, Denmark


According to our database1, Laura Mancinska authored at least 29 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graph isomorphism: physical resources, optimization models, and algebraic characterizations.
Math. Program., May, 2024

2023
Counterexamples in self-testing.
Quantum, July, 2023

Quantum Majority Vote.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
An Operational Environment for Quantum Self-Testing.
Quantum, 2022

The geometry of Bloch space in the context of quantum random access codes.
Quantum Inf. Process., 2022

2020
Cores of cubelike graphs.
Eur. J. Comb., 2020

Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Quantum and non-signalling graph isomorphisms.
J. Comb. Theory B, 2019

2017
Relaxations of Graph Isomorphism.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Quantum homomorphisms.
J. Comb. Theory B, 2016

Complexity Classification of Two-Qubit Commuting Hamiltonians.
Electron. Colloquium Comput. Complex., 2016

Shortcuts to quantum network routing.
CoRR, 2016

On deciding the existence of perfect entangled strategies for nonlocal games.
Chic. J. Theor. Comput. Sci., 2016

Oddities of Quantum Colorings.
Balt. J. Mod. Comput., 2016

2015
Unbounded entanglement in nonlocal games.
Quantum Inf. Comput., 2015

Maximally entangled states in pseudo-telepathy games.
CoRR, 2015

2014
Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants.
IEEE Trans. Inf. Theory, 2014

Graph Homomorphisms for Quantum Players.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Graph-theoretical Bounds on the Entangled Value of Non-local Games.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Maximally Entangled State in Pseudo-Telepathy Games.
Proceedings of the Computing with New Resources, 2014

2013
New Separations in Zero-Error Channel Capacity Through Projective Kochen-Specker Sets and Quantum Coloring.
IEEE Trans. Inf. Theory, 2013

2011
Characterization of universal two-qubit Hamiltonians.
Quantum Inf. Comput., 2011

2009
Improved constructions of mixed state quantum automata.
Theor. Comput. Sci., 2009

2007
Protein Structure Comparison Based on Fold Evolution.
Proceedings of the German Conference on Bioinformatics, 2007

2006
Principles of Optimal Probabilistic Decision Tree Construction.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005
Size of Nondeterministic and Deterministic Automata for Certain Languages.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005


  Loading...