Name
Title | ||
|---|---|---|
The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem. |
Year | Venue | DocType |
|---|---|---|
2022 | Proceedings of the VLDB Endowment | Journal |
Volume | Issue | ISSN |
15 | 7 | 2150-8097 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zemin Chao | 1 | 0 | 0.34 |
| Hong Gao | 2 | 1086 | 120.07 |
| Yinan An | 3 | 0 | 0.34 |
| Jianzhong Li | 4 | 63 | 24.23 |