The following pages link to Kunihiko Sadakane (Q414927):
Displaying 50 items.
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Inferring a graph from path frequency (Q427879) (← links)
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
- Rooted maximum agreement supertrees (Q818677) (← links)
- Succinct data structures for flexible text retrieval systems (Q924538) (← links)
- The hitting and cover times of Metropolis walks (Q964410) (← links)
- A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Faster network algorithms based on graph decomposition (Q1641101) (← links)
- An efficient representation of partitions of integers (Q1671023) (← links)
- Combinatorics and algorithms for low-discrepancy roundings of a real sequence (Q1770423) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Space-efficient fully dynamic DFS in undirected graphs (Q2312405) (← links)
- DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Compressed suffix trees with full functionality (Q2464333) (← links)
- Faster suffix sorting (Q2465058) (← links)
- A fast, accurate, and simple method for pricing European-Asian and saving-Asian options (Q2484002) (← links)
- Linear time algorithm for approximating a curve by a single-peaked curve (Q2492629) (← links)
- Approximating the Canadian traveller problem with online randomization (Q2663716) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- Compressed Persistent Index for Efficient Rank/Select Queries (Q2842178) (← links)
- CRAM: Compressed Random Access Memory (Q2843276) (← links)
- (Q2845521) (← links)
- Fast Relative Lempel-Ziv Self-index for Similar Sequences (Q2898004) (← links)
- (Q2921649) (← links)
- (Q2934640) (← links)
- Compressed indexes for dynamic text collections (Q2944558) (← links)
- Space-Time Trade-offs for Stack-Based Algorithms (Q2957891) (← links)
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs (Q2980917) (← links)
- (Q3044507) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- An Online Algorithm for Finding the Longest Previous Factors (Q3541131) (← links)
- THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKS (Q3569285) (← links)
- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks (Q3575247) (← links)
- Squeezing succinct data structures into entropy bounds (Q3581568) (← links)
