28 citations · 36 across the 3 of their papers we have counts for
4 papers
Efficient Combinatorial Optimization Using Quantum Annealing
Hristo N. Djidjev, Guillaume Chapuis, Georg Hahn +1
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techn…
Finding Maximum Cliques on the D-Wave Quantum Annealer
Guillaume Chapuis, Hristo N. Djidjev, Georg Hahn +1
This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Beca…
Fast and scalable minimal perfect hashing for massive key sets
Antoine Limasset, Guillaume Rizk, Rayan Chikhi +1
Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical l…
Compression of high throughput sequencing data with probabilistic de Bruijn graph
Gaëtan Benoit, Claire Lemaitre, Dominique Lavenier +1
Motivation: Data volumes generated by next-generation sequencing technolo- gies is now a major concern, both for storage and transmission. This triggered the need for more efficien…