default search action
Marcos Villagra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j7]Sergio Mercado, Marcos Villagra
:
Bounds on the spectral sparsification of symmetric and off-diagonal nonnegative real matrices. Discret. Math. Algorithms Appl. 14(2): 2150109:1-2150109:9 (2022) - [c15]Santiago Arce, Luis Ayala Albertini, Ivan Ríos, Diego P. Pinto-Roa, José Colbes, Marcos Villagra:
Reinforcement Learning applied to the Routing and Spectrum Assignment in Elastic Optical Networks. LA-CCI 2022: 1-6 - 2021
- [j6]Benjamín Barán, Alejo Carballude, Marcos Villagra
A Multiobjective Approach for Nearest Neighbor Optimization of N-Dimensional Quantum Circuits. SN Comput. Sci. 2(1): 19 (2021) - [c14]Javier T. Akagi, Eduardo A. Canale, Marcos Villagra:
Tromino Tilings with Pegs via Flow Networks. LAGOS 2021: 459-467 - 2020
- [j5]Javier T. Akagi
Hard and easy instances of L-tromino tilings. Theor. Comput. Sci. 815: 197-212 (2020) - [i12]Fabricio Mendoza-Granada, Marcos Villagra:
A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering. CoRR abs/2003.10612 (2020) - [i11]Javier T. Akagi, Eduardo A. Canale, Marcos Villagra:
Tromino Tilings with Pegs via Flow Networks. CoRR abs/2007.12651 (2020) - [i10]Sergio Mercado, Marcos Villagra:
Bounds on the Spectral Sparsification of Symmetric and Off-Diagonal Nonnegative Real Matrices. CoRR abs/2009.11133 (2020)
2010 – 2019
- 2019
- [j4]Benjamín Barán
A Quantum Adiabatic Algorithm for Multiobjective Combinatorial Optimization. Axioms 8(1): 32 (2019) - [c13]Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza, Manjil P. Saikia
Hard and Easy Instances of L-Tromino Tilings. WALCOM 2019: 82-95 - 2018
- [j3]Marcos Villagra
Language recognition power and succinctness of affine automata. Nat. Comput. 17(2): 283-293 (2018) - [c12]Alejandro Díaz-Caro
Classically Time-Controlled Quantum Automata. TPNC 2018: 266-278 - [i9]Masaki Nakanishi, Marcos Villagra:
Computational Complexity of Space-Bounded Real Numbers. CoRR abs/1805.02572 (2018) - [i8]Alejandro Díaz-Caro, Marcos Villagra:
Classically Time-Controlled Quantum Automata. CoRR abs/1807.05385 (2018) - 2017
- [c11]Benjamín Barán
Multiobjective Optimization Grover Adaptive Search. WCO@FedCSIS 2017: 191-211 - [c10]Gerardo G. Fogel, Benjamín Barán
Comparison of two types of Quantum Oracles based on Grover's Adaptative Search Algorithm for Multiobjective Optimization Problems. FedCSIS 2017: 421-428 - [i7]Marcos Villagra:
A Block-Sensitivity Lower Bound for Quantum Testing Hamming Distance. CoRR abs/1705.09710 (2017) - [i6]Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza, Marcos Villagra:
Hard and Easy Instances of L-Tromino Tilings. CoRR abs/1710.04640 (2017) - 2016
- [c9]Marcos Villagra
Language Recognition Power and Succinctness of Affine Automata. UCNC 2016: 116-129 - [c8]Benjamín Barán
Multiobjective Optimization in a Quantum Adiabatic Computer. CLEI Selected Papers 2016: 27-38 - [i5]Marcos Villagra, Abuzer Yakaryilmaz:
Language recognition power and succintness of affine automata. CoRR abs/1602.05432 (2016) - [i4]Benjamín Barán, Marcos Villagra:
Multiobjective Optimization in a Quantum Adiabatic Computer. CoRR abs/1605.03152 (2016) - 2015
- [c7]Marcos Villagra
Quantum State Complexity of Formal Languages. DCFS 2015: 280-291 - 2014
- [c6]Marcos Villagra, Tomoyuki Yamakami:
Quantum and Reversible Verification of Proofs Using Constant Memory Space. TPNC 2014: 144-156 - 2013
- [j2]Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko Nakashima:
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication. IEICE Trans. Inf. Syst. 96-D(1): 1-8 (2013) - [i3]Xiaoming Sun, Marcos Villagra:
Exponential Quantum-Classical Gaps in Multiparty Nondeterministic Communication Complexity. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j1]Marcos Villagra
Quantum Walks on the Line with Phase Parameters. IEICE Trans. Inf. Syst. 95-D(3): 722-730 (2012) - [c5]Marcos Villagra
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication. TAMC 2012: 400-411 - [i2]Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko Nakashima:
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication. CoRR abs/1202.6444 (2012) - [i1]Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko Nakashima:
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication. Electron. Colloquium Comput. Complex. TR12 (2012)
2000 – 2009
- 2007
- [c4]Carlos Rodríguez
Asynchronous Team Algorithms for Boolean Satisfiability. BIONETICS 2007: 66-69 - [c3]Marcos Villagra
A Global Convexity Analysis on the MAX-SAT Domain. BIONETICS 2007: 74-78 - [c2]Marcos Villagra, Benjamín Barán:
Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing. WoLLIC 2007: 352-361 - 2006
- [c1]Marcos Villagra
Global Convexity in the Bi-Criteria Traveling Salesman Problem. IFIP AI 2006: 217-226
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-04-25 05:51 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: