**[C16]**- Czech, Z.J., Introduction to Parallel Computing, Cambridge University Press, Cambridge, UK, 2016, 354 pages (www.cambridge.org/Czech).
**[JCW16]**- Jastrzab, T., Czech, Z.J., Wieczorek, W., A parallel algorithm for decomposition of finite languages. International Conference on Parallel Computing (ParCo-2015), Edinburgh, Scotland, In: Joubert G.R., et al. (eds.), Advances in Parallel Computing, vol. 27, 2016, 401-410. [Postcript].
**[C13]**- Czech, Z.J., Introduction to Parallel Computing, Polish Scientific Publishers PWN, Warsaw 2013, New edition, 454 pages (in Polish).
**[BC13]**- Blocho, M., Czech, Z.J., A parallel memetic algorithm for the vehicle routing problem with time windows, 8th International Conference on P2P, Parallel, Grid and Internet Computing, October 28-30, 2013, Compiegne, France. [Pdf].
**[BC12b]**- Blocho, M., Czech, Z.J., A parallel algorithm for minimizing the number of routes in the vehicle routing problem with time windows, 9th International Conference on Parallel Processing and Applied Mathematics (PPAM 2012), Lecture Notes in Computer Science, vol. 7203, 2012, 255-265, [Pdf].
**[BC12a]**- Best solutions found by the parallel memetic algorithm for Gehring and Homberger's vehicle routing problem with time windows (VRPTW) benchmark instances [Html].
**[BC12]**- Blocho, M., Czech, Z.J., A parallel EAX-based algorithm for minimizing the number of routes in the vehicle routing problem with time windows, IEEE 14th International Conference on High Performance Computing and Communications, (HPCC-ICESS), Liverpool, UK, (June 2012), 1239-1246 [Pdf].
**[NC12]**- Nalepa, J., Czech, Z.J., A parallel heuristic algorithm to solve the vehicle routing problem with time windows, Studia Informatica 33 (1), (2012), 91-106 [Pdf].
**[C10]**- Czech, Z.J., A parallel simulated annealing algorithm as a tool for fitness landscapes exploration, In: Ros, A., (ed.), Parallel and distributed computing, In-Tech, Vukovar, Croatia, 2010, chapter 13, 247-271 (see: http://sciyo.com/books/show/title/parallel-and-distributed-computing) [Pdf].
**[C07]**- Best solutions found by the parallel simulated annealing algorithm for Solomon's vehicle routing problem with time windows (VRPTW) benchmark instances [Html].
**[C06a]**- Czech, Z.J., Co-operation of processes in parallel simulated annealing, Proc. of the 18th IASTED International Conference on Parallel and Distributed Computing and Systems, (November 13-15, 2006), Dallas, Texas, USA, 401--406 [Postscript] [Pdf].
**[C06]**- Czech, Z.J., Speeding up sequential simulated annealing by parallelization, Proc. of the International Conference on Parallel Computing in Electrical Engineering, PARELEC 2006, (September 13--17, 2006), Bialystok, Poland, (IEEE Conference Publishing Services), 349-354 [Postscript].
**[CW06]**- Czech, Z.J., Wieczorek, B., Solving bicriterion optimization problems by parallel simulated annealing, Proc. of the 14th Euromicro Conference on Parallel, Distributed and Network-based Processing, (February 15--17, 2006), Montbéliard-Sochaux, France, (IEEE Conference Publishing Services), 7-14 [Postscript] [Pdf-presentation].
**[CW05]**- Czech, Z.J., Wieczorek, B., Frequency of co-operation of parallel simulated annealing processes, Proc. of the 6th International Conference on Parallel Processing and Applied Mathematics (PPAM'05), (September 11--14, 2005), Poznan, Poland (in print) [Postscript].
**[BCW03]**- Boryczka, M., Czech, Z.J., Wieczorek, W., Ant colony programming for approximation problems, Proc. of the Genetic and Evolutionary Computation Conf. - GECCO'03, E. Cantu-Paz et al. (Eds.), Chicago, IL, USA, (July 2003), 142-143 [Postscript].
**[CCG03]**- Czarnas, P., Czech, Z.J., Gocyla, P., Parallel simulated annealing for bicriterion optimization problems, Proc. of the 5th International Conference on Parallel Processing and Applied Mathematics (PPAM'03), Czestochowa, Poland, (September 7-10, 2003), 233-240 [Postscript].
**[BC02]**- Boryczka M., Czech Z.J., Solving approximation problems by ant colony programming, Proc. of the Genetic and Evolutionary Computation Conf. - GECCO'02, W.B. Langdon et al. (Eds.), New York City, NY, USA, (9-13 July, 2002), 133 [Postscript].
**[WC02]**- Wieczorek W., Czech Z.J., Selection schemes in evolutionary algorithms, Proc. of the Intelligent Information Systems XI - IIS'02, Sopot, Poland, (3-6 June, 2002), 185-194 [Postscript].
**[CC02]**- Czech, Z.J., Czarnas, P., Parallel simulated annealing for the vehicle routing problem with time windows, 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands - Spain, (January 9-11, 2002), 376-383 [Postscript].
**[C01]**- Czech, Z.J., Parallel simulated annealing for the delivery problem, 9th Euromicro Workshop on Parallel and Distributed Processing, Mantova - Italy, (February 7-9, 2001), 219-226 [Postscript].
**[C00]**- Czech, Z.J., Parallel simulated annealing for the set-partitioning problem, 8th Euromicro Workshop on Parallel and Distributed Processing, Rhodes - Greece, (January 19-21, 2000), 343-350 [Postscript].
**[C99]**- Czech, Z.J., Solving the set-partitioning problem using parallel simulated annealing, The 3rd International Conference on Parallel Processing and Applied Mathematics (PPAM'99), Kazimierz Dolny, Poland, (September 14-17, 1999), 256-265 [Postscript].
**[WC99]**- Wieczorek, W., Czech, Z.J., Grammars in genetic programming, Proc. of the Workshop Intelligent Information Systems VIII, Ustron, Poland, (14-18 June, 1999), 247-256 [Postscript].
**[C98a]**- Czech, Z.J., Quasi-perfect hashing, The Computer Journal 41, 6 (1998), 416-421 [Postscript].
**[CM98]**- Czech, Z.J., Mikanik, W., Randomized PRAM simulation, Fundamenta Informaticae 36, 4 (December 1998), 317-336 [Postscript].
**[CHM97]**- Czech, Z.J., Havas, G., Majewski, B.S., Perfect Hashing, Theoretical Computer Science 182, (1997), 1-143 [Postscript].
**[MWHC96]**- Majewski, B.S., Wormald, N.C., Havas, G., Czech, Z.J., A family of perfect hashing methods, (1996), The Computer Journal 39, 6 (1996), 547-554.
**[CM96]**- Czech, Z.J., Mikanik, W., Randomized PRAM simulation using T9000 Transputers, Proc. of the Int. Conf. on High-Performance Computing and Networking (HPCN Europe), Brussels, Belgium, April 1996; Lectures Notes in Computer Science 1067, Springer-Verlag, 736-743.
**[C95]**- Czech, Z.J., Generating minimal perfect hash functions, Archiwum Informatyki Teoretycznej i Stosowanej, Tom 7, z. 1-4, (1995), 23-39 [Postscript].
**[BCK94]**- Bartoszek, B., Czech, Z.J., Konopka, M., Parallel searching for a first solution, Proc. 9th Int. Symposium on Computer and Information Sciences, (7-9 November 1994), Antalya, Turkey, 132-139.
**[BCK93]**- Bartoszek, B., Czech, Z.J., Konopka, M., Parallel searching for a first solution, University of Kent at Canterbury, (September 1993), TR 8-93.
**[CM93]**- Czech, Z.J., Majewski, B.S., A linear time algorithm for finding minimal perfect hash functions, The Computer Journal 36, 6 (1993), 579-587.
**[CM93a]**- Czech, Z.J., Majewski, B.S., A linear time algorithm for finding minimal perfect hash functions, The University of Queensland, (June 1993), TR-274, Key Centre for Software Technology, Queensland.
**[CKM93]**- Czech, Z.J., Konopka, M., Majewski, B.S., Parallel algorithms for finding a suboptimal fundamental-cycle set in a graph, Parallel Computing 19, (1993), 961-971.
**[CKM93a]**- Czech, Z.J., Konopka, M., Majewski, B.S., Parallel algorithms for finding a suboptimal fundamental-cycle set in a graph, The University of Queensland, (February 1993), TR-258, Key Centre for Software Technology, Queensland.
**[KCB93]**- Konopka, M., Czech, Z.J., Bartoszek, B., Parallel searching for a first solution, Proc. of the Workshop on Design Methodologies for Microelectronics and Signal Processing, (20-23 October 1993), Gliwice-Cracow, Poland, 317-324.
**[MWHC93]**- Majewski, B.S., Wormald, N.C., Havas, G., Czech, Z.J., A family of generators of minimal perfect hash functions, 19th Int. Workshop on Graph-Theoretic Concepts (WG'93), (16-18 June 1993), Utrecht/Papendal, The Netherlands.
**[CK92]**- Czech, Z.J., Konopka, M., Communication and calculation efficiency in the IMS T800 transputer, WoTUG Newsletter, 17, (1992), 59-66.
**[CHM92]**- Czech, Z.J., Havas, G., Majewski, B.S., An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters 43, (1992), 257-264.
**[CHM92a]**- Czech, Z.J., Havas, G., Majewski, B.S., Practically optimal algorithms for minimal perfect hashing, The University of Queensland, (January 1992), TR-222, Key Centre for Software Technology, Queensland.
**[CHM92b]**- Czech, Z.J., Havas, G., Majewski, B.S., An optimal algorithm for generating minimal perfect hash functions, DIMACS at Rutgers University, (May 1992), TR 92-24, Piscataway, NJ.
**[CM92]**- Czech, Z.J., Majewski, B.S., Generating a minimal perfect
hash function in
*O(M*time, Archiwum Informatyki Teoretycznej i Stosowanej, Tom 4, z. 1-4, (1992), 3-20.^{2}) **[MWCH92]**- Majewski, B.S., Wormald, N.C., Czech, Z.J., Havas, G., A family of generators of minimal perfect hash functions, DIMACS at Rutgers University, (April 1992), TR 92-16, Piscataway, NJ.
**[CHM91]**- Czech, Z.J., Havas, G., Majewski, B.S., An optimal algorithm for generating minimal perfect hash functions, The University of Queensland, (November 1991), TR-217, Key Centre for Software Technology, Queensland.