default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKei Uchizawa
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Kei Uchizawa, Haruki Abe:
Trade-Offs Between Energy and Depth of Neural Networks. Neural Comput. 36(8): 1541-1567 (2024)- [c22]Jayalal Sarma, Kei Uchizawa
:
Energy and Output Patterns in Boolean Circuits. TAMC 2024: 185-196 - 2023
- [j18]Mitsunori Ogiwara, Kei Uchizawa:
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions. Theory Comput. Syst. 67(3): 569-591 (2023) - [c21]Kei Uchizawa, Haruki Abe:
Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy. MFCS 2023: 85:1-85:15 - 2022
- [j17]Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka:
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. 105-D(3): 503-507 (2022) - [i5]Mitsunori Ogihara, Kei Uchizawa:
A Theory for Discrete-time Boolean Finite Dynamical Systems with Uncertainty. CoRR abs/2211.07923 (2022) - 2021
- [j16]Kei Uchizawa:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1093 (2021) - [j15]Muneki Yasuda, Kei Uchizawa:
A Generalization of Spatial Monte Carlo Integration. Neural Comput. 33(4): 1037-1062 (2021) - [i4]Kei Uchizawa, Haruki Abe:
Circuit Complexity of Visual Search. CoRR abs/2107.00223 (2021) - 2020
- [c20]Kei Uchizawa:
Size, Depth and Energy of Threshold Circuits Computing Parity Function. ISAAC 2020: 54:1-54:13 - [c19]Mitsunori Ogihara, Kei Uchizawa:
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions. MFCS 2020: 76:1-76:13 - [i3]Muneki Yasuda, Kei Uchizawa:
A Generalization of Spatial Monte Carlo Integration. CoRR abs/2009.02165 (2020)
2010 – 2019
- 2019
- [j14]Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa:
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. Theor. Comput. Sci. 762: 25-40 (2019) - 2018
- [j13]Hiroki Maniwa, Takayuki Oki, Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Computational Power of Threshold Circuits of Energy at most Two. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1431-1439 (2018) - 2017
- [j12]Mitsunori Ogihara, Kei Uchizawa:
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs. Inf. Comput. 256: 226-236 (2017) - [j11]Akira Suzuki, Masashi Kiyomi, Yota Otachi, Kei Uchizawa, Takeaki Uno:
Hitori Numbers. J. Inf. Process. 25: 695-707 (2017) - [c18]Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa:
Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems. MFCS 2017: 8:1-8:13 - 2016
- [j10]Kei Uchizawa, Daiki Yashima, Xiao Zhou:
Threshold Circuits Detecting Global Patterns in Two-dimensional Maps. J. Graph Algorithms Appl. 20(1): 115-131 (2016) - 2015
- [j9]Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Swapping labeled tokens on graphs. Theor. Comput. Sci. 586: 81-94 (2015) - [c17]Kei Uchizawa, Eiji Takimoto:
Lower Bounds for Linear Decision Trees with Bounded Weights. SOFSEM 2015: 412-422 - [c16]Mitsunori Ogihara, Kei Uchizawa:
Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems. TAMC 2015: 87-98 - [c15]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Competitive Diffusion on Weighted Graphs. WADS 2015: 422-433 - [c14]Kei Uchizawa, Daiki Yashima, Xiao Zhou:
Threshold Circuits for Global Patterns in 2-Dimensional Maps. WALCOM 2015: 306-316 - 2014
- [j8]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized rainbow connectivity of graphs. Theor. Comput. Sci. 555: 35-42 (2014) - [c13]Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Swapping Labeled Tokens on Graphs. FUN 2014: 364-375 - [i2]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR abs/1412.3334 (2014) - 2013
- [j7]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Algorithmica 67(2): 161-179 (2013) - [j6]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Computing mod Functions. Int. J. Found. Comput. Sci. 24(1): 15-30 (2013) - [j5]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy and fan-in of logic circuits computing symmetric Boolean functions. Theor. Comput. Sci. 505: 74-80 (2013) - [c12]Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi, Xiao Zhou:
Complexity of Counting Output Patterns of Logic Circuits. CATS 2013: 37-43 - [c11]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. TAMC 2013: 248-259 - [c10]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized Rainbow Connectivity of Graphs. WALCOM 2013: 233-244 - 2012
- [c9]Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Hitori Number. FUN 2012: 334-345 - 2011
- [j4]Kei Uchizawa, Eiji Takimoto, Takao Nishizeki:
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions. Theor. Comput. Sci. 412(8-10): 773-782 (2011) - [c8]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy-Efficient Threshold Circuits Computing Mod Functions. CATS 2011: 105-110 - [c7]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. COCOON 2011: 86-97 - [c6]Kei Uchizawa, Eiji Takimoto:
Lower Bounds for Linear Decision Trees via an Energy Complexity Argument. MFCS 2011: 568-579 - [c5]Akira Suzuki, Kei Uchizawa, Xiao Zhou:
Energy and Fan-In of Threshold Circuits Computing Mod Functions. TAMC 2011: 154-163 - 2010
- [j3]Kei Uchizawa, Takao Nishizeki, Eiji Takimoto:
Energy and depth of threshold circuits. Theor. Comput. Sci. 411(44-46): 3938-3946 (2010)
2000 – 2009
- 2009
- [c4]Kei Uchizawa, Takao Nishizeki, Eiji Takimoto:
Energy Complexity and Depth of Threshold Circuits. FCT 2009: 335-345 - [c3]Kei Uchizawa, Takao Nishizeki, Eiji Takimoto:
Size and Energy of Threshold Circuits Computing Mod Functions. MFCS 2009: 724-735 - 2008
- [j2]Kei Uchizawa, Eiji Takimoto:
Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity. Theor. Comput. Sci. 407(1-3): 474-487 (2008) - 2007
- [c2]Kei Uchizawa, Eiji Takimoto:
An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity. CCC 2007: 169-178 - 2006
- [j1]Kei Uchizawa, Rodney J. Douglas, Wolfgang Maass:
On the Computational Power of Threshold Circuits with Sparse Activity. Neural Comput. 18(12): 2994-3008 (2006) - [c1]Kei Uchizawa, Rodney J. Douglas, Wolfgang Maass:
Energy Complexity and Entropy of Threshold Circuits. ICALP (1) 2006: 631-642 - [i1]Wolfgang Maass, Kei Uchizawa, Rodney J. Douglas:
Energy Complexity and Entropy of Threshold Circuits. Electron. Colloquium Comput. Complex. TR06 (2006)
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-11-27 20:30 CET 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:
