default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNatsuhiko Futamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
[j5]Fatih Erdogan Sevilgen
, Srinivas Aluru, Natsuhiko Futamura:
Parallel algorithms for tree accumulations. J. Parallel Distributed Comput. 65(1): 85-93 (2005)- [j4]Rama Sangireddy, Natsuhiko Futamura, Srinivas Aluru, Arun K. Somani:
Scalable, memory efficient, high-speed IP lookup algorithms. IEEE/ACM Trans. Netw. 13(4): 802-812 (2005) - 2003
- [j3]Srinivas Aluru, Natsuhiko Futamura, Kishan Mehrotra:
Parallel biological sequence comparison using prefix computations. J. Parallel Distributed Comput. 63(3): 264-272 (2003) - [j2]Natsuhiko Futamura, Srinivas Aluru, Xiaoqiu Huang:
Parallel Syntenic Alignments. Parallel Process. Lett. 13(4): 689-703 (2003) - 2002
- [j1]Natsuhiko Futamura, Srinivas Aluru, Desh Ranjan, Bhanu Hariharan:
Efficient Parallel Algorithms for Solvent Accessible Surface Area of Proteins. IEEE Trans. Parallel Distributed Syst. 13(6): 544-555 (2002)
Conference and Workshop Papers
- 2004
- [c7]Gina Cooper, Michael L. Raymer, Travis E. Doom, Dan E. Krane, Natsuhiko Futamura:
Indexing Genomic Databases. BIBE 2004: 587-591 - 2003
- [c6]Natsuhiko Futamura, Rama Sangireddy, Srinivas Aluru, Arun K. Somani:
Scalable, memory efficient, high-speed lookup and update algorithms for IP routing. ICCCN 2003: 257-263 - 2002
- [c5]Natsuhiko Futamura, Srinivas Aluru, Xiaoqiu Huang:
Parallel Syntenic Alignments. HiPC 2002: 420-430 - 2000
- [c4]Fatih Erdogan Sevilgen, Natsuhiko Futamura, Srinivas Aluru:
A Provably Optimal, Distribution-Independent Parallel Fast Multipole Method. IPDPS 2000: 77-84 - 1999
- [c3]Srinivas Aluru, Desh Ranjan, Natsuhiko Futamura:
A Parallel Monte Carlo Algorithm for Protein Accessible Surface Area Computation. HiPC 1999: 339-348 - [c2]Srinivas Aluru, Natsuhiko Futamura, Kishan Mehrotra:
Parallel Biological Sequence Comparison Using Prefix Computations. IPPS/SPDP 1999: 653-659 - 1997
- [c1]Yoshihiko Futamura, Chieko Shirai, Yongmei Liu, Natsuhiko Futamura, Katsuhiko Kakehi:
Data Structure for Solving Programming Problems Concerning Segments in a Sequence. WAE 1997: 219-230
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 22:59 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:
