Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Ioan Todinca"'
Publikováno v:
npj Quantum Information, Vol 10, Iss 1, Pp 1-9 (2024)
Abstract Quantum annealing (QA) holds promise for optimization problems in quantum computing, especially for combinatorial optimization. This analog framework attracts attention for its potential to address complex problems. Its gate-based homologous
Externí odkaz:
https://doaj.org/article/23aa27b369cf484f9c5889ca4dea9576
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Combinatorics (2020)
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a mi
Externí odkaz:
https://doaj.org/article/7fa68d46164443898e59e798365d70bd
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031327322
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e6c21da3e7bf7f45ff5e52ef43d9315
https://doi.org/10.1007/978-3-031-32733-9_21
https://doi.org/10.1007/978-3-031-32733-9_21
Quantum Annealing (QA) is a computational framework where a quantum system's continuous evolution is used to find the global minimum of an objective function over an unstructured search space. It can be seen as a general metaheuristic for optimizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::957ecd0457ee9b9b05d3012f4d6897d8
http://arxiv.org/abs/2202.01636
http://arxiv.org/abs/2202.01636
Publikováno v:
SIAM Journal on Discrete Mathematics. 34:682-700
The broadcast congested clique model (BClique) is a message-passing model of distributed computation where $n$ nodes communicate with each other in synchronous rounds. First, in this paper we prove...
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031099922
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21131d154646b819d0cf1500773fac8f
https://doi.org/10.1007/978-3-031-09993-9_7
https://doi.org/10.1007/978-3-031-09993-9_7
Publikováno v:
Discrete Applied Mathematics. 254:80-95
In the Minimal Permutation Completion problem, one is given an arbitrary graph G = ( V , E ) and the aim is to find a permutation super-graph H = ( V , F ) defined on the same vertex set and such that F ⊇ E is inclusion-minimal among all possibilit
Autor:
Ioan Todinca, Eric Rémila, Ivan Rapaport, Pierre Fraigniaud, Laurent Feuilloley, Pedro Montealegre
Publikováno v:
39th ACM Symposium on Principles of Distributed Computing
39th ACM Symposium on Principles of Distributed Computing, Aug 2020, Virtual Event Italy, Italy. pp.319-328, ⟨10.1145/3382734.3404505⟩
Algorithmica
Algorithmica, 2021, 83 (7), pp.2215-2244. ⟨10.1007/s00453-021-00823-w⟩
PODC
39th ACM Symposium on Principles of Distributed Computing, Aug 2020, Virtual Event Italy, Italy. pp.319-328, ⟨10.1145/3382734.3404505⟩
Algorithmica
Algorithmica, 2021, 83 (7), pp.2215-2244. ⟨10.1007/s00453-021-00823-w⟩
PODC
Naor, Parter, and Yogev (SODA 2020) have recently demonstrated the existence of a \emph{distributed interactive proof} for planarity (i.e., for certifying that a network is planar), using a sophisticated generic technique for constructing distributed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d4a796a033d3303c1b358139d19e500
http://arxiv.org/abs/2005.05863
http://arxiv.org/abs/2005.05863
Autor:
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2023, 325, pp.9--36. ⟨10.1016/j.dam.2022.10.004⟩
Discrete Applied Mathematics, 2023, 325, pp.9--36. ⟨10.1016/j.dam.2022.10.004⟩
International audience; Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for automatically translating standard centralized interactive protocols to distributed interactive protocols, as introduced by Kol, Oshman, and Saxena [PODC 201
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c0971027ec62ca9ef8590760d66456f
Publikováno v:
Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015)
Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Jun 2015, Munich, Germany. pp.499-512, ⟨10.1007/978-3-662-53174-7_35⟩
Graph-Theoretic Concepts in Computer Science ISBN: 9783662531730
WG
Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Jun 2015, Munich, Germany. pp.499-512, ⟨10.1007/978-3-662-53174-7_35⟩
Graph-Theoretic Concepts in Computer Science ISBN: 9783662531730
WG
Let $$\mathcal {P}(G,X)$$ be a property associating a boolean value to each pair (G, X) where G is a graph and X is a vertex subset. Assume that $$\mathcal {P}$$ is expressible in counting monadic second order logic (CMSO) and let t be an integer con