( en | de | ru )

 

Disambiguation of "Kuhnle, Alan"

Author of the publication

copydeleteadd this publication to your clipboard
Prefix-free parsing for building big BWTs.

, , , , , and . Algorithms Mol. Biol., 14 (1): 13:1-13:15 (2019)

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.

Safwat Alani

Maia Alandjiyska

Yilmaz Alan

Bertold Aland

Viola Alanku

 

Other publications of authors with the same name

Multiplex Influence Maximization in Online Social Networks with Heterogeneous Diffusion Models., , , , and . CoRR, (2018)Matching reads to many genomes with the r-index., , , , , and . CoRR, (2019)Scalable approximations to k-cycle transversal problems on dynamic networks., , and . Knowl. Inf. Syst., 61 (1): 65-84 (2019)RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization., , , , and . CoRR, (2023)Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint., and . J. Artif. Intell. Res., (2024)Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees., , and . SIGMETRICS (Abstracts), page 81-83. ACM, (2018)Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization.. AAAI, page 8200-8208. AAAI Press, (2021)Scalable bicriteria algorithms for the threshold activation problem in online social networks., , , and . INFOCOM, page 1-9. IEEE, (2017)Profit maximization for multiple products in online social networks., , , and . INFOCOM, page 1-9. IEEE, (2016)Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization.. CoRR, (2020)