Laura Mancinska

36 papers A* 3A 2Journal 21Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Gap-preserving reductions and RE-completeness of independent set games. FOCS Laura Mancinska, Pieter Spaas, Taro Spirig, Matthijs Vernooij
2025	J	`jnl`	Gap-preserving reductions and RE-completeness of independent set games. CoRR Laura Mancinska, Pieter Spaas, Taro Spirig
2024	J	`jnl`	Graph isomorphism: physical resources, optimization models, and algebraic characterizations. Math. Program. Laura Mancinska, David E. Roberson, Antonios Varvitsiotis
2023	J	`jnl`	Counterexamples in self-testing. Quantum Laura Mancinska, Simon Schmidt
2023	A	`conf`	Quantum Majority Vote. ITCS Harry Buhrman, Noah Linden, Laura Mancinska, Ashley Montanaro, Maris Ozols
2022	J	`jnl`	An Operational Environment for Quantum Self-Testing. Quantum Matthias Christandl, Nicholas Gauguin Houghton-Larsen, Laura Mancinska
2022	J	`jnl`	The geometry of Bloch space in the context of quantum random access codes. Quantum Inf. Process. Laura Mancinska, Sigurd A. L. Storgaard
2020	J	`jnl`	Cores of cubelike graphs. Eur. J. Comb. Laura Mancinska, Irene Pivotto, David E. Roberson, Gordon F. Royle
2020	A*	`conf`	Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. FOCS Laura Mancinska, David E. Roberson
2019	—	`ed.`	14th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2019, University of Maryland, College Park, Maryland, USA, June 3-5, 2019 TQC Wim van Dam, Laura Mancinska
2019	J	`jnl`	Quantum and non-signalling graph isomorphisms. J. Comb. Theory B Albert Atserias, Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis
2019	J	`jnl`	Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. CoRR Laura Mancinska, David E. Roberson
2017	A*	`conf`	Relaxations of Graph Isomorphism. ICALP Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis
2016	A	`conf`	Complexity Classification of Two-Qubit Commuting Hamiltonians. CCC Adam Bouland, Laura Mancinska, Xue Zhang
2016	J	`jnl`	Complexity Classification of Two-Qubit Commuting Hamiltonians. Electron. Colloquium Comput. Complex. Adam Bouland, Laura Mancinska, Xue Zhang
2016	J	`jnl`	Complexity classification of two-qubit commuting hamiltonians. CoRR Adam Bouland, Laura Mancinska, Xue Zhang
2016	J	`jnl`	Oddities of Quantum Colorings. Balt. J. Mod. Comput. Laura Mancinska, David E. Roberson
2016	J	`jnl`	On deciding the existence of perfect entangled strategies for nonlocal games. Chic. J. Theor. Comput. Sci. Laura Mancinska, David E. Roberson, Antonios Varvitsiotis
2016	J	`jnl`	Quantum homomorphisms. J. Comb. Theory B Laura Mancinska, David E. Roberson
2016	J	`jnl`	Shortcuts to quantum network routing. CoRR Eddie Schoute, Laura Mancinska, Tanvirul Islam, Iordanis Kerenidis, Stephanie Wehner
2015	J	`jnl`	Deciding the existence of perfect entangled strategies for nonlocal games. CoRR Laura Mancinska, David E. Roberson, Antonios Varvitsiotis
2015	J	`jnl`	Maximally entangled states in pseudo-telepathy games. CoRR Laura Mancinska
2015	J	`jnl`	Unbounded entanglement in nonlocal games. Quantum Inf. Comput. Laura Mancinska, Thomas Vidick
2014	—	`conf`	Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants. TQC Toby S. Cubitt, Laura Mancinska, David E. Roberson, Simone Severini, Dan Stahlke, Andreas J. Winter
2014	J	`jnl`	Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants. IEEE Trans. Inf. Theory Toby S. Cubitt, Laura Mancinska, David E. Roberson, Simone Severini, Dan Stahlke, Andreas J. Winter
2014	—	`conf`	Graph Homomorphisms for Quantum Players. TQC Laura Mancinska, David E. Roberson
2014	—	`conf`	Graph-theoretical Bounds on the Entangled Value of Non-local Games. TQC André Chailloux, Laura Mancinska, Giannicola Scarpa, Simone Severini
2014	—	`conf`	Maximally Entangled State in Pseudo-Telepathy Games. Computing with New Resources Laura Mancinska
2014	—	`conf`	Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability. ICALP (1) Laura Mancinska, Thomas Vidick
2013	J	`jnl`	New Separations in Zero-Error Channel Capacity Through Projective Kochen-Specker Sets and Quantum Coloring. IEEE Trans. Inf. Theory Laura Mancinska, Giannicola Scarpa, Simone Severini
2011	J	`jnl`	Characterization of universal two-qubit Hamiltonians. Quantum Inf. Comput. Andrew M. Childs, Debbie W. Leung, Laura Mancinska, Maris Ozols
2009	J	`jnl`	Improved constructions of mixed state quantum automata. Theor. Comput. Sci. Rusins Freivalds, Maris Ozols, Laura Mancinska
2007	—	`conf`	Protein Structure Comparison Based on Fold Evolution. German Conference on Bioinformatics Natalja Kurbatova, Laura Mancinska, Juris Viksna
2006	—	`conf`	Principles of Optimal Probabilistic Decision Tree Construction. FCS Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina, Rubens Agadzanjans, Ansis Rosmanis
2005	—	`conf`	Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet. FCS Laura Mancinska, Maris Ozols, Renate Praude, Agnese Zalcmane
2005	—	`conf`	Size of Nondeterministic and Deterministic Automata for Certain Languages. FCS Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols