Pureに変更を加えた場合、すぐここに表示されます。

研究成果 2001 2019

2015
3 引用 (Scopus)

A Faster longest common extension algorithm on compressed strings and its applications: (Invited talk)

Inenaga, S., 1 1 2015, Proceedings of the Prague Stringology Conference 2015, PSC 2015. Zd'arek, J. & Holub, J. (版). Prague Stringology Club, p. 1-4 4 p. (Proceedings of the Prague Stringology Conference 2015, PSC 2015).

研究成果: 著書/レポートタイプへの貢献会議での発言

Strings
Straight-line Programs
Data Structures
Query
Grammar
23 引用 (Scopus)

A new characterization of maximal repetitions by Lyndon trees

Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M. & Tsuruta, K., 1 1 2015, p. 562-571. 10 p.

研究成果: 会議への寄与タイプ論文

Strings
Factorization
Linear-time Algorithm
Lyndon Words
Upper bound
1 引用 (Scopus)

An opportunistic text indexing structure based on run length encoding

Tamakoshi, Y., Goto, K., Inenaga, S., Bannai, H. & Takeda, M., 2015, Algorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings. Springer Verlag, 巻 9079. p. 390-402 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9079).

研究成果: 著書/レポートタイプへの貢献会議での発言

Run-length Encoding
Text Indexing
Data structures
Data Structures
Strings
5 引用 (Scopus)

Compressed automata for dictionary matching

Tomohiro, I., Nishimoto, T., Inenaga, S., Bannai, H. & Takeda, M., 5 1 2015, : : Theoretical Computer Science. 578, p. 30-41 12 p.

研究成果: ジャーナルへの寄稿記事

Glossaries
Automata
Straight-line Programs
Matching Problem
Dictionary

Computing left-right maximal generic words

Nishimoto, T., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2015, Proceedings of the Prague Stringology Conference 2015, PSC 2015. Zd'arek, J. & Holub, J. (版). Prague Stringology Club, p. 5-16 12 p. (Proceedings of the Prague Stringology Conference 2015, PSC 2015).

研究成果: 著書/レポートタイプへの貢献会議での発言

Computing
Data Structures
Distinct
Word problem
5 引用 (Scopus)

Constructing LZ78 tries and position heaps in linear time for large alphabets

Nakashima, Y., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 9 1 2015, : : Information Processing Letters. 115, 9, p. 655-659 5 p.

研究成果: ジャーナルへの寄稿記事

Heap
Linear Time
Strings
Factorization
Suffix Tree
7 引用 (Scopus)

Detecting regularities on grammar-compressed strings

Tomohiro, I., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K. & Shinohara, A., 1 1 2015, : : Information and Computation. 240, p. 74-89 16 p.

研究成果: ジャーナルへの寄稿記事

Straight-line Programs
Grammar
Strings
Regularity
Context free grammars
7 引用 (Scopus)

Diverse palindromic factorization is NP-complete

Bannai, H., Gagie, T., Inenaga, S., Kärkkäinen, J., Kempa, D., Piątkowski, M., Puglisi, S. J. & Sugimoto, S., 1 1 2015, Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings. Potapov, I. (版). Springer Verlag, p. 85-96 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9168).

研究成果: 著書/レポートタイプへの貢献会議での発言

Palindrome
Factorization
NP-complete problem
Strings
3 引用 (Scopus)

Dynamic edit distance table under a general weighted cost function

Hyyrö, H., Narisawa, K. & Inenaga, S., 9 1 2015, : : Journal of Discrete Algorithms. 34, p. 2-17 16 p.

研究成果: ジャーナルへの寄稿記事

Edit Distance
Cost functions
Cost Function
Table
Strings
1 引用 (Scopus)

Efficient algorithms for longest closed factor array

Bannai, H., Inenaga, S., Kociumaka, T., Lefebvre, A., Radoszewski, J., Rytter, W., Sugimoto, S. & Waleń, T., 1 1 2015, String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings. Puglisi, S. J., Iliopoulos, C. S. & Yilmaz, E. (版). Springer Verlag, p. 95-102 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9309).

研究成果: 著書/レポートタイプへの貢献会議での発言

Efficient Algorithms
Closed
Strings
1 引用 (Scopus)

Inferring strings from full abelian periods

Nishida, M., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2015, Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings. Springer Verlag, p. 768-779 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9472).

研究成果: 著書/レポートタイプへの貢献会議での発言

Reverse engineering
Strings
Time Constant
Preprocessing
Output
8 引用 (Scopus)

LZD factorization: Simple and practical online grammar compression with variable-to-fixed encoding

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 1 1 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (版). Springer Verlag, p. 219-230 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9133).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Grammar
Encoding
Compression
Online Algorithms

Semi-dynamic compact index for short patterns and succinct van Emde Boas tree

Matsuoka, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (版). Springer Verlag, p. 355-366 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9133).

研究成果: 著書/レポートタイプへの貢献会議での発言

Byproducts
Time Constant
Deletion
Insertion
Integer
2014
4 引用 (Scopus)

Closed factorization

Badkobeh, G., Bannai, H., Goto, K., Tomohiro, I., Iliopoulos, C. S., Inenaga, S., Puglisi, S. J. & Sugimoto, S., 1 1 2014, Proceedings of the Prague Stringology Conference 2014, PSC 2014. Holub, J. & Zd'arek, J. (版). Prague Stringology Club, p. 162-168 7 p.

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Strings
Closed
Sturmian Words
Suffix
3 引用 (Scopus)

Computing Abelian covers and Abelian runs

Matsuda, S., Inenaga, S., Bannai, H. & Takeda, M., 2014, Proceedings of the Prague Stringology Conference 2014, PSC 2014. Prague Stringology Club, p. 43-51 9 p.

研究成果: 著書/レポートタイプへの貢献会議での発言

Strings
Cover
Computing
Permutation
Regularity
19 引用 (Scopus)

Computing palindromic factorizations and palindromic covers on-line

Tomohiro, I., Sugimoto, S., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2014, Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings. Springer Verlag, 巻 8486 LNCS. p. 150-161 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8486 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Prefix
Cover
Computing
Strings
7 引用 (Scopus)

Faster compact on-line Lempel-ziv factorization

Yamamoto, J., Tomohiro, I., Bannai, H., Inenaga, S. & Takeda, M., 3 1 2014, 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014. Portier, N. & Mayr, E. W. (版). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 巻 25. p. 675-686 12 p.

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
4 引用 (Scopus)

Inferring strings from Lyndon factorization

Nakashima, Y., Okabe, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2014, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 版 Springer Verlag, p. 565-576 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8635 LNCS, 番号 PART 2).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Strings
Lyndon Words
Unique factorisation
Lexicographic Order
8 引用 (Scopus)

Inferring strings from suffix trees and links on a binary alphabet

Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 1 30 2014, : : Discrete Applied Mathematics. 163, PART 3, p. 316-325 10 p.

研究成果: ジャーナルへの寄稿記事

Suffix Tree
Reverse engineering
Strings
Binary
Information retrieval
16 引用 (Scopus)

Shortest unique substrings queries in optimal time

Tsuruta, K., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2014, SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Springer Verlag, p. 503-513 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8327 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Query
Suffix Array
Linear-time Algorithm
Computational Experiments
Experiments
2013

Compressed automata for dictionary matching

Tomohiro, I., Nishimoto, T., Inenaga, S., Bannai, H. & Takeda, M., 8 13 2013, Implementation and Application of Automata - 18th International Conference, CIAA 2013, Proceedings. p. 319-330 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7982 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Glossaries
Automata
Matching Problem
Dictionary
4 引用 (Scopus)

Computing convolution on grammar-compressed text

Tanaka, T., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 8 8 2013, Proceedings - DCC 2013: 2013 Data Compression Conference. p. 451-460 10 p. 6543081. (Data Compression Conference Proceedings).

研究成果: 著書/レポートタイプへの貢献会議での発言

Convolution
Context free grammars
Fast Fourier transforms
Redundancy
1 引用 (Scopus)

Computing reversed Lempel-Ziv factorization online

Sugimoto, S., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 10 1 2013, Proceedings of the Prague Stringology Conference 2013, PSC 2013. p. 107-118 12 p. (Proceedings of the Prague Stringology Conference 2013, PSC 2013).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Computing
Computer Science
Strings
6 引用 (Scopus)

Converting SLP to LZ78 in almost linear time

Bannai, H., Gawrychowski, P., Inenaga, S. & Takeda, M., 9 24 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. p. 38-49 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7922 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Factorization
Data structures
Linear Time
Labels
Straight-line Programs
2 引用 (Scopus)

Detecting regularities on grammar-compressed strings

Tomohiro, I., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K. & Shinohara, A., 10 15 2013, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. p. 571-582 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8087 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Grammar
Strings
Regularity
Palindrome
6 引用 (Scopus)

Efficient Lyndon factorization of grammar compressed text

Tomohiro, I., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 9 24 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. p. 153-164 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7922 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Factorization
Grammar
Strings
Polynomials
7 引用 (Scopus)

Faster lyndon factorization algorithms for SLP and LZ78 compressed text

Tomohiro, I., Nakashima, Y., Inenaga, S., Bannai, H. & Takeda, M., 1 1 2013, String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Proceedings. Springer Verlag, 巻 8214 LNCS. p. 174-185 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 8214 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Factorization
Encoding
Efficient Algorithms
Strings
11 引用 (Scopus)

Fast q-gram mining on SLP compressed strings

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 1 1 2013, : : Journal of Discrete Algorithms. 18, p. 89-99 11 p.

研究成果: ジャーナルへの寄稿記事

Straight-line Programs
Mining
Strings
Data Classification
Computational Experiments

Foreword

Inenaga, S. & Martín-Vide, C., 7 4 2013, : : International Journal of Computer Mathematics. 90, 6, p. 1129-1131 3 p.

研究成果: ジャーナルへの寄稿編集

6 引用 (Scopus)

From run length encoding to LZ78 and back again

Tamakoshi, Y., Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 8 8 2013, Proceedings - DCC 2013: 2013 Data Compression Conference. p. 143-152 10 p. 6543050

研究成果: 著書/レポートタイプへの貢献会議での発言

5 引用 (Scopus)

Palindrome pattern matching

Tomohiro, I., Inenaga, S. & Takeda, M., 4 29 2013, : : Theoretical Computer Science. 483, p. 162-170 9 p.

研究成果: ジャーナルへの寄稿記事

Palindrome
Pattern matching
Pattern Matching
Strings
Matching Problem
3 引用 (Scopus)

Permuted pattern matching on multi-track strings

Katsura, T., Narisawa, K., Shinohara, A., Bannai, H. & Inenaga, S., 1 24 2013, SOFSEM 2013: Theory and Practice of Computer Science - 39th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 280-291 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7741 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Pattern matching
Pattern Matching
Strings
Suffix Tree
Multiset
2012
4 引用 (Scopus)

An efficient algorithm to test square-freeness of strings compressed by straight-line programs

Bannai, H., Gagie, T., Tomohiro, I., Inenaga, S., Landau, G. M. & Lewenstein, M., 10 15 2012, : : Information Processing Letters. 112, 19, p. 711-714 4 p.

研究成果: ジャーナルへの寄稿記事

Straight-line Programs
Efficient Algorithms
Strings
Square free
Arbitrary
1 引用 (Scopus)

Computing q-gram non-overlapping frequencies on SLP compressed texts

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 1 25 2012, SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. 巻 7147 LNCS. p. 301-312 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7147 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Data mining
Learning systems
Computing
Data Mining
12 引用 (Scopus)

Efficient LZ78 factorization of grammar compressed text

Bannai, H., Inenaga, S. & Takeda, M., 10 22 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. p. 86-98 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7608 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Factorization
Grammar
Strings
Context free grammars
3 引用 (Scopus)

Finding characteristic substrings from compressed texts

Inenaga, S. & Bannai, H., 2 1 2012, : : International Journal of Foundations of Computer Science. 23, 2, p. 261-280 20 p.

研究成果: ジャーナルへの寄稿記事

Equivalence classes
Computer science
Polynomials
7 引用 (Scopus)

Speeding up q-gram mining on grammar-based compressed texts

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 7 4 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 220-231 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7354 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Grammar
Mining
Strings
Redundancy
5 引用 (Scopus)

The position heap of a trie

Nakashima, Y., I, T., Inenaga, S., Bannai, H. & Takeda, M., 10 22 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. p. 360-371 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7608 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Heap
Text Indexing
Strings
Data structures
Linear Time
2011

An anonymous authentication protocol with single-database PIR

Nakamura, T., Inenaga, S., Baba, K., Ikeda, D. & Yasuura, H., 2011, Information Security 2011 - Proceedings of the Ninth Australasian Information Security Conference, AISC 2011. 巻 116. p. 3-8 6 p.

研究成果: 著書/レポートタイプへの貢献会議での発言

Authentication
Managers
Communication

Computing longest common substring/subsequence of non-linear texts

Shimohira, K., Inenaga, S., Bannai, H. & Takeda, M., 2011, Proceedings of the Prague Stringology Conference 2011. p. 197-208 12 p.

研究成果: 著書/レポートタイプへの貢献会議での発言

Longest Common Subsequence
Computing
Directed Graph
Arc of a curve
Strings
15 引用 (Scopus)

Faster subsequence and don't-care pattern matching on compressed texts

Yamamoto, T., Bannai, H., Inenaga, S. & Takeda, M., 7 13 2011, Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings. p. 309-322 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6661 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Pattern matching
Pattern Matching
Subsequence
Straight-line Programs
Strings
9 引用 (Scopus)

Fast q-gram mining on SLP compressed strings

Goto, K., Bannai, H., Inenaga, S. & Takeda, M., 10 17 2011, String Processing and Information Retrieval - 18th International Symposium, SPIRE 2011, Proceedings. p. 278-289 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7024 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Straight-line Programs
Mining
Strings
Data Classification
Computational Experiments
4 引用 (Scopus)

Inferring strings from suffix trees and links on a binary alphabet

Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 12 1 2011, Proceedings of the Prague Stringology Conference 2011. p. 121-130 10 p. (Proceedings of the Prague Stringology Conference 2011).

研究成果: 著書/レポートタイプへの貢献会議での発言

Suffix Tree
Strings
Binary
Reverse Engineering
Vertex of a graph
Bioinformatics
Computer science
Artificial intelligence
Artificial Intelligence
Computer Science

Missing pattern discovery

Angelov, S., Inenaga, S., Kivioja, T. & Mäkinen, V., 6 1 2011, : : Journal of Discrete Algorithms. 9, 2, p. 153-165 13 p.

研究成果: ジャーナルへの寄稿記事

Pattern Discovery
Genes
Experiments
Genome
Experiment
4 引用 (Scopus)

Palindrome pattern matching

Tomohiro, I., Inenaga, S. & Takeda, M., 7 13 2011, Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Proceedings. p. 232-245 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6661 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Palindrome
Pattern matching
Pattern Matching
Strings
Matching Problem

Password based anonymous authentication with private information retrieval

Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., 4 1 2011, : : Journal of Digital Information Management. 9, 2, p. 72-78 7 p.

研究成果: ジャーナルへの寄稿記事

Information retrieval
information retrieval
Authentication
service provider
Private information

Preface

Dediu, A. H., Inenaga, S. & Martín-Vide, C., 1 1 2011, : : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6638 LNCS, p. 1-21 21 p.

研究成果: ジャーナルへの寄稿編集

10 引用 (Scopus)

Verifying and enumerating parameterized border arrays

Tomohiro, I., Inenaga, S., Bannai, H. & Takeda, M., 11 25 2011, : : Theoretical Computer Science. 412, 50, p. 6959-6981 23 p.

研究成果: ジャーナルへの寄稿記事

Pattern matching
Pattern Matching
Matching Problem
Linear-time Algorithm
Binary
2010

An identifiable yet unlinkable authentication system with smart cards for multiple services

Nakamura, T., Inenaga, S., Ikeda, D., Baba, K. & Yasuura, H., 5 20 2010, Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4 版 p. 236-251 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6019 LNCS, 番号 PART 4).

研究成果: 著書/レポートタイプへの貢献会議での発言

Smart cards
Smart Card
Authentication
Data storage equipment
Hash functions