We stand with Ukraine  

Hiroki Morizumi

According to our database1, Hiroki Morizumi authored at least 22 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An Approach to Circuit Lower Bounds via Bounded Width Circuits.
[BibTeX]
[DOI]
Hiroki Morizumi
CoRR, 2023

Computation with Large Advice.
[BibTeX]
[DOI]
Hiroki Morizumi
CoRR, 2023

2021
A Satisfiability Algorithm for Synchronous Boolean Circuits.
[BibTeX]
[DOI]
Hiroki Morizumi
IEICE Trans. Inf. Syst., 2021

On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits.
[BibTeX]
[DOI]
Hiroki Morizumi
Proceedings of the Language and Automata Theory and Applications, 2021

2018
Some Results on the Power of Nondeterministic Computation.
[BibTeX]
[DOI]
Hiroki Morizumi
CoRR, 2018

Zero-Suppression and Computation Models.
[BibTeX]
[DOI]
Hiroki Morizumi
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2016
Zero-Suppressed Computation: A New Computation Inspired by ZDDs.
[BibTeX]
[DOI]
Hiroki Morizumi
CoRR, 2016

2015
Lower Bounds for the Size of Nondeterministic Circuits.
[BibTeX]
[DOI]
Hiroki Morizumi
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions.
[BibTeX]
[DOI]
Hiroki Morizumi
Proceedings of the Theoretical Computer Science, 2014

2013
Complexity of Counting Output Patterns of Logic Circuits.
[BibTeX]
[DOI]
Kei Uchizawa
,
Zhenghong Wang
,
Hiroki Morizumi
,
Xiao Zhou
Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012
Computing All MOD-Functions Simultaneously.
[BibTeX]
[DOI]
Evgeny Demenkov
,
Alexander S. Kulikov
,
Ivan Mihajlin
,
Hiroki Morizumi
Proceedings of the Computer Science - Theory and Applications, 2012

2011
Improved approximation algorithms for minimum AND-circuits problem via k-set cover.
[BibTeX]
[DOI]
Hiroki Morizumi
Inf. Process. Lett., 2011

2010
Negation-Limited Inverters of Linear Size.
[BibTeX]
[DOI]
Hiroki Morizumi
,
Genki Suzuki
IEICE Trans. Inf. Syst., 2010

2009
Linear-size log-depth negation-limited inverter for k-tonic binary sequences.
[BibTeX]
[DOI]
Hiroki Morizumi
,
Jun Tarui
Theor. Comput. Sci., 2009

Limiting negations in non-deterministic circuits.
[BibTeX]
[DOI]
Hiroki Morizumi
Theor. Comput. Sci., 2009

Negation-Limited Complexity of Parity and Inverters.
[BibTeX]
[DOI]
Kazuo Iwama
,
Hiroki Morizumi
,
Jun Tarui
Algorithmica, 2009

Limiting Negations in Formulas.
[BibTeX]
[DOI]
Hiroki Morizumi
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Reductions for monotone Boolean circuits.
[BibTeX]
[DOI]
Kazuo Iwama
,
Hiroki Morizumi
,
Jun Tarui
Theor. Comput. Sci., 2008

A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas
[BibTeX]
[DOI]
Hiroki Morizumi
CoRR, 2008

2007
Linear-Size Log-Depth Negation-Limited Inverter for <i>k</i> -Tonic Binary Sequences.
[BibTeX]
[DOI]
Hiroki Morizumi
,
Jun Tarui
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
Reductions for Monotone Boolean Circuits.
[BibTeX]
[DOI]
Kazuo Iwama
,
Hiroki Morizumi
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2002
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits.
[BibTeX]
[DOI]
Kazuo Iwama
,
Hiroki Morizumi
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002


  Loading...