Japan Society for the Promotion of Science

output

19922026

most citedWidely-Linear Digital Self-Interference Cancellation in Direct-Conversion Full-Duplex Transceiver

287 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing cs.DSShow all

8 papers · 1 filter

cs.DS2022

Data structures for computing unique palindromes in static and non-static strings

Takuya Mieno, Mitsuru Funakoshi

A palindromic substring $T [i .. j]$ of a string $T$ is said to be a shortest unique palindromic substring (SUPS) in $T$ for an interval $[p, q]$ if $T [i .. j]$ is a shortest palindro…

cs.DS2021★ 19 cited

Sensitivity of string compressors and repetitiveness measures

Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga

The sensitivity of a string compression algorithm $C$ asks how much the output size $C (T)$ for an input string $T$ can increase when a single character edit operation is performed…

cs.DS2020

Palindromic Trees for a Sliding Window and Its Applications

Takuya Mieno, Kiichi Watanabe, Yuto Nakashima +3

The palindromic tree (a.k.a. eertree) for a string $S$ of length $n$ is a tree-like data structure that represents the set of all distinct palindromic substrings of $S$ , using $O(n…

cs.DS2019

Dynamic Path-Decomposed Tries

Shunsuke Kanda, Dominik Köppl, Yasuo Tabei +2

A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient impl…

cs.DS2019

Space-Efficient Algorithms for Computing Minimal/Shortest Unique Substrings

Takuya Mieno, Dominik Köppl, Yuto Nakashima +3

Given a string $T$ of length $n$ , a substring $u = T [i .. j]$ of $T$ is called a shortest unique substring (SUS) for an interval $[s, t]$ if (a) $u$ occurs exactly once in $T$ , (b) $u…

cs.DS2019★ 5 cited

c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches

Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda +4

Given a dynamic set $K$ of $k$ strings of total length $n$ whose characters are drawn from an alphabet of size $σ$ , a keyword dictionary is a data structure built on $K$ that provi…

cs.DS2016

Shortest unique palindromic substring queries in optimal time

Yuto Nakashima, Hiroe Inoue, Takuya Mieno +3

A palindrome is a string that reads the same forward and backward. A palindromic substring $P$ of a string $S$ is called a shortest unique palindromic substring ( $SUPS$ ) f…

cs.DS2013★ 4 cited

Linear-Time FPT Algorithms via Network Flow

Yoichi Iwata, Keigo Oka, Yuichi Yoshida

In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms)…