default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKotaro Matsuda
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c9]Hiroki Ikeuchi, Hiroshi Saito, Kotaro Matsuda:
Optimal Partial Observation for Estimating Network Connectivity. ACC 2022: 40-47- [c8]Kotaro Matsuda, Hiroki Ikeuchi, Yousuke Takahashi, Tsuyoshi Toyono:
Reconstruction of Human Trajectories Based on Anonymous Sensor Data for Estimating Infection Route. GLOBECOM 2022: 1996-2001 - [c7]Akio Watanabe, Yousuke Takahashi, Hiroki Ikeuchi, Kotaro Matsuda:
Grammar-Based Process Model Representation for Probabilistic Conformance Checking. ICPM 2022: 88-95 - [c6]Hiroki Ikeuchi, Hiroshi Saito, Kotaro Matsuda:
Network Tomography based on Adaptive Measurements in Probabilistic Routing. INFOCOM 2022: 2148-2157 - 2021
- [j3]Kotaro Matsuda, Shuhei Denzumi
, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. Algorithms 14(6): 172 (2021) - [c5]Hiroki Ikeuchi, Hiroshi Saito, Kotaro Matsuda:
UAV Surveillance Optimization for Networks in Disaster-Stricken Areas. DRCN 2021: 1-8 - [c4]Hiroki Ikeuchi, Yosuke Takahashi, Kotaro Matsuda, Tsuyoshi Toyono:
Recovery Process Visualization based on Automaton Construction. IM 2021: 10-18 - 2020
- [j2]Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan:
A linear-space data structure for range-LCP queries in poly-logarithmic time. Theor. Comput. Sci. 822: 15-22 (2020) - [c3]Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, Masakazu Tateshita:
Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP. CPM 2020: 23:1-23:13 - [c2]Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. SEA 2020: 6:1-6:13 - [i1]Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. CoRR abs/2004.04586 (2020)
2010 – 2019
- 2019
- [j1]Kotaro Matsuda, Atsushi Takayasu, Tsuyoshi Takagi:
Explicit Relation between Low-Dimensional LLL-Reduced Bases and Shortest Vectors. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1091-1100 (2019) - [c1]Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, Norihito Yasuda:
Approximated ZDD Construction Considering Inclusion Relations of Models. SEA² 2019: 265-282
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
