default search action
Miki Tanaka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Johannes Åman Pohjola, Magnus O. Myreen, Miki Tanaka:
A Hoare Logic for Diverging Programs. Arch. Formal Proofs 2023 (2023) - [c17]Ryota Iijima, Miki Tanaka, Sayaka Shiota, Hitoshi Kiya:
Enhanced Security against Adversarial Examples Using a Random Ensemble of Encrypted Vision Transformer Models. GCCE 2023: 948-951 - [c16]Johannes Åman Pohjola
, Hira Taqdees Syeda
Pancake: Verified Systems Programming Made Sweeter. PLOS@SOSP 2023: 1-9 - [i7]Ryota Iijima, Miki Tanaka, Sayaka Shiota, Hitoshi Kiya:
Enhanced Security against Adversarial Examples Using a Random Ensemble of Encrypted Vision Transformer Models. CoRR abs/2307.13985 (2023) - 2022
- [c15]Shoko Niwa, Miki Tanaka, Hitoshi Kiya:
A Detection Method of Temporally Operated Videos Using Robust Hashing. GCCE 2022: 144-147 - [c14]Miki Tanaka, Isao Echizen, Hitoshi Kiya:
On the Transferability of Adversarial Examples between Encrypted Models. ISPACS 2022: 1-4 - [i6]Shoko Niwa, Miki Tanaka, Hitoshi Kiya:
A Detection Method of Temporally Operated Videos Using Robust Hashing. CoRR abs/2208.05198 (2022) - [i5]Miki Tanaka, Isao Echizen, Hitoshi Kiya:
On the Transferability of Adversarial Examples between Encrypted Models. CoRR abs/2209.02997 (2022) - [i4]Ryota Iijima, Miki Tanaka, Isao Echizen, Hitoshi Kiya:
On the Adversarial Transferability of ConvMixer Models. CoRR abs/2209.08724 (2022) - 2021
- [j5]Miki Tanaka, Sayaka Shiota, Hitoshi Kiya:
A Detection Method of Operated Fake-Images Using Robust Hashing. J. Imaging 7(8): 134 (2021) - [c13]Miki Tanaka, Sayaka Shiota, Hitoshi Kiya:
A universal detector of CNN-generated images using properties of checkerboard artifacts in the frequency domain. GCCE 2021: 103-106 - [c12]Miki Tanaka, Hitoshi Kiya:
Fake-image detection with Robust Hashing. LifeTech 2021: 40-43 - [i3]Miki Tanaka, Hitoshi Kiya:
Fake-image detection with Robust Hashing. CoRR abs/2102.01313 (2021) - [i2]Miki Tanaka, Sayaka Shiota, Hitoshi Kiya:
A universal detector of CNN-generated images using properties of checkerboard artifacts in the frequency domain. CoRR abs/2108.01892 (2021) - 2020
- [c11]Yoshisato Yokoyama, Miki Tanaka, Koji Tanaka, Masao Morimoto, Makoto Yabuuchi, Yuichiro Ishii, Shinji Tanaka:
A 29.2 Mb/mm2 Ultra High Density SRAM Macro using 7nm FinFET Technology with Dual-Edge Driven Wordline/Bitline and Write/Read-Assist Circuit. VLSI Circuits 2020: 1-2 - [i1]Takayuki Osakabe, Miki Tanaka, Yuma Kinoshita, Hitoshi Kiya:
CycleGAN without checkerboard artifacts for counter-forensics of fake-image detection. CoRR abs/2012.00287 (2020)
2010 – 2019
- 2018
- [j4]Makoto Yabuuchi
A 28-nm 1R1W Two-Port 8T SRAM Macro With Screening Circuitry Against Read Disturbance and Wordline Coupling Noise Failures. IEEE Trans. Very Large Scale Integr. Syst. 26(11): 2335-2344 (2018) - 2016
- [c10]Makoto Yabuuchi, Yohei Sawada, Toshiaki Sano, Yuichiro Ishii, Shinji Tanaka, Miki Tanaka, Koji Nii:
A 6.05-Mb/mm2 16-nm FinFET double pumping 1W1R 2-port SRAM with 313 ps read access time. VLSI Circuits 2016: 1-2 - 2015
- [c9]Yoshisato Yokoyama, Yuichiro Ishii, Toshihiro Inada, Koji Tanaka, Miki Tanaka, Yoshiki Tsujihashi, Koji Nii:
A cost effective test screening method on 40-nm 4-Mb embedded SRAM for low-power MCU. A-SSCC 2015: 1-4 - [c8]Yasumasa Tsukamoto, Masao Morimoto, Makoto Yabuuchi, Miki Tanaka, Koji Nii:
1.8 Mbit/mm2 ternary-CAM macro with 484 ps search access time in 16 nm Fin-FET bulk CMOS technology. VLSIC 2015: 274- - 2014
- [c7]Makoto Yabuuchi, Yasumasa Tsukamoto, Masao Morimoto, Miki Tanaka, Koji Nii:
13.3 20nm High-density single-port and dual-port SRAMs with wordline-voltage-adjustment system for read/write assists. ISSCC 2014: 234-235 - 2013
- [c6]Makoto Yabuuchi, Hidehiro Fujiwara, Yasumasa Tsukamoto, Miki Tanaka, Shinji Tanaka, Koji Nii:
A 28nm high density 1R/1W 8T-SRAM macro with screening circuitry against read disturb failure. CICC 2013: 1-4
2000 – 2009
- 2008
- [j3]John Power, Miki Tanaka:
Category Theoretic Semantics for Typed Binding Signatures with Recursion. Fundam. Informaticae 84(2): 221-240 (2008) - 2007
- [c5]Reynald Affeldt
Formal Proof of Provable Security by Game-Playing in a Proof Assistant. ProvSec 2007: 151-168 - 2006
- [j2]Miki Tanaka, John Power
Pseudo-distributive laws and axiomatics for variable binding. High. Order Symb. Comput. 19(2-3): 305-337 (2006) - [j1]Miki Tanaka, John Power
A Unified Category-theoretic Semantics for Binding Signatures in Substructural Logics. J. Log. Comput. 16(1): 5-25 (2006) - [c4]John Power
Axiomatics for Data Refinement in Call by Value Programming Languages. MFCSIT 2006: 281-302 - 2005
- [c3]Miki Tanaka, John Power
A unified category-theoretic formulation of typed binding signatures. MERLIN 2005: 13-24 - [c2]John Power
Binding Signatures for Generic Contexts. TLCA 2005: 308-323 - 2000
- [c1]Miki Tanaka:
Abstract Syntax and Variable Binding for Linear Binders. MFCS 2000: 670-679
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 22:47 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: