activity
20132023
most citedA Preferential Attachment Paradox: How Preferential Attachment Combines with Growth to Produce Networks with Log-normal In-degree Distributions

43 citations · 43 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2018

Succinct Oblivious RAM

Taku Onodera, Tetsuo Shibuya

Reducing the database space overhead is critical in big-data processing. In this paper, we revisit oblivious RAM (ORAM) using big-data standard for the database space overhead. ORA…

cs.DS2013

Detecting Superbubbles in Assembly Graphs

Taku Onodera, Kunihiko Sadakane, Tetsuo Shibuya

We introduce a new concept of a subgraph class called a superbubble for analyzing assembly graphs, and propose an efficient algorithm for detecting it. Most assembly algorithms uti…