Hiroaki Yamamoto

According to our database1, Hiroaki Yamamoto authored at least 48 papers between 1985 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Best Possible Algorithms for One-Way Trading with Only the Maximum Fluctuation Ratio Available.
IEICE Trans. Inf. Syst., 2024

2023
Optimal Online Bin Packing Algorithms for Some Cases with Two Item Sizes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2023

Parallelization on a Minimal Substring Search Algorithm for Regular Expressions.
IEICE Trans. Inf. Syst., May, 2023

Reliable and Accurate Fault Detection with GPGPUs and LLVM.
Proceedings of the 16th IEEE International Conference on Cloud Computing, 2023

2022
Substring Searchable Symmetric Encryption Based on an Improved DAWG.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., December, 2022

Online Removable Knapsack Problem for Integer-Sized Unweighted Items.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

The Huffman Tree Problem with Upper-Bounded Linear Functions.
IEICE Trans. Inf. Syst., 2022

2021
A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions.
IEICE Trans. Inf. Syst., 2021

Asymptotic Approximation Ratios for Certain Classes of Online Bin Packing Algorithms.
IEICE Trans. Inf. Syst., 2021

Analysis of Lower Bounds for Online Bin Packing with Two Item Sizes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Algorithm NextFit for the Bin Packing ProblemThis work was supported by JSPS KAKENHI Grant Numbers JP20K11689, JP20K11676, JP16K00033, JP17K00013, JP20K11808, and JP17K00183.
Formaliz. Math., 2021

2020
Bounds for the Multislope Ski-Rental Problem.
IEICE Trans. Inf. Syst., 2020

Dynamic Programming for the Subset Sum Problem.
Formaliz. Math., 2020

Online Removable Knapsack Problems for Integer-Sized Items.
Proceedings of the Theory and Applications of Models of Computation, 2020

2019
Band-restricted diagonally dominant matrices: Computational complexity and application.
J. Comput. Syst. Sci., 2019

A faster algorithm for finding shortest substring matches of a regular expression.
Inf. Process. Lett., 2019

Space-Efficient and Secure Substring Searchable Symmetric Encryption Using an Improved DAWG.
Proceedings of the Provable Security, 2019

Detecting System Failures with GPUs and LLVM.
Proceedings of the 10th ACM SIGOPS Asia-Pacific Workshop on Systems, 2019

2017
Practical and Secure Searchable Symmetric Encryption with a Small Index.
Proceedings of the Secure IT Systems, 2017

Teaching Materials Using AR and VR for Learning the Usage of Oscilloscope.
Proceedings of the Augmented Reality, Virtual Reality, and Computer Graphics, 2017

2016
Secure Automata-Based Substring Search Scheme on Encrypted Data.
Proceedings of the Advances in Information and Computer Security, 2016

2014
A new finite automaton construction for regular expressions.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

2009
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008
A Study for High Performance Character Extraction from Color Scene Images.
Proceedings of the Eighth IAPR International Workshop on Document Analysis Systems, 2008

2007
Bit-Parallel Algorithms for Translating Regular Expressions into NFAs.
IEICE Trans. Inf. Syst., 2007

Producing Softness Sensation on an Electrostatic Texture Display for Rendering Diverse Tactile Feelings.
Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems, 2007

2006
Electrostatic Tactile Display with Thin Film Slider and Its Application to Tactile Telepresentation Systems.
IEEE Trans. Vis. Comput. Graph., 2006

Thermal Tactile Presentation Based on Prediction of Contact Temperature.
J. Robotics Mechatronics, 2006

2005
New finite automata corresponding to semiextended regular expressions.
Syst. Comput. Jpn., 2005

ICDAR 2003 robust reading competitions: entries, results, and future directions.
Int. J. Document Anal. Recognit., 2005

2004
Electrostatic tactile display with thin film slider and its application to tactile tele-presentation systems.
Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 2004

2003
A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2001
Generalized Stochastic Sampling Method for Visualization and Investigation of Implicit Surfaces.
Comput. Graph. Forum, 2001

Application of the stochastic sampling method to various implicit surfaces.
Comput. Graph., 2001

A New Recognition Algorithm for Extended Regular Expressions.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Color quantization using the fast K-means algorithm.
Syst. Comput. Jpn., 2000

Sampling implicit surfaces based on stochastic differential equations with converging constraint.
Comput. Graph., 2000

Stochastic algorithm for detecting intersection of implicit surfaces.
Comput. Graph., 2000

An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Extraction of characters from color documents.
Proceedings of the Document Recognition and Retrieval VII, 2000

On the Power of Input-Synchronized Alternating Finite Automata.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1998
Optimal Broadcasting in Almost Trees and Partial k-trees.
Proceedings of the STACS 98, 1998

1997
On the Power of Alternation on Reversal-Bounded Alternating Turing Machines with a Restriction.
Theor. Comput. Sci., 1997

1993
Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1991
Note on the efficiency of methods to generate quasi-random sequences.
Syst. Comput. Jpn., 1991

1987
Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMs
Inf. Comput., November, 1987

1985
Relationships between time-leaf-and-space bounded ATMS and reversal-and-space bounded NTMs.
Syst. Comput. Jpn., 1985


  Loading...