Pureの文献数とScopusの被引用数に基づいて算出されます
1998 …2025

年別の研究成果

フィルター

検索結果

  • 2015

    Multi-party computation with small shuffle complexity using regular polygon cards

    Shinagawa, K., Mizuki, T., Schuldt, J. C. N., Nuida, K., Kanayama, N., Nishide, T., Hanaoka, G. & Okamoto, E., 2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, p. 127-146 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9451).

    研究成果: 書籍の章/レポート/Proceedings査読

    27 被引用数 (Scopus)
  • 2004

    Necessary and sufficient numbers of cards for the transformation protocol (extended abstract)

    Koizumi, K., Mizuki, T. & Nishizeki, T., 2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Chwa, K.-Y. & Ian Munro, J. (eds.). Springer Verlag, p. 92-101 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3106).

    研究成果: 書籍の章/レポート/Proceedings査読

    6 被引用数 (Scopus)