Shuji Kijima
Orcid: 0000-0001-6061-2330
According to our database1,
Shuji Kijima
authored at least 67 papers
between 2004 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Scalable and Fast Algorithm for Constructing Phylogenetic Trees With Application to IoT Malware Clustering.
IEEE Access, 2023
2022
Inf. Comput., 2022
CoRR, 2022
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers.
Theor. Comput. Sci., 2021
Every finite distributive lattice is isomorphic to the minimizer set of an M♮-concave set function.
Oper. Res. Lett., 2021
How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Scalable and Fast Hierarchical Clustering of IoT Malware Using Active Data Selection.
Proceedings of the Sixth International Conference on Fog and Mobile Edge Computing, 2021
2020
An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes.
Theor. Comput. Sci., 2020
2019
Any Finite Distributive Lattice is Isomorphic to the Minimizer Set of an M<sup>♮</sup>-Concave Set Function.
CoRR, 2019
A Fast Algorithm for Constructing Phylogenetic Trees with Application to IoT Malware Clustering.
Proceedings of the Neural Information Processing - 26th International Conference, 2019
2018
Theor. Comput. Sci., 2018
Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018
2017
Theor. Comput. Sci., 2017
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space.
J. ACM, 2017
Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017
An FPTAS for the Volume of Some <i>V</i> -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017
2016
An FPTAS for the Volume of a V-polytope - It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes.
CoRR, 2016
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution.
Algorithmica, 2016
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
2015
Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015
2014
Approximating the path-distance-width for AT-free graphs and graphs in related classes.
Discret. Appl. Math., 2014
Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract).
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, 2014
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014
2013
Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013
2012
On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings.
Math. Oper. Res., 2012
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits.
Discret. Math., 2012
On space complexity of self-stabilizing leader election in mediated population protocol.
Distributed Comput., 2012
Proceedings of the Distributed Computing - 26th International Symposium, 2012
Proceedings of the Distributed Computing - 26th International Symposium, 2012
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012
2011
J. Comb. Optim., 2011
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
Proceedings of the Second International Conference on Networking and Computing, 2011
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011
How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011
2010
Theor. Comput. Sci., 2010
Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010
2009
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009
2008
Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers.
SIAM J. Comput., 2008
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers.
Ann. Oper. Res., 2008
2006
Random Struct. Algorithms, 2006
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
2005
Proceedings of the 37th Winter Simulation Conference, Orlando, FL, USA, December 4-7, 2005, 2005
2004
IEICE Trans. Inf. Syst., 2004