学位

• 博士（理学）(早稲田大学)

経歴

学歴

受賞

• 小野梓記念学術賞
• Onoazusa Memorial Award(Academic Award)
• 大川功賞
• Isao OKAWA Award

その他

論文

• VC-dimensions of finite automata and commutative finite automata with k letters and n states [Web of Scientce]

その他業績

• 離散構造の中の擬ランダム性（Szemerediの一様化補題、ランダムサンプリング、プロパティテスト、ラムゼー理論）
• Quasi-randomness in discrete structures (Szemeredi's regularity lemma, random samplings, property tests, Ramsey theory)
• Linear Ramsey Numbers for Bounded-Degree Hypergrahps [DOI]
• Linear Ramsey Numbers for Bounded-Degree Hypergraphs [DOI]
• グラフとその周辺におけるランダム構造の話
• Random structures around graph theory
• Dense graphs and pseudo-randomness
• Dense graphs and pseudo-randomness
• Random graphs and pseudo-random graphs I,II,III
• Vertex-disjoint cycles containing prescribed vertices [DOI] [Web of Scientce]
• An analytic study of substructures of abstract graphs
• Spanning subgraphs in dense graphs
• An analytic study of substructures of abstract graphs
• Spanning subgraphs in dense graphs
• Proof of a conjecture of Bollobas and Kohayakawa on the Erdos-Stone theorem [DOI] [Web of Scientce]
• Almost-spanning subgraphs with bounded degree in dense graphs [DOI] [Web of Scientce]
• A common extension of the Erdos-Stone theorem and the Alon-Yuster theorem for unbounded graphs [DOI] [Web of Scientce]
• An extension of a theorem on cycles containing specified independent edges [DOI] [Web of Scientce]
• 極値グラフ理論における擬確率的手法
• On the regularity lemma
• Proof of a conjecture of Bollobás and Kohayakawa on the Erdos-Stone theorem [DOI]
• A common extension of the Erdos-Stone theorem and the Alon-Yuster theorem for unbounded graphs [DOI]
• Almost-spanning subgraphs with bounded degree in dense graphs [DOI]
• The pseudo-probabilistic method in extremal graph theory
• On the regularity lemma
• Vertex-disjoint cycles of length at most four each of which contains a specified vertex [Web of Scientce]
• Subgraphs in Dense Graphs and Szemeredi's Regularity Lemma
• A modern method for a wide range of classical problems in graph theory - the pseudo-probabilistic method
• Extending Alon-Yuster's packing theorem
• Almost-spanning subgraphs in dense graphs
• Subgraphs in Dense Graphs and Szemeredi's Regularity Lemma
• A modern method for a wide range of classical problems in graph theory - the pseudo-probabilistic method
• Extending Alon-Yuster's packing theorem
• Almost-spanning subgraphs in dense graphs
• Vertex-disjoint cycles of length at most four each of which contains a specified vertex [DOI]
• How many diagonal rectangles are needed to cover an orthogonal polygon? [Web of Scientce]
• Proof of a Bollobas-Kohayakawa Conjecture on the Erdos-Stone Theorem
• How many diagonal rectangles are needed to cover an orthogonal polygon?
• Proof of a Bollobas-Kohayakawa Conjecture on the Erdos-Stone Theorem
• Vertex-disjoint cycles containing specified edges [DOI] [Web of Scientce]
• Performance comparison of recognition systems: a Bayesian approach [DOI]
• Performance comparison of recognition systems: a Bayesian approach [DOI]
• Performance comparison of recognition systems: a Bayesian approach [CiNii Research (CiNii Articles)]
• Performance comparison of recognition systems: a Bayesian approach
• VC-dimensions of finite automata and commutative finite automata with k letters and n states [Web of Scientce]
• 組み合わせ論における手法と道具
• Methods and tools in combinatorics
• VC-dimensions of finite automata and commutative finite automata with $k$ letters and $n$ states
• An extremal problem of d permutations containing every permutation of every t elements [Web of Scientce]
• The wide-diameter of the n-dimensional toroidal mesh [CiNii Research (CiNii Articles)] [DOI] [Web of Scientce]
• On circles containing the maximum number of points [Web of Scientce]
• The wide-diameter of the n-dimensional toroidal mesh [CiNii Research (CiNii Articles)] [DOI]
• An extremal problem of $d$ permutations containing every permutation of every $t$ elements
• Containment problems in high-dimensional spaces [DOI]
• 高次元空間における点と直方体の組合せ論
• Containment problems in high-dimensional spaces [DOI] [Web of Scientce]
• AN EXTREMAL PROBLEM OF ORTHANTS CONTAINING AT MOST ONE-POINT BESIDES THE ORIGIN [Web of Scientce]
• Extremal Problems and Ramsey Properties of Ball, Box or Orthant containing many points in $R^d$ - And Combinatorics of Permutations(Computational Geometry and Discrete Geometry) [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• An extremal problem of orthants containing at most one point besides the origin
• SOME ASYMPTOTIC CONDITIONS OF WORLDLINES IN MINKOWSKI SPACE [DOI] [Web of Scientce]
• The VC-dimensions of finite automata with n states
• The VC-dimensions of finite automata with n states

講演・口頭発表等

書籍等出版物

• Improvement of the Erdos-Stone Theorem
• Improvement of the Erdos-Stone Theorem

作品等

共同研究・競争的資金等の研究課題

• 離散数学・組合せ論への応用を意図したランダムネスと擬ランダムネスの理論
• 離散構造の基礎的および応用的研究
• グラフ論、離散最適化とその応用
• 組合せ論の極値的問題における確率的方法の研究
• 組合せ論の極値的問題における確率的方法の研究
• 組合せ論の極値的問題における確率的方法の研究
• 組合せ理論における極値的問題の確率的証明手法、及びそのアルゴリズム的側面の研究
• 組み合わせ論・グラフ理論における擬確率的手法。ラムゼー理論。及びその計算機科学への応用。確率・近似アルゴリズム。
• Pseudo-probabilistic methods in combinatorics and graph theory with applications to computer sciences. Ramsey theory. Probabilistic and approximation algorithms.

メディア報道

産業財産権

所属学協会

• American Mathematical Society
• 日本数学会
• American Mathematical Society

委員歴

担当経験のある科目

社会貢献活動

学術貢献活動