( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimality guarantees for crystal structure prediction.

, , , , , , , , , , и . Nat., 619 (7968): 68-72 (2023)

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.

Paul-G Behler

Paul G Lankisch

Paul G Lankisch

Giuseppe G G Manzardo

G Lüers

 

Другие публикации лиц с тем же именем

Traveling Salesman Problems in Temporal Graphs., и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 553-564. Springer, (2014)Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)., и . SAGT, том 6982 из Lecture Notes in Computer Science, стр. 190-199. Springer, (2011)Enabling Distance Education over the World Wide Web., , , и . WebNet, AACE, (1997)Cost-Balancing Tolls for Atomic Network Congestion Games., и . Internet Math., 5 (4): 343-363 (2008)Natural Models for Evolution on Networks., , , и . WINE, том 7090 из Lecture Notes in Computer Science, стр. 290-301. Springer, (2011)How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem., , , и . Cryptogr., 6 (3): 42 (2022)Tail Bounds for Occupancy Problems.. Encyclopedia of Algorithms, Springer, (2008)The Complexity of Optimal Design of Temporally Connected Graphs., , , и . Theory Comput. Syst., 61 (3): 907-944 (2017)Wormhole Versus Deflection Routing: A Case Study on the Mesh., , и . COCOON, том 1090 из Lecture Notes in Computer Science, стр. 31-40. Springer, (1996)Mutants and Residents with Different Connection Graphs in the Moran Process., , , и . CoRR, (2017)