The following pages link to Jun Kawahara (Q346254):
Displaying 33 items.
- Better bounds for online \(k\)-frame throughput maximization in network switches (Q346256) (← links)
- (Q456066) (redirect page) (← links)
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068) (← links)
- (Q496021) (redirect page) (← links)
- An improved lower bound for one-dimensional online unit clustering (Q496022) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- Implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration (Q782183) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- Finding all solutions and instances of Numberlink and Slitherlink by ZDDs (Q1736507) (← links)
- Evaluation of hotspot cluster detection using spatial scan statistic based on exact counting (Q2329882) (← links)
- DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- Effect of Bitcoin fee on transaction-confirmation process (Q2423290) (← links)
- Scattering attenuation of elastic waves due to low-contrast inclusions (Q2441005) (← links)
- Optimal Buffer Management for 2-Frame Throughput Maximization (Q2868651) (← links)
- Better Bounds for Online k-Frame Throughput Maximization in Network Switches (Q2872086) (← links)
- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems (Q2896376) (← links)
- Tight Analysis of Priority Queuing for Egress Traffic (Q2942419) (← links)
- Generating All Patterns of Graph Partitions Within a Disparity Bound (Q2980904) (← links)
- The Time Complexity of the Token Swapping Problem and Its Parallel Variants (Q2980932) (← links)
- Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
- The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (Q4622770) (← links)
- Shared-Memory Parallel Frontier-Based Search (Q4914446) (← links)
- (Q5140733) (← links)
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces (Q5443387) (← links)
- Finite-State Online Algorithms and Their Automated Competitive Analysis (Q5459103) (← links)
- Sorting balls and water: equivalence and computational complexity (Q6050130) (← links)
- ZDD-based algorithmic framework for solving shortest reconfiguration problems (Q6057258) (← links)
- Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs (Q6091158) (← links)
- Reallocation problems with minimum completion time (Q6113854) (← links)
- Decomposing a Graph into Unigraphs (Q6317509) (← links)
- Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration (Q6329368) (← links)
- Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams (Q6487604) (← links)