( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Arithmetic Expression Construction.

, , , , , , , , , , , , и . ISAAC, том 181 из LIPIcs, стр. 12:1-12:15. 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.

Josh Soer

Pushpa Raj Joshi

Jidnyasa Joshi

Ravi Joshi

Milind Joshi

 

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

Arithmetic Expression Construction., , , , , , , , , и 3 other автор(ы). ISAAC, том 181 из LIPIcs, стр. 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)An Optimal Algorithm for Online Freeze-Tag., и . FUN, том 157 из LIPIcs, стр. 8:1-8:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Complexity of Reconfiguration in Surface Chemical Reaction Networks., , , , , , , , , и 2 other автор(ы). DNA, том 276 из LIPIcs, стр. 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete., , , , , , и . CoRR, (2020)The Legend of Zelda: The Complexity of Mechanics., , , , , , и . CoRR, (2022)1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete., , , , , , и . FUN, том 157 из LIPIcs, стр. 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles., , , , , и . FUN, том 291 из LIPIcs, стр. 23:1-23:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard., , , и . ISAAC, том 181 из LIPIcs, стр. 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)An Optimal Algorithm for Online Freeze-tag., и . CoRR, (2019)Complexity of Solo Chess with Unlimited Moves., , , , , и . CoRR, (2023)