( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Quasi-Majority Functional Voting on Expander Graphs.

, и . ICALP, том 168 из LIPIcs, стр. 97:1-97:19. 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.

Nobutaka Ito

Takayasu Shimizu

Kenichi Shimizu

Toshiyoshi Shimizu

Akiko Shimizu

 

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

The Diameter of Dense Random Regular Graphs.. SODA, стр. 1934-1944. SIAM, (2018)Hardness Self-Amplification from Feasible Hard-Core Sets., и . FOCS, стр. 543-554. IEEE, (2022)Quasi-Majority Functional Voting on Expander Graphs., и . ICALP, том 168 из LIPIcs, стр. 97:1-97:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Hardness Self-Amplification: Simplified, Optimized, and Unified., и . STOC, стр. 70-83. ACM, (2023)How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?, , и . SODA, стр. 106-122. SIAM, (2021)Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH., и . SODA, стр. 2346-2365. SIAM, (2021)Average shortest path length of graphs of diameter 3., и . NOCS, стр. 1-6. IEEE, (2016)Planted Clique Conjectures Are Equivalent., и . Electron. Colloquium Comput. Complex., (2024)Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models., и . DISC, том 146 из LIPIcs, стр. 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)