default search action
Kengo Nakamura 0001
Person information
- affiliation: NTT Corporation, Kyoto, Japan
- affiliation (former): University of Tokyo, Graduate School of Information Science and Technology, Japan
Other persons with the same name
- Kengo Nakamura 0002 — University of Electro-Communications, Department of Informatics, Japan
- Kengo Nakamura 0003 — Tokyo University of Science, Graduate School of Science and Technology, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Masaaki Nishino, Kengo Nakamura, Norihito Yasuda:
Understanding the Impact of Introducing Constraints at Inference Time on Generalization Error. ICML 2024 - [c16]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
- [c15]Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
Exact and Efficient Network Reliability Evaluation per Outage Scale. ICC 2023: 4564-4570 - [c14]Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability Measure. INFOCOM 2023: 1-10 - [c13]Kengo Nakamura, Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato:
CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints. SEA 2023: 11:1-11:20 - 2022
- [c12]Ryoma Onaka, Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda, Shinsaku Sakaue:
Exact and Scalable Network Reliability Evaluation for Probabilistic Correlated Failures. GLOBECOM 2022: 5547-5552 - [c11]Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda:
Impact of Link Availability Uncertainty on Network Reliability: Analyses with Variances. ICC 2022: 2713-2719 - [c10]Masaaki Nishino, Kengo Nakamura, Norihito Yasuda:
Generalization Analysis on Learning with a Concurrent Verifier. NeurIPS 2022 - [i3]Masaaki Nishino, Kengo Nakamura, Norihito Yasuda:
Generalization Analysis on Learning with a Concurrent Verifier. CoRR abs/2210.05331 (2022) - 2021
- [c9]Kengo Nakamura, Takeru Inoue, Masaaki Nishino, Norihito Yasuda:
Efficient Network Reliability Evaluation for Client-Server Model. GLOBECOM 2021: 1-6 - [c8]Masaaki Nishino, Norihito Yasuda, Kengo Nakamura:
Compressing Exact Cover Problems with Zero-suppressed Binary Decision Diagrams. IJCAI 2021: 1996-2004 - [c7]Shinsaku Sakaue, Kengo Nakamura:
Differentiable Equilibrium Computation with Decision Diagrams for Stackelberg Models of Combinatorial Congestion Games. NeurIPS 2021: 9416-9428 - [i2]Shinsaku Sakaue, Kengo Nakamura:
Differentiable Equilibrium Computation with Decision Diagrams for Stackelberg Models of Combinatorial Congestion Games. CoRR abs/2110.01773 (2021) - 2020
- [c6]Kengo Nakamura, Shinsaku Sakaue, Norihito Yasuda:
Practical Frank-Wolfe Method with Decision Diagrams for Computing Wardrop Equilibrium of Combinatorial Congestion Games. AAAI 2020: 2200-2209 - [c5]Kengo Nakamura
, Shuhei Denzumi
Variable Shift SDD: A More Succinct Sentential Decision Diagram. SEA 2020: 22:1-22:13 - [i1]Kengo Nakamura, Shuhei Denzumi, Masaaki Nishino:
Variable Shift SDD: A More Succinct Sentential Decision Diagram. CoRR abs/2004.02502 (2020)
2010 – 2019
- 2019
- [j1]Kengo Nakamura
Space-Efficient Fully Dynamic DFS in Undirected Graphs. Algorithms 12(3): 52 (2019) - [c4]Naoki Kobayashi, Tsutomu Hirao, Kengo Nakamura, Hidetaka Kamigaito, Manabu Okumura, Masaaki Nagata:
Split or Merge: Which is Better for Unsupervised RST Parsing? EMNLP/IJCNLP (1) 2019: 5796-5801 - [c3]Kotaro Matsuda, Shuhei Denzumi, Kengo Nakamura, Masaaki Nishino, Norihito Yasuda:
Approximated ZDD Construction Considering Inclusion Relations of Models. SEA² 2019: 265-282 - 2017
- [c2]Kengo Nakamura:
Fully Dynamic Connectivity Oracles under General Vertex Updates. ISAAC 2017: 59:1-59:12 - [c1]Kengo Nakamura, Kunihiko Sadakane
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs. WALCOM 2017: 295-307
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-12-05 21:38 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: