Kunihiko Sadakane

Orcid: 0000-0002-8212-3682

Affiliations:
  • Tokyo University, Japan


According to our database1, Kunihiko Sadakane authored at least 151 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs.
Int. J. Found. Comput. Sci., September, 2024

Succinct data structure for path graphs.
Inf. Comput., January, 2024

MAESTRO: Multi-party AES using Lookup Tables.
IACR Cryptol. ePrint Arch., 2024

Succinct data structures for bounded clique-width graphs.
Discret. Appl. Math., 2024

Succinct Data Structures for Baxter Permutation and Related Families.
CoRR, 2024

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

τλ-Index: Locating Rare Patterns in Similar Strings.
Proceedings of the Data Compression Conference, 2024

Succinct Data Structure for Graphs with d-Dimensional t-Representation.
Proceedings of the Data Compression Conference, 2024

2023
Succinct representation for (non)deterministic finite automata.
J. Comput. Syst. Sci., 2023

Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries.
Int. J. Comput. Geom. Appl., 2023

Shortest Beer Path Queries Based on Graph Decomposition.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Practical Implementations of Compressed RAM.
Proceedings of the Data Compression Conference, 2023

2022
Succinct navigational oracles for families of intersection graphs on a circle.
Theor. Comput. Sci., 2022

Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks.
IEICE Trans. Inf. Syst., 2022

Approximating Dynamic Weighted Vertex Cover with Soft Capacities.
Algorithmica, 2022

Space-Efficient Data Structure for Posets with Applications.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Succinct Representations of Graphs (Invited Talk).
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns.
Proceedings of the Data Compression Conference, 2022

Bi-Directional r-Indexes.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching.
Theor. Comput. Sci., 2021

Guest editors' foreword.
J. Graph Algorithms Appl., 2021

Storing Set Families More Compactly with Top ZDDs.
Algorithms, 2021

Approximating the Canadian Traveller Problem with Online Randomization.
Algorithmica, 2021

Succinct Representations for (Non)Deterministic Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2021

Succinct Data Structures for Small Clique-Width Graphs.
Proceedings of the 31st Data Compression Conference, 2021

Succinct representations of Intersection Graphs on a Circle.
Proceedings of the 31st Data Compression Conference, 2021

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Efficient query autocompletion with edit distance-based error tolerance.
VLDB J., 2020

A linear-space data structure for range-LCP queries in poly-logarithmic time.
Theor. Comput. Sci., 2020

Compact and succinct data structures for multidimensional orthogonal range searching.
Inf. Comput., 2020

Optimal In-place Algorithms for Basic Graph Problems.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Enumerating Range Modes.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
Storing Partitions of Integers in Sublinear Space.
Rev. Socionetwork Strateg., 2019

Faster algorithms for shortest path and network flow based on graph decomposition.
J. Graph Algorithms Appl., 2019

Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Space-Efficient Fully Dynamic DFS in Undirected Graphs.
Algorithms, 2019

Indexing Graph Search Trees and Applications.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
DenseZDD: A Compact and Fast Index for Families of Sets.
Algorithms, 2018

Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees.
Algorithmica, 2018

Faster Network Algorithms Based on Graph Decomposition.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Node Similarity with q -Grams for Real-World Labeled Networks.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

An Efficient Representation of Partitions of Integers.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity.
Proceedings of the Approximation, 2018

2017
Computation over Compressed Structured Data (NII Shonan Meeting 2017-15).
NII Shonan Meet. Rep., 2017

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Offline/online attribute-based encryption with verifiable outsourced decryption.
Concurr. Comput. Pract. Exp., 2017

Compression with the tudocomp Framework.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching.
Proceedings of the Similarity Search and Applications - 10th International Conference, 2017

Succinct Quadtrees for Road Data.
Proceedings of the Similarity Search and Applications - 10th International Conference, 2017

A Succinct Data Structure for Multidimensional Orthogonal Range Searching.
Proceedings of the 2017 Data Compression Conference, 2017

2016
Compressed Tree Representations.
Encyclopedia of Algorithms, 2016

Engineering Hybrid DenseZDDs.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Lempel-Ziv Computation in Compressed Space (LZ-CICS).
Proceedings of the 2016 Data Compression Conference, 2016

Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Guest Editors' foreword.
Theor. Comput. Sci., 2015

An O(m, log m)-Time Algorithm for Detecting Superbubbles.
IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Random Access to Grammar-Compressed Strings and Trees.
SIAM J. Comput., 2015

A Novel Computational Model for GPUs with Applications to Efficient Algorithms.
Int. J. Netw. Comput., 2015

MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct <i>de Bruijn</i> graph.
Bioinform., 2015

Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.
Algorithmica, 2015

Space-Time Trade-offs for Stack-Based Algorithms.
Algorithmica, 2015

Variable-Order de Bruijn Graphs.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Fast relative Lempel-Ziv self-index for similar sequences.
Theor. Comput. Sci., 2014

Fully Functional Static and Dynamic Succinct Trees.
ACM Trans. Algorithms, 2014

A Novel Computational Model for GPUs with Application to I/O Optimal Sorting Algorithms.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

Canadians Should Travel Randomly.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Compact Data structures for Big Data (NII Shonan Meeting 2013-10).
NII Shonan Meet. Rep., 2013

Efficient Error-tolerant Query Autocompletion.
Proc. VLDB Endow., 2013

Compressed Persistent Index for Efficient Rank/Select Queries.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Detecting Superbubbles in Assembly Graphs.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Fully-Online Grammar Compression.
Proceedings of the String Processing and Information Retrieval, 2013

Reconstructing <i>k</i>-Reticulated Phylogenetic Network from a Set of Gene Trees.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

2012
More efficient periodic traversal in anonymous undirected graphs.
Theor. Comput. Sci., 2012

An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Ultra-succinct representation of ordered trees with applications.
J. Comput. Syst. Sci., 2012

Faster computation of the Robinson-Foulds distance between phylogenetic networks.
Inf. Sci., 2012

Inferring a graph from path frequency.
Discret. Appl. Math., 2012

Stronger Lempel-Ziv Based Compressed Text Indexing.
Algorithmica, 2012

Succinct de Bruijn Graphs.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

CRAM: Compressed Random Access Memory.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Succinct data structures for Searchable Partial Sums with optimal worst-case performance.
Theor. Comput. Sci., 2011

Random Access to grammar-Compressed Strings.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
The hitting and cover times of Metropolis walks.
Theor. Comput. Sci., 2010

The Space Complexity of Leader Election in Anonymous Networks.
Int. J. Found. Comput. Sci., 2010

Compressed random access memory
CoRR, 2010

Linear-time protein 3-D structure searching with insertions and deletions.
Algorithms Mol. Biol., 2010

Fully-Functional Succinct Trees.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Succinct Trees in Practice.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices.
SIAM J. Comput., 2009

Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

A Linear-Time Burrows-Wheeler Transform Using Induced Sorting.
Proceedings of the String Processing and Information Retrieval, 2009

How to Design a Linear Cover Time Random Walk on a Finite Graph.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

2008
The Balanced Edge Cover Problem.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

An Online Algorithm for Finding the Longest Previous Factors.
Proceedings of the Algorithms, 2008

Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints.
Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

2007
Faster suffix sorting.
Theor. Comput. Sci., 2007

Compressed indexes for dynamic text collections.
ACM Trans. Algorithms, 2007

Compressed Suffix Trees with Full Functionality.
Theory Comput. Syst., 2007

Succinct data structures for flexible text retrieval systems.
J. Discrete Algorithms, 2007

Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs.
Inf. Media Technol., 2007

A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.
Algorithmica, 2007

Ultra-succinct representation of ordered trees.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

Practical Entropy-Compressed Rank/Select Dictionary.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006
Efficient Algorithms for Constructing a Pyramid from a Terrain.
IEICE Trans. Inf. Syst., 2006

Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve.
Algorithmica, 2006

Squeezing succinct data structures into entropy bounds.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks.
Proceedings of the Parallel and Distributed Processing and Applications, 2006

A generic search strategy for large-scale real-world networks.
Proceedings of the 1st International Conference on Scalable Information Systems, 2006

A Probabilistic Model of the DNA Conformational Change.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

DNA Sequence Design by Dynamic Neighborhood Searches.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

Reducing the Space Requirement of LZ-Index.
Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005
Combinatorics and algorithms for low-discrepancy roundings of a real sequence.
Theor. Comput. Sci., 2005

Computing the maximum agreement of phylogenetic networks.
Theor. Comput. Sci., 2005

A Fast, Accurate, and Simple Method for Pricing European-Asian and Saving-Asian Options.
Algorithmica, 2005

Rooted Maximum Agreement Supertrees.
Algorithmica, 2005

Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks.
Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005

Dynamic dictionary matching and compressed suffix trees.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Finding Short Right-Hand-on-the-Wall Walks in Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004
Neighborhood Composition: A Parallelization of Local Search Algorithms.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004

Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Compressed Index for Dynamic Text.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

A Web Page Scoring Method for Local Web Search Engines.
Proceedings of the Database Systems for Advances Applications, 2004

2003
On-line scheduling with tight deadlines.
Theor. Comput. Sci., 2003

New text indexing functionalities of the compressed suffix arrays.
J. Algorithms, 2003

Quantum Algorithms for Intersection and Proximity Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Succinct Data Structures for Searchable Partial Sums.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Constructing Compressed Suffix Arrays with Large Alphabets.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization.
Proceedings of the Geometry, 2002

Succinct representations of lcp information and improvements in the compressed suffix arrays.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Space-Efficient Data Structures for Flexible Text Retrieval Systems.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Data Compression Method Combining Properties of PPM and CTW.
Proceedings of the Progress in Discovery Science, 2002

Space-Economical Algorithms for Finding Maximal Unique Matches.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2000
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Implementing the Context Tree Weighting Method for Text Compression.
Proceedings of the Data Compression Conference, 2000

1999
Finding Meaningful Regions Containing Given Keywords from Large Text Collections.
Proceedings of the Discovery Science, 1999

A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression.
Proceedings of the Data Compression Conference, 1999

Text Retrieval by Using k-word Proximity Search.
Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE '99), 1999

1998
A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation.
Proceedings of the Advances in Database Technologies, 1998

On Optimality of Varients of the Block Sorting Compression.
Proceedings of the Data Compression Conference, 1998

A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation.
Proceedings of the Data Compression Conference, 1998

Voronoi Diagrams by Divergences with Additive Weights.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Text compression using recency rank with context and relation to context sorting, block sorting and PPM<sup>*</sup>.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1995
Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995


  Loading...