Georg Hahn

Orcid: 0000-0001-6008-2720

According to our database1, Georg Hahn authored at least 38 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast computation of the eigensystem of genomic similarity matrices.
BMC Bioinform., December, 2024

2023
Solving larger maximum clique problems using parallel quantum annealing.
Quantum Inf. Process., May, 2023

A comparison between similarity matrices for principal component analysis to assess population stratification in sequenced genetic data sets.
Briefings Bioinform., January, 2023

Posiform planting: generating QUBO instances for benchmarking.
Frontiers Comput. Sci., 2023

Penalized Principal Component Analysis using Nesterov Smoothing.
CoRR, 2023

Initial state encoding via reverse quantum annealing and h-gain features.
CoRR, 2023

Sampling binary sparse coding QUBO models using a spiking neuromorphic processor.
Proceedings of the 2023 International Conference on Neuromorphic Systems, 2023

2022
Unsupervised outlier detection applied to SARS-CoV-2 nucleotide sequences can identify sequences of common variants and other variants of interest.
BMC Bioinform., December, 2022

Inferring the Dynamics of the State Evolution During Quantum Annealing.
IEEE Trans. Parallel Distributed Syst., 2022

Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits.
CoRR, 2022

Solving Larger Optimization Problems Using Parallel Quantum Annealing.
CoRR, 2022

Assessing the Security of the IEEE 802.15.6 Standard for Medical BANs.
CoRR, 2022

Improving the Security of the IEEE 802.15.6 Standard for Medical BANs.
IEEE Access, 2022

2021
Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer.
J. Signal Process. Syst., 2021

A fast and efficient smoothing approach to Lasso regression and an application in statistical genetics: polygenic risk scores for chronic obstructive pulmonary disease (COPD).
Stat. Comput., 2021

Parallel Quantum Annealing.
CoRR, 2021

Quantum Annealing Algorithms for Boolean Tensor Networks.
CoRR, 2021

Using Machine Learning for Quantum Annealing Accuracy Prediction.
Algorithms, 2021

Boolean Hierarchical Tucker Networks on Quantum Annealers.
Proceedings of the Large-Scale Scientific Computing - 13th International Conference, 2021

Reducing quantum annealing biases for solving the graph partitioning problem.
Proceedings of the CF '21: Computing Frontiers Conference, 2021

2020
BayesProject: Fast computation of a projection direction for multivariate changepoint detection.
Stat. Comput., 2020

Optimal allocation of Monte Carlo simulations to multiple hypothesis tests.
Stat. Comput., 2020

A simple method for implementing Monte Carlo tests.
Comput. Stat., 2020

Advanced anneal paths for improved quantum annealing.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

Optimizing Embedding-Related Quantum Annealing Parameters for Reducing Hardware Bias.
Proceedings of the Parallel Architectures, Algorithms and Programming, 2020

Advanced unembedding techniques for quantum annealers.
Proceedings of the International Conference on Rebooting Computing, 2020

2019
Finding Maximum Cliques on the D-Wave Quantum Annealer.
J. Signal Process. Syst., 2019

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics.
Algorithms, 2019

Peering Into the Anneal Process of a Quantum Annealer.
Proceedings of the 20th International Conference on Parallel and Distributed Computing, 2019

Optimizing the Spin Reversal Transform on the D-Wave 2000Q.
Proceedings of the 2019 IEEE International Conference on Rebooting Computing, 2019

Local and Global Stratification Analysis in Whole Genome Sequencing (WGS) Studies Using LocStra.
Proceedings of the Computational Advances in Bio and Medical Sciences, 2019

Solving large minimum vertex cover problems on a quantum annealer.
Proceedings of the 16th ACM International Conference on Computing Frontiers, 2019

2017
Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning.
SIAM J. Sci. Comput., 2017

QuickMMCTest: quick multiple Monte Carlo testing.
Stat. Comput., 2017

Solving Large Maximum Clique Problems on a Quantum Annealer.
Proceedings of the Quantum Technology and Optimization Problems, 2017

Reducing Binary Quadratic Forms for More Scalable Quantum Annealing.
Proceedings of the IEEE International Conference on Rebooting Computing, 2017

Finding Maximum Cliques on a Quantum Annealer.
Proceedings of the Computing Frontiers Conference, 2017

2016
Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016


  Loading...