Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet. - Laura Mancinska; Maris Ozols; Renate Praude; Agnese Zalcmane (FCS, 2005)

Size of Nondeterministic and Deterministic Automata for Certain Languages. - Raitis Ozols; Rusins Freivalds; Laura Mancinska; Maris Ozols (FCS, 2005)

Principles of Optimal Probabilistic Decision Tree Construction. - Laura Mancinska; Maris Ozols; Ilze Dzelme-Berzina; Rubens Agadzanjans; Ansis Rosmanis (FCS, 2006)

Protein Structure Comparison Based on Fold Evolution. - Natalja Kurbatova; Laura Mancinska; Juris Viksna (German Conference on Bioinformatics, 2007)

Improved constructions of mixed state quantum automata. - Rusins Freivalds; Maris Ozols; Laura Mancinska (Theor. Comput. Sci., 2009)

Characterization of universal two-qubit Hamiltonians. - Andrew M. Childs; Debbie W. Leung; Laura Mancinska; Maris Ozols (Quantum Inf. Comput., 2011)

New Separations in Zero-Error Channel Capacity Through Projective Kochen-Specker Sets and Quantum Coloring. - Laura Mancinska; Giannicola Scarpa; Simone Severini (IEEE Trans. Inf. Theory, 2013)

Maximally Entangled State in Pseudo-Telepathy Games. - Laura Mancinska (Computing with New Resources, 2014)

Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability. - Laura Mancinska; Thomas Vidick (ICALP (1), 2014)

Graph-theoretical Bounds on the Entangled Value of Non-local Games. - André Chailloux; Laura Mancinska; Giannicola Scarpa; Simone Severini (TQC, 2014)

Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants. - Toby S. Cubitt; Laura Mancinska; David E. Roberson; Simone Severini; Dan Stahlke; Andreas J. Winter 002 (TQC, 2014)

Graph Homomorphisms for Quantum Players. - Laura Mancinska; David E. Roberson (TQC, 2014)

Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász ( vartheta ) Number and Its Variants. - Toby S. Cubitt; Laura Mancinska; David E. Roberson; Simone Severini; Dan Stahlke; Andreas J. Winter 002 (IEEE Trans. Inf. Theory, 2014)

Maximally entangled states in pseudo-telepathy games. - Laura Mancinska (CoRR, 2015)

Unbounded entanglement in nonlocal games. - Laura Mancinska; Thomas Vidick (Quantum Inf. Comput., 2015)

Oddities of Quantum Colorings. - Laura Mancinska; David E. Roberson (Balt. J. Mod. Comput., 2016)

On deciding the existence of perfect entangled strategies for nonlocal games. - Laura Mancinska; David E. Roberson; Antonios Varvitsiotis (Chic. J. Theor. Comput. Sci., 2016)

Shortcuts to quantum network routing. - Eddie Schoute; Laura Mancinska; Tanvirul Islam; Iordanis Kerenidis; Stephanie Wehner (CoRR, 2016)

Complexity Classification of Two-Qubit Commuting Hamiltonians. - Adam Bouland; Laura Mancinska; Xue Zhang (Electron. Colloquium Comput. Complex., 2016)

Quantum homomorphisms. - Laura Mancinska; David E. Roberson (J. Comb. Theory B, 2016)

Relaxations of Graph Isomorphism. - Laura Mancinska; David E. Roberson; Robert Sámal; Simone Severini; Antonios Varvitsiotis (ICALP, 2017)

Quantum and non-signalling graph isomorphisms. - Albert Atserias; Laura Mancinska; David E. Roberson; Robert Sámal; Simone Severini; Antonios Varvitsiotis (J. Comb. Theory B, 2019)

Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. - Laura Mancinska; David E. Roberson (FOCS, 2020)

Cores of cubelike graphs. - Laura Mancinska; Irene Pivotto; David E. Roberson; Gordon F. Royle (Eur. J. Comb., 2020)

The geometry of Bloch space in the context of quantum random access codes. - Laura Mancinska; Sigurd A. L. Storgaard (Quantum Inf. Process., 2022)

An Operational Environment for Quantum Self-Testing. - Matthias Christandl; Nicholas Gauguin Houghton-Larsen; Laura Mancinska (Quantum, 2022)

Quantum Majority Vote. - Harry Buhrman; Noah Linden; Laura Mancinska; Ashley Montanaro; Maris Ozols (ITCS, 2023)

Counterexamples in self-testing. - Laura Mancinska; Simon Schmidt (Quantum, 2023)

Graph isomorphism: physical resources, optimization models, and algebraic characterizations. - Laura Mancinska; David E. Roberson; Antonios Varvitsiotis (Math. Program., 2024)

Gap-preserving reductions and RE-completeness of independent set games. - Laura Mancinska; Pieter Spaas; Taro Spirig (CoRR, 2025)