default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenji Mikawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Takashi Fuchino, Takashi Harada, Ken Tanaka, Kenji Mikawa:
Computational Complexity of Allow Rule Ordering and Its Greedy Algorithm. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1111-1118 (2023)- [j8]Kenji Mikawa, Ken Tanaka:
Efficient linear-time ranking and unranking of derangements. Inf. Process. Lett. 179: 106288 (2023) - 2020
- [j7]Takashi Harada, Ken Tanaka, Kenji Mikawa:
Simulated Annealing Method for Relaxed Optimal Rule Ordering. IEICE Trans. Inf. Syst. 103-D(3): 509-515 (2020) - [c4]Takashi Harada, Ken Tanaka, Ryohei Ogasawara, Kenji Mikawa:
A Rule Reordering Method via Pairing Dependent Rules. CNS 2020: 1-9
2010 – 2019
- 2019
- [j6]Takashi Harada, Yuki Ishikawa, Ken Tanaka, Kenji Mikawa:
A Packet Classification Method via Cascaded Circular-Run-Based Trie. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1171-1178 (2019) - [c3]Takashi Fuchino, Takashi Harada, Ken Tanaka, Kenji Mikawa:
Acceleration of Packet Classification Using Adjacency List of Rules. ICCCN 2019: 1-9 - 2018
- [c2]Takashi Harada, Ken Tanaka, Kenji Mikawa:
Acceleration of Packet Classification via Inclusive Rules. CNS 2018: 1-2 - [c1]Takashi Harada, Ken Tanaka, Kenji Mikawa:
A Heuristic Algorithm for Relaxed Optimal Rule Ordering Problem. CSNet 2018: 1-8 - 2017
- [j5]Kenji Mikawa, Ken Tanaka:
Linear-time generation of uniform random derangements encoded in cycle notation. Discret. Appl. Math. 217: 722-728 (2017) - 2015
- [j4]Kenji Mikawa, Ken Tanaka:
Run-Based Trie Involving the Structure of Arbitrary Bitmask Rules. IEICE Trans. Inf. Syst. 98-D(6): 1206-1212 (2015) - 2014
- [j3]Kenji Mikawa, Ken Tanaka:
Lexicographic ranking and unranking of derangements in cycle notation. Discret. Appl. Math. 166: 164-169 (2014) - 2013
- [j2]Ken Tanaka, Kenji Mikawa, Manabu Hikin:
A Heuristic Algorithm for Reconstructing a Packet Filter with Dependent Rules. IEICE Trans. Commun. 96-B(1): 155-162 (2013)
2000 – 2009
- 2004
- [j1]Kenji Mikawa, Ichiro Semba:
Generating derangements by interchanging at most four elements. Syst. Comput. Jpn. 35(12): 25-31 (2004)
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:57 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:
