 2013
[1] 
Adaptive nonlocal means for multiview image denoising: searching for the right patches via a statistical approach,
E. Luo, S. H. Chan, S. Pan and T. Q. Nguyen,
IEEE International Conference on Image Processing (ICIP), 2013.

 2012
[2] 
Generalized nonlocal means for iterative denoising,
E. Luo, S. Pan and T. Q. Nguyen,
20th European Signal Processing Conference (EUSIPCO), 2012.

[3] 
Estimating multiset of Bernoulli processes,
J. Acharya, H. Das, A. Jafarpour, A. Orlitsky, and S. Pan,
IEEE International Symposium on Information Theory, 2012.

 2011
[4] 
Competitive closeness testing,
J. Acharya, H. Das, A. Jafarpour, A. Orlitsky and S. Pan,
Conference On Learning Theory, 2011.

[5] 
Algebraic calculation of maximum likelihood of small patterns,
J. Acharya, H. Das, A. Orlitsky and S. Pan,
IEEE International Symposium on Information Theory, 2011.

 2010
[6] 
Classification using pattern probability estimators,
J. Acharya, H. Das, A. Orlitsky, S. Pan and N. P. Santhanam,
IEEE International Symposium on Information Theory, 2010.

[7] 
Exact calculation of pattern probabilities,
J. Acharya, H. Das, G. H. Mohimani, A. Orlitsky and S. Pan,
IEEE International Symposium on Information Theory, 2010.

[8] 
On reconstructing a string from its substring compositions,
J. Acharya, H. Das, O. Milenkovic, A. Orlitsky and S. Pan,
IEEE International Symposium on Information Theory, 2010.

[9] 
Deterministic calculation of pattern probabilities,
J. Acharya, H. Das, G. H. Mohimani, A. Orlitsky and S. Pan,
IEEE Information Theory Worshop, Cairo, Egypt, 2010.

 2009
[10] 
The maximum likelihood probability of skewed patterns,
A. Orlitsky and S. Pan,
IEEE International Symposium on Information Theory, 2009.

[11] 
The maximum likelihood probability of uniquesingleton, ternary, and
length7 patterns,
J. Acharya, A. Orlitsky and S. Pan,
IEEE International Symposium on Information Theory, 2009.

[12] 
Recent results on pattern maximum likelihood,
J. Acharya, A. Orlitsky and S. Pan,
IEEE Information Theory Worshop, Volos, Greece, 2009.

 2007
[13] 
The crossing number of K_{11} is 100,
S. Pan and R. B. Richter,
J. Graph Theory, 56(2):128134, 2007.

[14] 
The convex hull of every optimal pseudolinear drawing of K_{n} is a
triangle,
J. Balogh, J. Leaños, S. Pan, R. B. Richter, and G. Salazar,
Australas. J. Combin., 38:155162, 2007.

 2006
[15] 
On the crossing numbers of complete graphs,
S. Pan, supervised by R. B. Richter,
Master's thesis, University of Waterloo, 2006.

