default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuhei Denzumi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato:
International Competition on Graph Counting Algorithms 2023. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(9): 1441-1451 (2024)- [c13]Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi:
Single Family Algebra Operation on BDDs and ZDDs Leads to Exponential Blow-Up. ISAAC 2024: 52:1-52:17 - [i4]Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi:
Single Family Algebra Operation on ZDDs Leads To Exponential Blow-Up. CoRR abs/2403.05074 (2024) - 2023
- [i3]Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima, Masaaki Nishino, Shuhei Denzumi, Shin-ichi Minato:
International Competition on Graph Counting Algorithms 2023. CoRR abs/2309.07381 (2023) - 2021
- [j4]Kotaro Matsuda, Shuhei Denzumi
, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. Algorithms 14(6): 172 (2021) - 2020
- [c12]Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa:
Finding the Anticover of a String. CPM 2020: 2:1-2:11 - [c11]Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. SEA 2020: 6:1-6:13 - [c10]Kengo Nakamura, Shuhei Denzumi, Masaaki Nishino:
Variable Shift SDD: A More Succinct Sentential Decision Diagram. SEA 2020: 22:1-22:13 - [i2]Kengo Nakamura, Shuhei Denzumi, Masaaki Nishino:
Variable Shift SDD: A More Succinct Sentential Decision Diagram. CoRR abs/2004.02502 (2020) - [i1]Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane:
Storing Set Families More Compactly with Top ZDDs. CoRR abs/2004.04586 (2020)
2010 – 2019
- 2019
- [c9]Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, Norihito Yasuda:
Approximated ZDD Construction Considering Inclusion Relations of Models. SEA² 2019: 265-282 - [c8]Shuhei Denzumi:
New Algorithms for Manipulating Sequence BDDs. CIAA 2019: 108-120 - 2018
- [j3]Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane:
DenseZDD: A Compact and Fast Index for Families of Sets. Algorithms 11(8): 128 (2018) - [c7]Shuhei Denzumi:
Sequence Sentential Decision Diagrams. COCOA 2018: 592-606 - 2016
- [j2]Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato:
Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations. Discret. Appl. Math. 212: 61-80 (2016) - [c6]Taito Lee, Shuhei Denzumi, Kunihiko Sadakane:
Engineering Hybrid DenseZDDs. SEA 2016: 201-216 - 2015
- [c5]Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato:
Enumerating Eulerian Trails via Hamiltonian Path Enumeration. WALCOM 2015: 161-174 - 2014
- [c4]Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato, Kunihiko Sadakane:
DenseZDD: A Compact and Fast Index for Families of Sets. SEA 2014: 187-198 - 2013
- [c3]Shuhei Denzumi, Koji Tsuda, Hiroki Arimura, Shin-ichi Minato:
Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams . Stringology 2013: 157-167 - 2012
- [j1]Ryo Yoshinaka, Jun Kawahara, Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato:
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. Inf. Process. Lett. 112(16): 636-640 (2012) - 2011
- [c2]Shuhei Denzumi, Hiroki Arimura, Shin-ichi Minato:
Implementation of sequence BDDs in Erlang. Erlang Workshop 2011: 90-91 - [c1]Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato:
Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations. Stringology 2011: 147-161
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 2025-01-20 22:57 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:
