Ando Ei 安藤映

… Alternative Names

安藤映アンドウエイ

ANDO Ei 安藤映

Less

Researcher Number	20583511
Other IDs
Affiliation (Current)	2022: 専修大学, ネットワーク情報学部, 准教授
Affiliation (based on the past Project Information) *help	2019 – 2021: 専修大学, ネットワーク情報学部, 准教授 2013 – 2016: 崇城大学, 情報学部, 助教 2010 – 2011: 崇城大学, 情報学部, 助教
Review Section/Research Field	Principal Investigator Fundamental theory of informatics / Mathematical informatics / Basic Section 60010:Theory of informatics-related Except Principal Investigator Science and Engineering
Keywords	Principal Investigator #P-困難問題 / 完全多項式時間近似スキーム / FPTAS / 近似アルゴリズム / グラフ最適化問題 / ブロードキャスト時間 / 確率的な通信時間 / 確率分布計算 / 確率的な枝長さ / 最短路問題 … More / 確率的な通信時 / 高次元多面体体積 / n次元多面体体積 / n次元多面体の体積 / 高次元多面体 / #P-困難性 / 体積の計算 / アルゴリズム設計 / 体積 / 幾何双対性 / 計算複雑さの理論 … More Except Principal Investigator 計算困難さの解析 / 計算困難さの相転移 / 解空間の構造 / 解の数え上げ問題 / 制約式充足可能性問題 / 平均時間計算量 / ＳＯＳ法 / 解空間の離散体積計算問題 / 回路設計問題 / 計算限界の確定 / 解空間の構造解析 / 情報理論的解析 / 平均時計算量解析 / 限定計算における計算限界 / 強指数時間仮説 / 確率分布解析 / 劣線形領域計算 / 充足解探索 / 解の一意化 / 平均時計算複雑さ / 伝搬系アルゴリズム / 充足可能性問題 / 統計力学的解析 / 計算論的解析 / 制約解探索問題 / 最尤解探索問題 Less

Complexity of computing high dimensional volumes focusing on geometric dualityPrincipal Investigator
- Principal Investigator
  
  安藤映
- Project Period (FY)
  2019 – 2022
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Senshu University
Efficient approximation algorithm design using function approximationPrincipal Investigator
- Principal Investigator
  
  ANDO Ei
- Project Period (FY)
  2015 – 2016
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Mathematical informatics
- Research Institution
  Sojo University
Exploring the Limits of Computation from the Statistical Physics
- Principal Investigator
  
  Watanabe Osamu
- Project Period (FY)
  2012 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
- Review Section
  
  Science and Engineering
- Research Institution
  Tokyo Institute of Technology
A research about efficient algorithms for analyzing the networks with random weightsPrincipal Investigator
- Principal Investigator
  
  ANDO Ei
- Project Period (FY)
  2010 – 2011
- Research Category
  
  Grant-in-Aid for Research Activity Start-up
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Sojo University

All 2021 2019 2017 2016 2015 2014 2012 2011 2010 Other

All Journal Article Presentation

[Journal Article] The Volume of a Crosspolytope Truncated by a Halfspace2019
- Author(s)
  Ando Ei, Tsuchiya Shoichi
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 11436 Pages: 13-27
- DOI
  10.1007/978-3-030-14812-6_2
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19K11832
[Journal Article] An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths2017
- Author(s)
  E. Ando
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: LNCS 10167 Pages: 421-432
- DOI
  10.1007/978-3-319-53925-6_33
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PLANNED-24106008, KAKENHI-PROJECT-15K15945
[Journal Article] An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convol2016
- Author(s)
  E. Ando and S. Kijima
- Journal Title
  
  Algorithmica
  
  Volume: online Pages: 1245-1263
- DOI
  10.1007/s00453-015-0096-5
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PLANNED-24106008, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-15K15945
[Journal Article] \#P-hardness of computing high order derivative and its logarithm2014
- Author(s)
  Ei Ando
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: Vol. E97-A( NO.6)
- NAID
  130004770868
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106008
[Journal Article] <i>#P</i>-hardness of Computing High Order Derivative and Its Logarithm2014
- Author(s)
  Ei Ando
- Journal Title
  
  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  
  Volume: E97-A(6) Issue: 6 Pages: 1382-1384
- DOI
  10.1587/transfun.e97.a.1382
  10.1587/transfun.E97.A.1382
- NAID
  130004770868
- ISSN
  0916-8508, 1745-1337
- Language
  English
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106008
[Journal Article] An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution integral2014
- Author(s)
  E. Ando, S. Kijima
- Journal Title
  
  Proc. of the 25th International Symposium on Algorithms and Computation
  
  Volume: 8889 Pages: 376-386
- DOI
  10.1007/978-3-319-13075-0_30
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106005, KAKENHI-PLANNED-24106008
[Presentation] 木幅の小さなDAGがランダムな枝長さを持つ場合の最長路長さ分布関数の計算2021
- Author(s)
  安藤映
- Organizer
  コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-19K11832
[Presentation] The Volume of a Crosspolytope Truncated by a Halfspace2019
- Author(s)
  Ando Ei, Tsuchiya Shoichi
- Organizer
  15th Annual Conference on Theory and Applications of Models of Computation TAMC２０１９
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-19K11832
[Presentation] 幾何双対ナップサック多面体の体積のためのFPTAS2016
- Author(s)
  安藤映, 来嶋秀治
- Organizer
  アルゴリズム研究会
- Place of Presentation
  電気通信大学(東京都調布市)
- Year and Date
  2016-03-06
- Data Source
  KAKENHI-PROJECT-15K15945
[Presentation] Logging with maximum length constraint2016
- Author(s)
  E. Ando, A. Kawamura, M. Kiyomi, E. Miyano and H. Ono
- Organizer
  The 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC2016)
- Place of Presentation
  函館
- Year and Date
  2016-08-30
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106008
[Presentation] 幾何双対ナップサック多面体の体積のためのFPTAS2016
- Author(s)
  安藤映, 来嶋秀治
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  電気通信大学
- Year and Date
  2016-03-06
- Data Source
  KAKENHI-PLANNED-24106008
[Presentation] 負パラメータを含む制約つきナップサック多面体の体積に関する考察2015
- Author(s)
  安藤映
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  九州大学
- Year and Date
  2015-09-28
- Data Source
  KAKENHI-PLANNED-24106008
[Presentation] 幾何双対ナップサック多面体の体積に対するFPTAS2015
- Author(s)
  安藤　映
- Organizer
  情報系Winter Festa
- Place of Presentation
  一橋講堂(東京都千代田区)
- Year and Date
  2015-12-22
- Data Source
  KAKENHI-PROJECT-15K15945
[Presentation] An FPTAS for the volume computation of multiply constrained 0-1 knapsack polytopes based on approximate convolution2015
- Author(s)
  E. Ando and S. Kijima
- Organizer
  The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
- Place of Presentation
  九州大学
- Year and Date
  2015-06-02
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106008
[Presentation] Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graph with Small Treewidth2012
- Author(s)
  E. Ando and J. Peters
- Organizer
  EICE Technical Report COMP2011-50
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] Approximating the Stochastic Shortest Path Length Between Two Vertices2012
- Author(s)
  E. Ando and J. Peters
- Organizer
  アルゴリズム研究会
- Place of Presentation
  流通科学大学
- Year and Date
  2012-01-28
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] 指数分布に従う枝長さと小さな木幅を持つ無向グラフ上での二点間の最短路長さ分布の計算方法2012
- Author(s)
  安藤映, Joseph Peters
- Organizer
  コンピュテーション研究会
- Place of Presentation
  東京大学
- Year and Date
  2012-03-16
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] 確率的な枝重み付き無向グラフ上の二点間最短路長さ分布の近似計算手法2012
- Author(s)
  安藤映, Joseph Peters
- Organizer
  アルゴリズム研究会
- Place of Presentation
  流通科学大学
- Year and Date
  2012-01-28
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] Computing the Shortest Path Length Distribution Between Two Vertices in Graphs with Random Edge Lengths2011
- Author(s)
  E. Ando and J. Peters
- Organizer
  2011年度LAシンポジウム
- Place of Presentation
  静岡県西湖市
- Year and Date
  2011-07-21
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] 確率的な通信時間を持つネットワークにおけるブロードキャスト時間の計算手法2011
- Author(s)
  安藤映
- Organizer
  アルゴリズム研究会(情報処理学会)
- Place of Presentation
  琉球大学
- Year and Date
  2011-03-07
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] Computing the Broadcast Time Distribution Function in Networks with Stochastic Transmission Time2011
- Author(s)
  Ei Ando, Joseph Peters
- Organizer
  AAAC2011
- Place of Presentation
  清華大学(台湾)
- Year and Date
  2011-04-17
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] 確率的な枝長さを持つ無向グラフにおける最短路長さの分布関数計算2011
- Author(s)
  安藤映, Joseph Peters
- Organizer
  2011年度夏のLAシンポジウム
- Place of Presentation
  ザヴィラ浜名湖(静岡県西湖市)
- Year and Date
  2011-07-21
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] Computing the Broadcast Time Distribution Function in Networks with Stochastic Transmission Time2011
- Author(s)
  E. Ando and J. Peters
- Organizer
  4th Annual Meeting of the Asian Association for Algorithms and Computation(AAAC 2011)
- Place of Presentation
  Hsinchu, Taiwan
- Year and Date
  2011-04-11
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] An Algorithm for Computing the Broadcast Time in Networks with Stochastic Transmission Time2011
- Author(s)
  E. Ando and J. Peters
- Organizer
  アルゴリズム研究会
- Place of Presentation
  琉球大学
- Year and Date
  2011-03-07
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] Combinatorial Approaches for Estimating Distribution Functions in Stochastic Optimization2010
- Author(s)
  安藤映
- Organizer
  京都賞サテライトワークショップ
- Place of Presentation
  東京工業大学
- Year and Date
  2010-11-17
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] 確率的な通信時間を持つネットワーク上でのブロードキャスト時間計算2010
- Author(s)
  安藤映
- Organizer
  アルゴリズム研究会(情報処理学会)
- Place of Presentation
  函館工業高等専門学校
- Year and Date
  2010-09-22
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] Computing the Broadcast Time in Networks with Stochastic Transmission Time2010
- Author(s)
  E. Ando and J. Peters
- Organizer
  アルゴリズム研究会
- Year and Date
  2010-09-22
- Data Source
  KAKENHI-PROJECT-22800076
[Presentation] 解析的な関数の高次導関数値計算の困難さについて
- Author(s)
  安藤映
- Organizer
  2013年度夏のLAシンポジウム
- Place of Presentation
  福岡，日本
- Data Source
  KAKENHI-PLANNED-24106008
[Presentation] Approximating the minimum spanning tree weight distribution function in treewidth k graph using taylor polynomials
- Author(s)
  Ei Ando
- Organizer
  The 6th Annual Meeting of Asian Association for Algorithms and Computation
- Place of Presentation
  松島，日本
- Data Source
  KAKENHI-PLANNED-24106008

1. Watanabe Osamu (80158617)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
2. KABASHIMA Yoshiyuki (80260652)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
3. HUKUSHIMA Koji (80282606)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
4. 伊東利哉 (20184674)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
5. 小柴健史 (60400800)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
6. 山本真基 (50432414)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
7. 森立平 (60732857)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
8. Krzakala Florent

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. Zdeborova Lenka

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
10. Zhou Haijun

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
11. KIJIMA Shuji

# of Collaborated Projects: 0 results

# of Collaborated Products: 2 results

Ando Ei 安藤 映

安藤 映 アンドウ エイ

ANDO Ei 安藤 映

Research Projects

Research Products

Co-Researchers

Complexity of computing high dimensional volumes focusing on geometric dualityPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Efficient approximation algorithm design using function approximationPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Exploring the Limits of Computation from the Statistical Physics

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

A research about efficient algorithms for analyzing the networks with random weightsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] The Volume of a Crosspolytope Truncated by a Halfspace2019

Author(s)

Journal Title

DOI

Data Source

[Journal Article] An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths2017

Author(s)

Journal Title

DOI

Data Source

[Journal Article] An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convol2016

Author(s)

Journal Title

DOI

Data Source

[Journal Article] \#P-hardness of computing high order derivative and its logarithm2014

Author(s)

Journal Title

NAID

Data Source

[Journal Article] <i>#P</i>-hardness of Computing High Order Derivative and Its Logarithm2014

Author(s)

Journal Title

DOI

NAID

ISSN

Language

Data Source

[Journal Article] An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution integral2014

Author(s)

Journal Title

DOI

Data Source

[Presentation] 木幅の小さなDAGがランダムな枝長さを持つ場合の最長路長さ分布関数の計算2021

Author(s)

Organizer

Data Source

[Presentation] The Volume of a Crosspolytope Truncated by a Halfspace2019

Author(s)

Organizer

Data Source

[Presentation] 幾何双対ナップサック多面体の体積のためのFPTAS2016

Author(s)

Organizer

Place of Presentation

Year and Date

Data Source

[Presentation] Logging with maximum length constraint2016

Author(s)

Organizer

Ando Ei 安藤映

安藤映アンドウエイ

ANDO Ei 安藤映