( en | de | ru )

 

Disambiguation of "Hamacher, Kay"

Author of the publication

copydeleteadd this publication to your clipboard
Mainzelliste SecureEpiLinker (MainSEL): privacy-preserving record linkage using secure multi-party computation.

, , , , , , , and . Bioinform., 38 (6): 1657-1668 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kay Hamacher

Heinrich Hamacher

Peter Hamacher

Elisabeth Hamacher

Günther Hamacher

 

Other publications of authors with the same name

hoDCA: higher order direct-coupling analysis., and . BMC Bioinform., 19 (1): 546:1-546:5 (2018)Protein Domain Phylogenies - Information Theory and Evolutionary Dynamics.. BIOINFORMATICS, page 114-122. INSTICC Press, (2010)TransferEntropyPT: An R Package to Assess Transfer Entropies via Permutation Tests., and . CMSB, volume 10545 of Lecture Notes in Computer Science, page 285-290. Springer, (2017)A New Hybrid Metaheuristic - Combining Stochastic Tunneling and Energy Landscape Paving.. Hybrid Metaheuristics, volume 7919 of Lecture Notes in Computer Science, page 107-117. Springer, (2013)Stochastic tunneling transformation during selection in genetic algorithm., and . GECCO, page 801-806. ACM, (2014)Hybridization of Stochastic Tunneling with (Quasi)-Infinite Time-Horizon Tabu Search.. HM, volume 11299 of Lecture Notes in Computer Science, page 124-135. Springer, (2019)Large-Scale Privacy-Preserving Statistical Computations for Distributed Genome-Wide Association Studies., , , and . AsiaCCS, page 221-235. ACM, (2018)Privacy-Preserving Whole-Genome Variant Queries., , , and . CANS, volume 11261 of Lecture Notes in Computer Science, page 71-92. Springer, (2017)Public security: simulations need to replace conventional wisdom., and . NSPW, page 115-124. ACM, (2011)Is Your Permutation Algorithm Unbiased for n ≠ 2 m ?, , , , and . PPAM (1), volume 7203 of Lecture Notes in Computer Science, page 297-306. Springer, (2011)