I have been involved in a number of auxiliary projects related to parallel and distributed computing. What follows is a partial list of resulting papers (all papers listed here are "Technical Report" quality and copyrighted originals should be used for all purposes over and above plain curiosity):

+ M. Martone, M. Paprzycki, S. Filippone, An Improved Sparse Matrix-Vector Multiply Based on Recursive Sparse Blocks Layout, I. Lirkov, et.al. (eds.), Large-Scale Scientific Computing, LNCS, Springer, Berlin, 2012, 606-613

+ M. Martone, S. Filippone, P. Gepner, M. Paprzycki, S. Tucci, Use of hybrid recursive CSR/COO data structures in sparse matrices-vector multiplication, Proceedings of the International Multiconference on Computer Science and Information Technology, Wisla, Poland, October 2010, 327-335

+ Michele Martone, Salvatore Filippone, Salvatore Tucci, Marcin Paprzycki, Maria Ganzha Utilizing Recursive Storage in Sparse Matrix-Vector Multiplication - Preliminary Considerations, Proceedings of the 2010 CATA Conference, ISCA Press, 2010, 300-305

+ Arpith Jacob, Sugata Sanyal, Marcin Paprzycki, Rajan Arora, Maria Ganzha, Applying SIMD Approach to Whole Genome Comparison on Commodity Hardware In: Parallel Processing and Applied Mathematics, LNCS, Springer, Berlin, 2008, 1220-1229

+ Arpith Jacob, Sugata Sanyal, Marcin Paprzycki, Rajan Arora, Maria Ganzha, Whole Genome Comparison on a Network of Workstations. In: D. Kranzmuller et.al. (eds.), Proceedings of the ISPDC 2007 Conference, IEEE CS Press, Los Alamitos, CA, 2007, 31-36

+ M. Paprzycki, P. Stpiczynski, A Brief Introduction to Parallel Computing. In: E. J. Kontoghiorghes (ed.), Handbook of Parallel Computing and Statistics, Taylor and Francis, Boca Raton, FL, 2006, 3-41

+ M. Cai, I. Jonyer, M. Paprzycki, Improving Parallelism in Structural Data Mining. In: R. Wyrzykowski, et. al. (eds.), PPAM 2005, LNCS 3911, Springer, Berlin, 2006, 455-462

+ P. Kobzdej, D. Waligóra, K. Wielebinska, M. Paprzycki, Parallel Application of Levenshtein Distance to Establish Similarity Between Strings, International Journal of Computer Research, Vo. 12, No. 4, 2003, 625-633

+ M. Chrósniak, J. Dworniczak, K. Ziarko, M. Paprzycki, The Implementation and Analysis of Parallel Algorithm for Finding Perfect Matching in the Bipartite Graphs, Annales UMCS Informatica, AI, 2004, 81-89

+ P. Sokolowski, P. Konieczka, J. Sochacki, M. Paprzycki, Parallel Implementation of the k-connectivity Test Algorithm, Annales UMCS Informatica, AI, 2004, 91-99

+ B. V. Digas, A. V. Lander, M. Paprzycki, E. L. Reznikov, Parallel Algorithms for Problems of a Medium Structure Reconstruction. In: I. I. Eremin et. al. (eds.) Proceedings of the International Conference on Distributed Systems: Optimization and Economic-Environmental Applications (DSO'2000), Ekaterniburg, Russia, 2000, 293-294

+ A. Kucaba-Pietal, M. Paprzycki, Parallel Computing for Computational Fluid Dynamics. Zeszyty Naukowe Wyzszej Szkoly Informatyki i Zarzadzania w Rzeszowie, vol. 8, no. 7, 1998, 101-108

+ M. Paprzycki, J. Zalewski, Parallel Computing in Ada: An Overview and Critique. Ada Letters, Vol. XVII, No. 2, 1997, 55-62

+ J. Zalewski, M. Paprzycki, Ada in Distributed Systems: An Overview. Ada Letters, Vol. XVII, No. 2, 1997, 67-81

+ M. Paprzycki, I. Gladwell, A Parallel Chopping Algorithm for ODE Boundary Value Problems, Parallel Computing, 19, 1993, 651-666

+ K. Bridges, M. Paprzycki, X. Li, Parallelization of a Godunov Type Method for the Solution of Systems of Conservation Laws, in: Sincovec, R.F., et.al. (eds.), Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1993, 31-34