( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Compact 100-Gb/s DP-QPSK intradyne coherent receiver module employing Si waveguide.

, , , , , , , , и . ECOC, стр. 1-3. IEEE, (2015)

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.

Naoki Yoshida

Naoki Ueda

Naoki Fukuzawa

Naoki Tamura

Naoki Saito

 

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

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching., и . IEICE Trans. Inf. Syst., 105-D (3): 634-645 (2022)Uniform Distribution On Pachinko., , и . FUN, том 100 из LIPIcs, стр. 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Population Protocol for Uniform k-Partition Under Global Fairness., , , , и . IPDPS Workshops, стр. 813-819. IEEE Computer Society, (2018)Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs., , , и . OPODIS, том 253 из LIPIcs, стр. 11:1-11:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Low-Congestion Shortcut and Graph Parameters., , , и . DISC, том 146 из LIPIcs, стр. 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching., , и . CoRR, (2023)Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices., , , , и . CoRR, (2022)Fast Neighborhood Rendezvous., , и . ICDCS, стр. 168-178. IEEE, (2020)Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs., , , и . SPAA, стр. 11-22. ACM, (2022)Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage., , , и . PODC, стр. 241-243. ACM, (2018)