default search action
Caterina Viola
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Arianna Pavone
, Caterina Viola:
The Quantum Cyclic Rotation Gate. SN Comput. Sci. 5(7): 830 (2024) - [c8]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Circuit Based Longest Common Substring. ICTCS 2024: 1-15 - [c7]Simone Faro, Arianna Pavone, Caterina Viola:
Families of Constant-Depth Quantum Circuits for Rotations and Permutations. ICTCS 2024: 29-41 - [c6]Libor Barto
Algebraic Approach to Approximation. LICS 2024: 10:1-10:14 - [c5]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Circuits for Fixed Matching Substring Problems. SAI (3) 2024: 667-686 - [c4]Simone Faro
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. TAMC 2024: 247-259 - [e1]Arianna Pavone, Caterina Viola:
Proceedings of the 2024 Workshop on Quantum Search and Information Retrieval, QUASAR 2024, Pisa, Italy, 3 June 2024. ACM 2024, ISBN 979-8-4007-0646-2 [contents] - [i8]Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola, Stanislav Zivný:
Algebraic Approach to Approximation. CoRR abs/2401.15186 (2024) - 2023
- [c3]Arianna Pavone
The Quantum Cyclic Rotation Gate. ICTCS 2023: 206-218 - [i7]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Circuits for Fixed Substring Matching Problems. CoRR abs/2308.11758 (2023) - [i6]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time. CoRR abs/2309.01250 (2023) - 2022
- [j2]Manuel Bodirsky
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. ACM Trans. Comput. Log. 23(1): 7:1-7:35 (2022) - [i5]Friedrich Martin Schneider, Caterina Viola:
An Application of Farkas' Lemma to Finite-Valued Constraint Satisfaction Problems over Infinite Domains. CoRR abs/2208.04912 (2022) - 2021
- [j1]Caterina Viola
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. ACM Trans. Algorithms 17(3): 21:1-21:23 (2021) - 2020
- [b1]Caterina Viola:
Valued Constraint Satisfaction Problems over Infinite Domains. University of Dresden, Germany, 2020 - [c2]Caterina Viola
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. MFCS 2020: 85:1-85:15 - [i4]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables. CoRR abs/2003.00963 (2020) - [i3]Caterina Viola, Stanislav Zivný:
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains. CoRR abs/2007.01779 (2020)
2010 – 2019
- 2019
- [i2]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation. CoRR abs/1912.09298 (2019) - 2018
- [c1]Manuel Bodirsky
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CSL 2018: 12:1-12:22 - [i1]Manuel Bodirsky, Marcello Mamino, Caterina Viola:
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. CoRR abs/1804.01710 (2018)
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-12-18 18:27 CET 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: