Senshu University · Faculty of Network and Information · 准教授

Research keywordsstochastic graph optimization・longest path distribution・knapsack polytope volume・leader election・high-order derivative complexity・anonymous networks

This is a public-data preview. Personalized fit, contact angles, and saved workflows require sign-in.

• An FPTAS for the Volume of Some ${\mathcal V}$-polytopes ---It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes2020 · Theoretical Computer Science
• An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths2017 · Lecture Notes in Computer Science, Springer
• An FPTAS for the Volume of Some V-polytope ---It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes2017 · Lecture Notes in Computer Science, Springer
• An FPTAS for The Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution2016 · Algorithmica, Springer

• 2019/04～2022/03 高次元多面体の体積計算アルゴリズムを幾何双対性から検討する 基盤研究(C)2019 · 研究課題・受託研究・科研費
• 高次元多面体の体積計算アルゴリズムを幾何双対性から検討する2019
• n次元多面体の幾何双対生徒体積の計算困難性の関連に関する研究2018
• 関数近似を応用した高速近似アルゴリズム2015

• Official profile