Kengo Nakamura

Orcid: 0000-0002-9615-3479

Affiliations:
  • NTT Corporation, Kyoto, Japan
  • University of Tokyo, Graduate School of Information Science and Technology, Japan (former)


According to our database1, Kengo Nakamura authored at least 17 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Single Family Algebra Operation on ZDDs Leads To Exponential Blow-Up.
CoRR, 2024

2023
CompDP: A Framework for Simultaneous Subgraph Counting Under Connectivity Constraints.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

A Fast and Exact Evaluation Algorithm for the Expected Number of Connected Nodes: an Enhanced Network Reliability Measure.
Proceedings of the IEEE INFOCOM 2023, 2023

Exact and Efficient Network Reliability Evaluation per Outage Scale.
Proceedings of the IEEE International Conference on Communications, 2023

2022
Generalization Analysis on Learning with a Concurrent Verifier.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Impact of Link Availability Uncertainty on Network Reliability: Analyses with Variances.
Proceedings of the IEEE International Conference on Communications, 2022

Exact and Scalable Network Reliability Evaluation for Probabilistic Correlated Failures.
Proceedings of the IEEE Global Communications Conference, 2022

2021
Differentiable Equilibrium Computation with Decision Diagrams for Stackelberg Models of Combinatorial Congestion Games.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Compressing Exact Cover Problems with Zero-suppressed Binary Decision Diagrams.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Efficient Network Reliability Evaluation for Client-Server Model.
Proceedings of the IEEE Global Communications Conference, 2021

2020
Variable Shift SDD: A More Succinct Sentential Decision Diagram.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Practical Frank-Wolfe Method with Decision Diagrams for Computing Wardrop Equilibrium of Combinatorial Congestion Games.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Space-Efficient Fully Dynamic DFS in Undirected Graphs.
Algorithms, 2019

Approximated ZDD Construction Considering Inclusion Relations of Models.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Split or Merge: Which is Better for Unsupervised RST Parsing?
Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, 2019

2017
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Fully Dynamic Connectivity Oracles under General Vertex Updates.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017


  Loading...