Author of the publication

Crystal Structure Prediction via Oblivious Local Search.

, , , , , and . SEA, volume 160 of LIPIcs, page 21:1-21:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

 

Other publications of authors with the same name

Brief Announcement: Fast Approximate Counting and Leader Election in Populations., , and . SIROCCO, volume 11085 of Lecture Notes in Computer Science, page 38-42. Springer, (2018)Beyond Rings: Gathering in 1-Interval Connected Graphs., , and . Parallel Process. Lett., 31 (4): 2150020:1-2150020:31 (2021)The Complexity of Growing a Graph., , , , and . CoRR, (2021)Fault tolerant network constructors., , and . Inf. Comput., (June 2023)Simple and fast approximate counting and leader election in populations., , and . Inf. Comput., 285 (Part): 104698 (2022)Fast Approximate Counting and Leader Election in Populations., , and . CoRR, (2018)Gathering in 1-Interval Connected Graphs., , and . CoRR, (2020)Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time., , , , and . DISC, volume 121 of LIPIcs, page 46:1-46:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Simple and Fast Approximate Counting and Leader Election in Populations., , and . SSS, volume 11201 of Lecture Notes in Computer Science, page 154-169. Springer, (2018)The Complexity of Growing a Graph., , , , and . ALGOSENSORS, volume 13707 of Lecture Notes in Computer Science, page 123-137. Springer, (2022)