default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroaki Yamamoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Hiroshi Fujiwara, Keiji Hirao, Hiroaki Yamamoto:
Best Possible Algorithms for One-Way Trading with Only the Maximum Fluctuation Ratio Available. IEICE Trans. Inf. Syst. 107(3): 278-285 (2024)- 2023
- [j27]Hiroshi Fujiwara, Masaya Kawaguchi, Daiki Takizawa, Hiroaki Yamamoto:
Optimal Online Bin Packing Algorithms for Some Cases with Two Item Sizes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1100-1110 (2023) - [j26]Yosuke Obe, Hiroaki Yamamoto, Hiroshi Fujiwara:
Parallelization on a Minimal Substring Search Algorithm for Regular Expressions. IEICE Trans. Inf. Syst. 106(5): 952-958 (2023) - [c20]Yuichi Ozaki, Sousuke Kanamoto, Hiroaki Yamamoto, Kenichi Kourai:
Reliable and Accurate Fault Detection with GPGPUs and LLVM. CLOUD 2023: 540-546 - 2022
- [j25]Hiroshi Fujiwara, Kanaho Hanji, Hiroaki Yamamoto:
Online Removable Knapsack Problem for Integer-Sized Unweighted Items. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1195-1202 (2022) - [j24]Hiroaki Yamamoto, Ryosuke Oda, Yoshihiro Wachi, Hiroshi Fujiwara:
Substring Searchable Symmetric Encryption Based on an Improved DAWG. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(12): 1578-1590 (2022) - [j23]Hiroshi Fujiwara, Yuichi Shirai, Hiroaki Yamamoto:
The Huffman Tree Problem with Upper-Bounded Linear Functions. IEICE Trans. Inf. Syst. 105-D(3): 474-480 (2022) - 2021
- [j22]Hiroshi Fujiwara, Ryota Adachi, Hiroaki Yamamoto:
Algorithm NextFit for the Bin Packing ProblemThis work was supported by JSPS KAKENHI Grant Numbers JP20K11689, JP20K11676, JP16K00033, JP17K00013, JP20K11808, and JP17K00183. Formaliz. Math. 29(3): 141-151 (2021) - [j21]Hiroshi Fujiwara, Ken Endo, Hiroaki Yamamoto:
Analysis of Lower Bounds for Online Bin Packing with Two Item Sizes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1127-1133 (2021) - [j20]Hiroshi Fujiwara, Yuta Wanikawa, Hiroaki Yamamoto:
Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms. IEICE Trans. Inf. Syst. 104-D(3): 362-369 (2021) - [j19]Hiroaki Yamamoto, Hiroshi Fujiwara:
A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions. IEICE Trans. Inf. Syst. 104-D(3): 381-388 (2021) - 2020
- [j18]Hiroshi Fujiwara, Hokuto Watari, Hiroaki Yamamoto:
Dynamic Programming for the Subset Sum Problem. Formaliz. Math. 28(1): 89-92 (2020) - [j17]Hiroshi Fujiwara, Kei Shibusawa, Kouki Yamamoto, Hiroaki Yamamoto:
Bounds for the Multislope Ski-Rental Problem. IEICE Trans. Inf. Syst. 103-D(3): 481-488 (2020) - [c19]Kanaho Hanji, Hiroshi Fujiwara, Hiroaki Yamamoto:
Online Removable Knapsack Problems for Integer-Sized Items. TAMC 2020: 82-93
2010 – 2019
- 2019
- [j16]Hiroaki Yamamoto:
A faster algorithm for finding shortest substring matches of a regular expression. Inf. Process. Lett. 143: 56-60 (2019) - [j15]Norikazu Takahashi
, Daiki Hirata, Shuji Jimbo, Hiroaki Yamamoto:
Band-restricted diagonally dominant matrices: Computational complexity and application. J. Comput. Syst. Sci. 101: 100-111 (2019) - [c18]Yuichi Ozaki, Sousuke Kanamoto, Hiroaki Yamamoto, Kenichi Kourai:
Detecting System Failures with GPUs and LLVM. APSys 2019: 47-53 - [c17]Hiroaki Yamamoto, Yoshihiro Wachi, Hiroshi Fujiwara:
Space-Efficient and Secure Substring Searchable Symmetric Encryption Using an Improved DAWG. ProvSec 2019: 130-148 - 2017
- [c16]Takashi Miyazaki, Yusuke Ohira, Hiroaki Yamamoto, Masaaki Nishi:
Teaching Materials Using AR and VR for Learning the Usage of Oscilloscope. AVR (2) 2017: 43-52 - [c15]Ryuji Miyoshi, Hiroaki Yamamoto, Hiroshi Fujiwara, Takashi Miyazaki:
Practical and Secure Searchable Symmetric Encryption with a Small Index. NordSec 2017: 53-69 - 2016
- [c14]Hiroaki Yamamoto:
Secure Automata-Based Substring Search Scheme on Encrypted Data. IWSEC 2016: 111-131 - 2014
- [c13]Hiroaki Yamamoto:
A new finite automaton construction for regular expressions. NCMA 2014: 249-264
2000 – 2009
- 2009
- [c12]Hiroaki Yamamoto, Daichi Takenouchi:
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees. WADS 2009: 554-565 - 2008
- [c11]Keiichiro Shirai, Masanori Wakabayashi, Masayuki Okamoto, Hiroaki Yamamoto:
A Study for High Performance Character Extraction from Color Scene Images. Document Analysis Systems 2008: 293-298 - 2007
- [j14]Hiroaki Yamamoto, Takashi Miyazaki, Masayuki Okamoto:
Bit-Parallel Algorithms for Translating Regular Expressions into NFAs. IEICE Trans. Inf. Syst. 90-D(2): 418-427 (2007) - [c10]Hideaki Yokota, Akio Yamamoto, Hiroaki Yamamoto, Toshiro Higuchi:
Producing Softness Sensation on an Electrostatic Texture Display for Rendering Diverse Tactile Feelings. WHC 2007: 584-585 - 2006
- [j13]Akio Yamamoto, Hiroaki Yamamoto, Benjamin Cros, Hironori Hashimoto, Toshiro Higuchi:
Thermal Tactile Presentation Based on Prediction of Contact Temperature. J. Robotics Mechatronics 18(3): 226-234 (2006) - [j12]Akio Yamamoto, Shuichi Nagasawa, Hiroaki Yamamoto, Toshiro Higuchi:
Electrostatic Tactile Display with Thin Film Slider and Its Application to Tactile Telepresentation Systems. IEEE Trans. Vis. Comput. Graph. 12(2): 168-177 (2006) - 2005
- [j11]Simon M. Lucas, Alex Panaretos, Luis Sosa, Anthony Tang, Shirley Wong, Robert Young, Kazuki Ashida, Hiroki Nagai, Masayuki Okamoto, Hiroaki Yamamoto, Hidetoshi Miyao, JunMin Zhu, WuWen Ou, Christian Wolf, Jean-Michel Jolion, Leon Todoran, Marcel Worring, Xiaofan Lin:
ICDAR 2003 robust reading competitions: entries, results, and future directions. Int. J. Document Anal. Recognit. 7(2-3): 105-122 (2005) - [j10]Hiroaki Yamamoto:
New finite automata corresponding to semiextended regular expressions. Syst. Comput. Jpn. 36(10): 54-61 (2005) - 2004
- [c9]Akio Yamamoto, Shuichi Nagasawa, Hiroaki Yamamoto, Toshiro Higuchi:
Electrostatic tactile display with thin film slider and its application to tactile tele-presentation systems. VRST 2004: 209-216 - 2003
- [c8]Hiroaki Yamamoto, Takashi Miyazaki:
A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions. COCOON 2003: 222-231 - [c7]Hiroaki Yamamoto:
A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem. ISAAC 2003: 158-167 - 2001
- [j9]Satoshi Tanaka, Tomoharu Nakamura, Miharu Ueda, Hiroaki Yamamoto, Kisou Shino:
Application of the stochastic sampling method to various implicit surfaces. Comput. Graph. 25(3): 441-448 (2001) - [j8]Satoshi Tanaka, Akihiro Shibata, Hiroaki Yamamoto, Hisakiyo Kotsuru:
Generalized Stochastic Sampling Method for Visualization and Investigation of Implicit Surfaces. Comput. Graph. Forum 20(3): 359-367 (2001) - [c6]Hiroaki Yamamoto:
A New Recognition Algorithm for Extended Regular Expressions. ISAAC 2001: 257-267 - 2000
- [j7]Satoshi Tanaka, Akio Morisaki, Satoru Nakata, Yasushi Fukuda, Hiroaki Yamamoto:
Sampling implicit surfaces based on stochastic differential equations with converging constraint. Comput. Graph. 24(3): 419-431 (2000) - [j6]Satoshi Tanaka, Yasushi Fukuda, Hiroaki Yamamoto:
Stochastic algorithm for detecting intersection of implicit surfaces. Comput. Graph. 24(4): 523-528 (2000) - [j5]Hideo Kasuga, Hiroaki Yamamoto, Masayuki Okamoto:
Color quantization using the fast K-means algorithm. Syst. Comput. Jpn. 31(8): 33-40 (2000) - [c5]Hiroaki Yamamoto:
On the Power of Input-Synchronized Alternating Finite Automata. COCOON 2000: 457-466 - [c4]Hideo Kasuga, Masayuki Okamoto, Hiroaki Yamamoto:
Extraction of characters from color documents. Document Recognition and Retrieval 2000: 278-285 - [c3]Hiroaki Yamamoto:
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions. MFCS 2000: 699-708
1990 – 1999
- 1998
- [c2]Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto:
Optimal Broadcasting in Almost Trees and Partial k-trees. STACS 1998: 432-443 - 1997
- [j4]Hiroaki Yamamoto:
On the Power of Alternation on Reversal-Bounded Alternating Turing Machines with a Restriction. Theor. Comput. Sci. 180(1-2): 139-154 (1997) - 1993
- [c1]Hiroaki Yamamoto:
Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines. ICALP 1993: 203-214 - 1991
- [j3]Hiroaki Yamamoto:
Note on the efficiency of methods to generate quasi-random sequences. Syst. Comput. Jpn. 22(2): 25-33 (1991)
1980 – 1989
- 1987
- [j2]Hiroaki Yamamoto, Shoichi Noguchi:
Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMs. Inf. Comput. 75(2): 144-161 (1987) - 1985
- [j1]Hiroaki Yamamoto, Shoichi Noguchi:
Relationships between time-leaf-and-space bounded ATMS and reversal-and-space bounded NTMs. Syst. Comput. Jpn. 16(2): 20-28 (1985)
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-25 05:49 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:
