H. K. Dai
Orcid: 0000-0003-4589-8400Affiliations:
- Oklahoma State University, Stillwater, OK, USA
- University of North Dakota, Grand Forks, ND, USA (former)
According to our database1,
H. K. Dai
authored at least 64 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
1
1
1
2
2
1
1
1
1
1
1
1
1
1
2
2
2
2
1
2
2
1
1
1
3
1
2
5
4
2
2
3
2
2
1
1
3
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
SN Comput. Sci., October, 2024
2023
Clustering Analyses of Two-Dimensional Space-Filling Curves: Hilbert and z-Order Curves.
SN Comput. Sci., 2023
Proceedings of the Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications, 2023
2022
Int. J. Web Inf. Syst., 2022
Proceedings of the Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications, 2022
2021
SN Comput. Sci., 2021
Proceedings of the Future Data and Security Engineering - 8th International Conference, 2021
Proceedings of the Future Data and Security Engineering - 8th International Conference, 2021
2020
Extremal Problem with Network-Diameter and -Minimum-Degree for Distributed Function Computation.
SN Comput. Sci., 2020
Lower-Bound Study for Function Computation in Distributed Networks via Vertex-Eccentricity.
SN Comput. Sci., 2020
Relating Network-Diameter and Network-Minimum-Degree for Distributed Function Computation.
Proceedings of the Future Data and Security Engineering - 7th International Conference, 2020
Proceedings of the Future Data and Security Engineering - 7th International Conference, 2020
2019
J. Comput. Syst. Sci., 2019
Int. J. Bus. Intell. Data Min., 2019
Proceedings of the Future Data and Security Engineering - 6th International Conference, 2019
Proceedings of the Future Data and Security Engineering - 6th International Conference, 2019
2018
Episode-Rule Mining with Minimal Occurrences via First Local Maximization in Confidence.
Proceedings of the Ninth International Symposium on Information and Communication Technology, 2018
Proceedings of the Future Data and Security Engineering - 5th International Conference, 2018
2017
Proceedings of the Future Data and Security Engineering - 4th International Conference, 2017
2016
Proceedings of the Computational Science and Its Applications - ICCSA 2016, 2016
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
Discret. Math., 2015
Proceedings of the Language and Automata Theory and Applications, 2015
Proceedings of the 15th International Conference on Computational Science and Its Applications, 2015
2014
Proceedings of the Algorithmic Aspects in Information and Management, 2014
2013
Data mining of serial-episode association rules using gap-constrained minimal occurrences.
Int. J. Bus. Intell. Data Min., 2013
Proceedings of the Computational Science and Its Applications - ICCSA 2013, 2013
2008
J. Supercomput., 2008
Proceedings of the First International Conference on Foundations of Informatics, 2008
2007
On Digital Watermarking via Public-Key Cryptosystems.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007
Proceedings of the Computational Science and Its Applications, 2007
Proceedings of the 16th International Conference on Computer Communications and Networks, 2007
2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
2005
On the Minimum-Cost Set-Covering Problem.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005
2004
IEEE Trans. Pattern Anal. Mach. Intell., 2004
Routing in Mobile Ad Hoc Networks Based on Block Decomposition.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004
An Empirical Study of Bounded Delay Constrained Bandwidth Routing.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Proceedings of the 7th International Symposium on Parallel Architectures, 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003
An Empirical Study of p-Norm Based Locality Measures of Space-Filling Curves.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
Approximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves.
Proceedings of the Discrete Random Walks, 2003
2002
Locality Performance of Some Mesh-indexings.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2002
Proceedings of the 16th International Conference on Pattern Recognition, 2002
2001
Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2001), 2001
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
Improving the Esau-Williams Algorithm for Designing Local Access Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000
Proceedings of the 5th International Symposium on Parallel Architectures, 2000
Proceedings of the 15th International Conference on Pattern Recognition, 2000
1999
On Structural Modification Learning Algorithms.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999
Deciding Strictly Non-Blocking Generalized-Concentration Properties with Constrained Network Parameters.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999
1997
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties.
Int. J. Found. Comput. Sci., 1997
1996
The Size Complexity of Strictly Non-blocking Fixed Ratio Concentrators with Constant Depth.
Proceedings of the Euro-Par '96 Parallel Processing, 1996
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
Warpnet: Neural Network with a Parabolic Warp.
Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995
1994
An Improvement in the Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentration Networks.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994
1993
Proceedings of the Seventh International Parallel Processing Symposium, 1993
The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties with Small Depth.
Proceedings of the Computing and Information, 1993
Size-Depth Tradeoff for Strictly Non-Blocking Generalized-Concentrators.
Proceedings of the Computing and Information, 1993