Sung Kwon Kim

According to our database1, Sung Kwon Kim authored at least 51 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Enumerating Subsequences of a Sequence and Paths of a Tree in the Order of Weight.
J. Comput. Sci. Eng., 2019

2016
Improvement of collaborative filtering using rating normalization.
Multim. Tools Appl., 2016

An algorithm for movie classification and recommendation using genre correlation.
Multim. Tools Appl., 2016

2015
Algorithm for the Length-Constrained Maximum-Density Path Problem in a Tree with Uniform Edge Lengths.
IEICE Trans. Inf. Syst., 2015

2014
An auxiliary recommendation system for repetitively purchasing items in E-commerce.
Proceedings of the International Conference on Big Data and Smart Computing, BIGCOMP 2014, 2014

2013
A hybrid user authentication protocol for mobile IPTV service.
Multim. Tools Appl., 2013

Performance improvement of hybrid tag anti-collision protocol for radio frequency identification systems.
Int. J. Commun. Syst., 2013

Linear-Time Algorithm for the Length-Constrained Heaviest Path Problem in a Tree with Uniform Edge Lengths.
IEICE Trans. Inf. Syst., 2013

2011
Optimal Algorithms for Finding the Longest Path with Length and Sum Constraints in a Tree.
IEICE Trans. Inf. Syst., 2011

Securing against brute-force attack: A hash-based RFID mutual authentication protocol using a secret value.
Comput. Commun., 2011

An Enhanced Anti-collision Algorithm for EPC Gen2 RFID System.
Proceedings of the 5th FTRA International Conference on Multimedia and Ubiquitous Engineering, 2011

Hash-Based RFID Tag Mutual Authentication Scheme with Retrieval Efficiency.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2011

2010
Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a Tree.
IEICE Trans. Inf. Syst., 2010

Optimal Online and Offline Algorithms for Finding Longest and Shortest Subsequences with Length and Sum Constraints.
IEICE Trans. Inf. Syst., 2010

2009
Protecting Your Privacy with a Mobile Agent Device in RFID Environment.
Wirel. Pers. Commun., 2009

Path Maximum Query and Path Maximum Sum Query in a Tree.
IEICE Trans. Inf. Syst., 2009

2008
Enhanced Yoking Proof Protocols for RFID Tags and Tag Groups.
Proceedings of the 22nd International Conference on Advanced Information Networking and Applications, 2008

2007
eMARP: Enhanced Mobile Agent for RFID Privacy Protection and Forgery Detection.
Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, 2007

Forward Secure Privacy Protection Scheme for RFID System Using Advanced Encryption Standard.
Proceedings of the Frontiers of High Performance Computing and Networking ISPA 2007 Workshops, 2007

Hybrid Tag Anti-collision Algorithms in RFID Systems.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

An Analysis of RFID Tag Authentication Protocols Using Secret Value.
Proceedings of the Future Generation Communication and Networking, 2007

MarSelHR: A Haplotype Reconstruction System Using Linkage Disequilibrium.
Proceedings of the Frontiers in the Convergence of Bioscience and Information Technologies 2007, 2007

2006
MARP: Mobile Agent for RFID Privacy Protection.
Proceedings of the Smart Card Research and Advanced Applications, 2006

2005
Finding a longest nonnegative path in a constant degree tree.
Inf. Process. Lett., 2005

A New Scheme for the Location Information Protection in Mobile Communication Environments.
Proceedings of the Computer Network Security, 2005

Scalable and Flexible Privacy Protection Scheme for RFID Systems.
Proceedings of the Security and Privacy in Ad-hoc and Sensor Networks, 2005

2004
Order-preserving, upward drawing of binary trees using fewer bends.
Discret. Appl. Math., 2004

New Approach for Secure and Efficient Metering in the Web Advertising.
Proceedings of the Computational Science and Its Applications, 2004

2003
Linear-time algorithm for finding a maximum-density segment of a sequence.
Inf. Process. Lett., 2003

2001
Computing the Optimal Bridge between Two Polygons.
Theory Comput. Syst., 2001

Labeling a Rectilinear Map with Sliding Labels.
Int. J. Comput. Geom. Appl., 2001

2000
Placing two disks in a convex polygon.
Inf. Process. Lett., 2000

Area-efficient algorithms for straight-line tree drawings.
Comput. Geom., 2000

Efficient Algorithms for Two-Center Problems for a Convex Polygon.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1998
Constant-Time RMESH Algorithms for the Range Minima and Co-Minima Problems.
Parallel Comput., 1998

Algorithms for Drawing Binary Trees in the Plane.
Inf. Process. Lett., 1998

Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Two-Center Problems for a Convex Polygon (Extended Abstract).
Proceedings of the Algorithms, 1998

1997
Rectangulating Rectilinear Polygons in Parallel.
Parallel Comput., 1997

Logarithmic Width, Linear Area Upward Drawing of AVL Trees.
Inf. Process. Lett., 1997

An efficient parallel algorithm for the planar mincut linear arrangement problem for trees.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Geometric collision detection and potential field based time delay planning for dual arm systems.
Proceedings of the 1997 IEEE International Conference on Robotics and Automation, 1997

1996
Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract).
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Simple algorithms for orthogonal upward drawings of binary and ternary trees.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
The Range Co-Minima Problem.
Inf. Process. Lett., 1994

1992
Parallel Computational Geometry of Rectangles.
Algorithmica, 1992

1991
Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images.
SIAM J. Discret. Math., 1991

1990
Parallel algorithms for planar dominance counting.
Parallel Comput., 1990

Parallel Algorithms for the Segment Dragging Problem.
Inf. Process. Lett., 1990

A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle.
Inf. Process. Lett., 1990

A Parallel Algorithm for Path-Min Queries in Trees.
Proceedings of the Advances in Computing and Information, 1990


  Loading...