The University of Tokyo · Graduate School of Arts and Sciences・College of Arts and Sciences · 助教

Research keywordsconvex geometries・combinatorics・shortest vector problem・lattice algorithms・posets・greedy algorithms

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

• Extremality of submodular functions.
• Estimation of the Success Probability of Random Sampling by the Gram-Charlier Approximation.
• Higher-Order Rank Functions on Directed Graphs.
• Matroid representation of clique complexes

• 格子篩と格子点列挙を組み合わせた高速な格子基底簡約アルゴリズムの構築
• ブロッキング型及びアンチブロッキング型整数多面体の類似性についての研究
• 最短ベクトル問題における新しいsieving計算の手法の開発

• Official profile
• ORCID