default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaura Mancinska
Person information
- affiliation: University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Laura Mancinska
, David E. Roberson, Antonios Varvitsiotis:
Graph isomorphism: physical resources, optimization models, and algebraic characterizations. Math. Program. 205(1): 617-660 (2024)- 2023
- [j13]Laura Mancinska, Simon Schmidt:
Counterexamples in self-testing. Quantum 7: 1051 (2023) - [c13]Harry Buhrman, Noah Linden, Laura Mancinska, Ashley Montanaro, Maris Ozols:
Quantum Majority Vote. ITCS 2023: 29:1-29:1 - 2022
- [j12]Laura Mancinska, Sigurd A. L. Storgaard:
The geometry of Bloch space in the context of quantum random access codes. Quantum Inf. Process. 21(4): 143 (2022) - [j11]Matthias Christandl, Nicholas Gauguin Houghton-Larsen, Laura Mancinska:
An Operational Environment for Quantum Self-Testing. Quantum 6: 699 (2022) - 2020
- [j10]Laura Mancinska, Irene Pivotto, David E. Roberson, Gordon F. Royle:
Cores of cubelike graphs. Eur. J. Comb. 87: 103092 (2020) - [c12]Laura Mancinska, David E. Roberson:
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. FOCS 2020: 661-672
2010 – 2019
- 2019
- [j9]Albert Atserias, Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis:
Quantum and non-signalling graph isomorphisms. J. Comb. Theory B 136: 289-328 (2019) - [e1]Wim van Dam, Laura Mancinska:
14th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2019, June 3-5, 2019, University of Maryland, College Park, Maryland, USA. LIPIcs 135, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-112-2 [contents] - [i6]Laura Mancinska, David E. Roberson:
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. CoRR abs/1910.06958 (2019) - 2017
- [c11]Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis:
Relaxations of Graph Isomorphism. ICALP 2017: 76:1-76:14 - 2016
- [j8]Laura Mancinska, David E. Roberson:
Oddities of Quantum Colorings. Balt. J. Mod. Comput. 4(4) (2016) - [j7]Laura Mancinska, David E. Roberson, Antonios Varvitsiotis:
On deciding the existence of perfect entangled strategies for nonlocal games. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j6]Laura Mancinska, David E. Roberson:
Quantum homomorphisms. J. Comb. Theory B 118: 228-267 (2016) - [c10]Adam Bouland, Laura Mancinska, Xue Zhang:
Complexity Classification of Two-Qubit Commuting Hamiltonians. CCC 2016: 28:1-28:33 - [i5]Adam Bouland, Laura Mancinska, Xue Zhang:
Complexity classification of two-qubit commuting hamiltonians. CoRR abs/1602.04145 (2016) - [i4]Eddie Schoute, Laura Mancinska, Tanvirul Islam, Iordanis Kerenidis, Stephanie Wehner:
Shortcuts to quantum network routing. CoRR abs/1610.05238 (2016) - [i3]Adam Bouland, Laura Mancinska, Xue Zhang:
Complexity Classification of Two-Qubit Commuting Hamiltonians. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j5]Laura Mancinska, Thomas Vidick:
Unbounded entanglement in nonlocal games. Quantum Inf. Comput. 15(15&16): 1317-1332 (2015) - [i2]Laura Mancinska:
Maximally entangled states in pseudo-telepathy games. CoRR abs/1506.07080 (2015) - [i1]Laura Mancinska, David E. Roberson, Antonios Varvitsiotis:
Deciding the existence of perfect entangled strategies for nonlocal games. CoRR abs/1506.07429 (2015) - 2014
- [j4]Toby S. Cubitt, Laura Mancinska, David E. Roberson, Simone Severini, Dan Stahlke, Andreas J. Winter:
Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants. IEEE Trans. Inf. Theory 60(11): 7330-7344 (2014) - [c9]Laura Mancinska:
Maximally Entangled State in Pseudo-Telepathy Games. Computing with New Resources 2014: 200-207 - [c8]Laura Mancinska, Thomas Vidick:
Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability. ICALP (1) 2014: 835-846 - [c7]Toby S. Cubitt, Laura Mancinska, David E. Roberson, Simone Severini, Dan Stahlke, Andreas J. Winter:
Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants. TQC 2014: 48-51 - [c6]André Chailloux, Laura Mancinska, Giannicola Scarpa, Simone Severini:
Graph-theoretical Bounds on the Entangled Value of Non-local Games. TQC 2014: 67-75 - [c5]Laura Mancinska, David E. Roberson:
Graph Homomorphisms for Quantum Players. TQC 2014: 212-216 - 2013
- [j3]Laura Mancinska, Giannicola Scarpa, Simone Severini:
New Separations in Zero-Error Channel Capacity Through Projective Kochen-Specker Sets and Quantum Coloring. IEEE Trans. Inf. Theory 59(6): 4025-4032 (2013) - 2011
- [j2]Andrew M. Childs, Debbie W. Leung, Laura Mancinska, Maris Ozols:
Characterization of universal two-qubit Hamiltonians. Quantum Inf. Comput. 11(1&2): 19-39 (2011)
2000 – 2009
- 2009
- [j1]Rusins Freivalds, Maris Ozols, Laura Mancinska:
Improved constructions of mixed state quantum automata. Theor. Comput. Sci. 410(20): 1923-1931 (2009) - 2007
- [c4]Natalja Kurbatova, Laura Mancinska, Juris Viksna:
Protein Structure Comparison Based on Fold Evolution. German Conference on Bioinformatics 2007: 78-89 - 2006
- [c3]Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina, Rubens Agadzanjans, Ansis Rosmanis:
Principles of Optimal Probabilistic Decision Tree Construction. FCS 2006: 116-122 - 2005
- [c2]Laura Mancinska, Maris Ozols, Renate Praude, Agnese Zalcmane:
Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet. FCS 2005: 161-168 - [c1]Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols:
Size of Nondeterministic and Deterministic Automata for Certain Languages. FCS 2005: 169-175
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
