default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroki Morizumi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i6]Hiroki Morizumi:
Computation with Large Advice. CoRR abs/2302.06012 (2023)- [i5]Hiroki Morizumi:
An Approach to Circuit Lower Bounds via Bounded Width Circuits. CoRR abs/2305.00794 (2023) - 2021
- [j7]Hiroki Morizumi:
A Satisfiability Algorithm for Synchronous Boolean Circuits. IEICE Trans. Inf. Syst. 104-D(3): 392-393 (2021) - [c12]Hiroki Morizumi:
On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits. LATA 2021: 109-117
2010 – 2019
- 2018
- [c11]Hiroki Morizumi:
Zero-Suppression and Computation Models. IWOCA 2018: 263-272 - [i4]Hiroki Morizumi:
Some Results on the Power of Nondeterministic Computation. CoRR abs/1811.01347 (2018) - 2016
- [i3]Hiroki Morizumi:
Zero-Suppressed Computation: A New Computation Inspired by ZDDs. CoRR abs/1602.08034 (2016) - 2015
- [c10]Hiroki Morizumi:
Lower Bounds for the Size of Nondeterministic Circuits. COCOON 2015: 289-296 - [i2]Hiroki Morizumi:
Lower Bounds for the Size of Nondeterministic Circuits. CoRR abs/1504.06731 (2015) - 2014
- [c9]Hiroki Morizumi:
Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions. IFIP TCS 2014: 104-110 - 2013
- [c8]Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi, Xiao Zhou:
Complexity of Counting Output Patterns of Logic Circuits. CATS 2013: 37-43 - 2012
- [c7]Evgeny Demenkov, Alexander S. Kulikov
, Ivan Mihajlin, Hiroki Morizumi:
Computing All MOD-Functions Simultaneously. CSR 2012: 81-88 - 2011
- [j6]Hiroki Morizumi:
Improved approximation algorithms for minimum AND-circuits problem via k-set cover. Inf. Process. Lett. 111(5): 218-221 (2011) - 2010
- [j5]Hiroki Morizumi, Genki Suzuki:
Negation-Limited Inverters of Linear Size. IEICE Trans. Inf. Syst. 93-D(2): 257-262 (2010)
2000 – 2009
- 2009
- [j4]Kazuo Iwama, Hiroki Morizumi, Jun Tarui:
Negation-Limited Complexity of Parity and Inverters. Algorithmica 54(2): 256-267 (2009) - [j3]Hiroki Morizumi, Jun Tarui:
Linear-size log-depth negation-limited inverter for k-tonic binary sequences. Theor. Comput. Sci. 410(11): 1054-1060 (2009) - [j2]Hiroki Morizumi:
Limiting negations in non-deterministic circuits. Theor. Comput. Sci. 410(38-40): 3988-3994 (2009) - [c6]Hiroki Morizumi:
Limiting Negations in Formulas. ICALP (1) 2009: 701-712 - 2008
- [j1]Kazuo Iwama, Hiroki Morizumi, Jun Tarui:
Reductions for monotone Boolean circuits. Theor. Comput. Sci. 408(2-3): 208-212 (2008) - [c5]Hiroki Morizumi, Genki Suzuki:
Negation-Limited Inverters of Linear Size. ISAAC 2008: 605-614 - [i1]Hiroki Morizumi:
A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas. CoRR abs/0811.0699 (2008) - 2007
- [c4]Hiroki Morizumi, Jun Tarui:
Linear-Size Log-Depth Negation-Limited Inverter for k -Tonic Binary Sequences. TAMC 2007: 605-615 - 2006
- [c3]Kazuo Iwama, Hiroki Morizumi, Jun Tarui:
Negation-Limited Complexity of Parity and Inverters. ISAAC 2006: 223-232 - [c2]Kazuo Iwama, Hiroki Morizumi:
Reductions for Monotone Boolean Circuits. MFCS 2006: 540-548 - 2002
- [c1]Kazuo Iwama, Hiroki Morizumi:
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. MFCS 2002: 353-364
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:15 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:
