The following pages link to Kunihiko Sadakane (Q414927):
Displaying 50 items.
- The Balanced Edge Cover Problem (Q3596723) (← links)
- Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG (Q3630194) (← links)
- How to Design a Linear Cover Time Random Walk on a Finite Graph (Q3646121) (← links)
- Breaking a Time-and-Space Barrier in Constructing Full-Text Indices (Q3654373) (← links)
- (Q4411409) (← links)
- (Q4419004) (← links)
- (Q4425936) (← links)
- New text indexing functionalities of the compressed suffix arrays (Q4458882) (← links)
- (Q4472515) (← links)
- (Q4474085) (← links)
- (Q4505400) (← links)
- (Q4535017) (← links)
- (Q4580160) (← links)
- (Q4737696) (← links)
- Quantum Computation in Computational Geometry (Q4800313) (← links)
- Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization (Q4800324) (← links)
- (Q4808661) (← links)
- (Q4828936) (← links)
- Succinct de Bruijn Graphs (Q4916912) (← links)
- (Q5009521) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- (Q5092430) (← links)
- Canadians Should Travel Randomly (Q5167757) (← links)
- Algorithms and Computation (Q5191628) (← links)
- Algorithms and Computation (Q5191652) (← links)
- Algorithms and Computation (Q5191679) (← links)
- Practical Entropy-Compressed Rank/Select Dictionary (Q5233491) (← links)
- Succinct Trees in Practice (Q5233599) (← links)
- Faster algorithms for shortest path and network flow based on graph decomposition (Q5240369) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Reducing the Space Requirement of LZ-Index (Q5307516) (← links)
- (Q5365049) (← links)
- (Q5369534) (← links)
- (Q5417613) (← links)
- DNA Sequence Design by Dynamic Neighborhood Searches (Q5452570) (← links)
- A Probabilistic Model of the DNA Conformational Change (Q5452582) (← links)
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space (Q5458854) (← links)
- Structural Information and Communication Complexity (Q5710079) (← links)
- Algorithms and Computation (Q5712156) (← links)
- (Q5874453) (← links)
- Discrete and Computational Geometry (Q5897093) (← links)
- LATIN 2004: Theoretical Informatics (Q5901669) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5916260) (← links)
- A linear-space data structure for range-LCP queries in poly-logarithmic time (Q5918832) (← links)
- Enumerating Range Modes (Q6065431) (← links)
- Output-size sensitiveness of OBDD construction through maximal independent set problem (Q6085711) (← links)
- Special issue on algorithms and computation (ISAAC 2021) (Q6103516) (← links)
- Fully Dynamic No-Back-Edge-Traversal Forest via 2D-Range Queries (Q6173217) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Storing set families more compactly with top ZDDs (Q6487601) (← links)
