Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Ju-Sung Kang
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
A Note on Parameters of Random Substitutions by .GAMMA.-Diagonal Matrices
2010
Ju-Sung Kang
+
An Analysis of Privacy and Accuracy for Privacy-Preserving Techniques by Matrix-based Randomization
2008
Ju-Sung Kang
A-Ron An
Dowon Hong
+
PDF
Chat
New Public-Key Cryptosystem Using Braid Groups
2000
Ki Hyoung Ko
Sangjin Lee
Jung Hee Cheon
Jae Woo Han
Ju-Sung Kang
ChoonâSik Park
+
ON THE WEAK INVARIANCE PRINCIPLE FOR RANGES OF RECURRENT RANDOM WALKS WITH INFINITE VARIANCE
1997
Ju-Sung Kang
In-Suk Wee
Common Coauthors
Coauthor
Papers Together
Dowon Hong
1
Jung Hee Cheon
1
Ki Hyoung Ko
1
In-Suk Wee
1
A-Ron An
1
ChoonâSik Park
1
Sangjin Lee
1
Jae Woo Han
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
PDF
Chat
Local times for a class of Markoff processes
1964
Edward S. Boylan
1
+
A Public-Key Cryptosystem Based on the Word Problem
2007
Neal R. Wagner
Marianne R. Magyarik
1
+
PDF
Chat
A property of Brownian motion paths
1958
H. F. Trotter
1
+
Centralisers in the braid group and singular braid monoid
1996
Roger Fenn
Dale Rolfsen
Jun Zhu
1
+
Braids, Links, and Mapping Class Groups
1974
Joan S. Birman
1
+
Word Processing in Groups
1992
D. B. A. Epstein
1
+
A note on the weak invariance principle for local times
1997
Ju Sung Kang
In-Suk Wee
1
+
Band-generator presentation for the 4-braid group
1997
Eun Sook Kang
Ki Hyoung Ko
Sangjin Lee
1
+
PDF
Chat
The set of minimal braids is co-NP-complete
1991
Mike Paterson
Alexander Razborov
1
+
On the Asymptotic Behavior of Local Times of Recurrent Random Walks with Finite Variance
1982
A. N. Borodin
1
+
PDF
Chat
Deriving private information from randomized data
2005
Zhengli Huang
Wenliang Du
Biao Chen
1
+
The complexity of Grigorchuk groups with application to cryptography
1991
Max GarzĂłn
Yechezkel Zalcstein
1
+
PDF
Chat
ALGORITHMS FOR POSITIVE BRAIDS
1994
E. A. Elrifai
H. R. Morton
1
+
PDF
Chat
The law of the iterated logarithm for local time of a LĂŠvy process
1992
In-Suk Wee
1
+
PDF
Chat
The Range of Stable Random Walks
1991
JeanâFrançois Le Gall
Jay Rosen
1
+
A Fast Method for Comparing Braids
1997
Patrick Dehornoy
1
+
FRAPP: a framework for high-accuracy privacy-preserving mining
2008
Shipra Agrawal
Jayant R. Haritsa
B. Aditya Prakash
1
+
A New Approach to the Word and Conjugacy Problems in the Braid Groups
1998
Joan S. Birman
Ki Hyoung Ko
Sangjin Lee
1
+
PDF
Chat
A Framework for High-Accuracy Privacy-Preserving Mining
2005
Surbhi Agrawal
Jayant R. Haritsa
1
+
PDF
Chat
Random projection-based multiplicative data perturbation for privacy preserving distributed data mining
2006
Kun Liu
H. Kargupta
Jessica Ryan
1
+
PDF
Chat
On the privacy preserving properties of random data perturbation techniques
2004
H. Kargupta
Souptik Datta
Q. Wang
Krishnamoorthy Sivakumar
1
+
Theory of Braids
1947
Emil Artin
1
+
Braids, Links, and Mapping Class Groups. (AM-82)
1975
Joan S. Birman
1
+
Enumerative Combinatorics
1997
Richard P. Stanley
GianâCarlo Rota
1
+
Extensions of Lipschitz mappings into a Hilbert space
1984
William B. Johnson
Joram Lindenstrauss
1
+
From the Post-Markov Theorem Through Decision Problems to Public-Key Cryptography
1993
Iris Anshel
Michael Anshel
1
+
Enumerative Combinatorics
1986
Richard P. Stanley
1