default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHisashi Mine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1985
[j14]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for the Equipollent Resource Allocation Problem. Math. Oper. Res. 10(1): 44-53 (1985)- 1984
- [j13]Hisashi Mine, Katsuhisa Ohno, Tadayoshi Shioyama:
Delay Analysis of Packet Switching System with a Satellite Having Processing Capability. IEEE Trans. Commun. 32(5): 642-644 (1984) - 1982
- [j12]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An efficient algorithm for K shortest simple paths. Networks 12(4): 411-427 (1982) - 1981
- [j11]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for the K Best Solutions of the Resource Allocation Problem. J. ACM 28(4): 752-764 (1981) - [j10]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for Finding K Minimum Spanning Trees. SIAM J. Comput. 10(2): 247-255 (1981)
1970 – 1979
- 1979
- [j9]Norberto Navarrete, Masao Fukushima, Hisashi Mine:
A New Ranking Method Based on Relative Position Estimate and Its Extensions. IEEE Trans. Syst. Man Cybern. 9(11): 681-689 (1979) - 1978
- [j8]Hiroshi Kise, Toshihide Ibaraki, Hisashi Mine:
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times. Oper. Res. 26(1): 121-126 (1978) - 1977
- [j7]Hiroaki Ishii, Toshihide Ibaraki, Hisashi Mine:
Fractional knapsack problems. Math. Program. 13(1): 255-271 (1977) - 1976
- [j6]Hisashi Mine, Katsuhisa Ohno, Takatsugu Koizumi:
Technical Note - A Single-Server Queue with Service Times Depending on the Order of Services. Oper. Res. 24(1): 188-190 (1976) - 1971
- [j5]Hisashi Mine, Katsuhisa Ohno:
An Optimal Rejection Time for an M/G/1 Queuing System. Oper. Res. 19(1): 194-207 (1971) - [j4]Tadao Takaoka, Hisashi Mine:
N-Fail-Safe Logical Systems. IEEE Trans. Computers 20(5): 536-542 (1971)
1960 – 1969
- 1968
- [j3]Hisashi Mine, Yoshihaki Koga:
Authors' Reply3. IEEE Trans. Computers 17(7): 702 (1968) - 1967
- [j2]Hisashi Mine, Yoshihaki Koga:
Basic Properties and a Construction Method for Fail-Safe Logical Systems. IEEE Trans. Electron. Comput. 16(3): 282-289 (1967)
1950 – 1959
- 1959
- [j1]Hisashi Mine:
Reliability of physical system. IRE Trans. Inf. Theory 5(5): 138-151 (1959)
Coauthor Index
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 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
