![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Ei Ando
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j5]Ei Ando
, Shuji Kijima
:
An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes. Theor. Comput. Sci. 833: 87-106 (2020)
2010 – 2019
- 2019
- [c9]Ei Ando
, Shoichi Tsuchiya
:
The Volume of a Crosspolytope Truncated by a Halfspace. TAMC 2019: 13-27 - [i2]Ei Ando:
The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length. CoRR abs/1910.09791 (2019) - 2017
- [c8]Ei Ando, Shuji Kijima
:
An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes. COCOON 2017: 13-24 - [c7]Ei Ando:
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths. WALCOM 2017: 421-432 - 2016
- [j4]Ei Ando, Shuji Kijima
:
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution. Algorithmica 76(4): 1245-1263 (2016) - [i1]Ei Ando, Shuji Kijima:
An FPTAS for the Volume of a V-polytope - It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes. CoRR abs/1607.06173 (2016) - 2014
- [j3]Ei Ando:
#P-hardness of Computing High Order Derivative and Its Logarithm. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1382-1384 (2014) - [c6]Ei Ando, Shuji Kijima
:
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral. ISAAC 2014: 376-386 - 2011
- [c5]Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi:
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. ICTAC 2011: 45-61 - 2010
- [j2]Ei Ando, Hirotaka Ono
, Kunihiko Sadakane
, Masafumi Yamashita:
The Space Complexity of Leader Election in Anonymous Networks. Int. J. Found. Comput. Sci. 21(3): 427-440 (2010)
2000 – 2009
- 2009
- [j1]Ei Ando, Toshio Nakata, Masafumi Yamashita:
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. J. Discrete Algorithms 7(4): 420-438 (2009) - [c4]Ei Ando, Hirotaka Ono
, Masafumi Yamashita:
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. SAGA 2009: 89-103 - [c3]Ei Ando, Hirotaka Ono
, Kunihiko Sadakane
, Masafumi Yamashita:
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC 2009: 98-107 - 2008
- [c2]Ei Ando, Hirotaka Ono
, Kunihiko Sadakane
, Masafumi Yamashita:
The space complexity of the leader election in anonymous networks. IPDPS 2008: 1-8 - 2002
- [c1]Ei Ando, Masafumi Yamashita, Toshio Nakata, Yusuke Matsunaga:
The statistical longest path problem and its application to delay analysis of logical circuits. Timing Issues in the Specification and Synthesis of Digital Systems 2002: 134-139
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint