Dr. Alexander Tiskin Curriculum Vitae

Associate Professor Dr. Alexander Tiskin Curriculum Vitae Department of Computer Science, University of Warwick, Coventry CV4 7AL, United Kingdom email: tiskin@dcs.warwick.ac.uk web: http://go.warwick.ac.uk/alextiskin Born on 16/10/1970 Degrees/Qualifications DPhil in Computation, Oxford University, 1999 MSc Diploma with distinction in Mathematics and Computer Science, St. Petersburg University, 1992 Appointment History Associate Professor / Lecturer, Department of Computer Science, University of Warwick, since 1999 Departmental lecturer, Oxford University Computing Laboratory, 1997 99 Education History DPhil student, Oxford University, 1994 98 Visiting student, Oxford University, 1993 94 Graduate student, St.Petersburg Steklov Mathematical Institute, 1992 93 Student, St. Petersburg University, 1987 92 Research Interests String algorithms and computational biology; parallel computation; computational complexity; combinatorial optimisation. Support from Research Grants Royal Society Leverhulme Trust Senior Research Fellow, 2009 2010. Co-investigator, Special Structures in Vehicle Routing Problems, University of Warwick, EPSRC grant EP/F017871/1, 2008 2010. Recipient of Warwick University Strategic Partnership travel grant, 2010.

Recipient of Royal Society International Travel Grants in 2007, 2009, 2010. Supported by the Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, EPSRC award EP/D063191/1, since 2007. Supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM- FT), 2000 03. Supported by ESPRIT Basic Research Project 9072 GEPPCOM (Foundations of General Purpose Parallel Computing) and an Overseas Research Student Award, 1994 97. Supported by the Soros/FCO Research Scholarship, 1993 94. Research Supervision and Examining PhD dissertation by Matthew Felice Pace, supervisor since 2010. PhD dissertation by Christopher Barrington, advisory committee member in 2009 11. PhD dissertation by Peter Krusche, supervisor in 2006 10, graduated in 2011. MSc (Research) dissertation by Peter Krusche, supervisor in 2004 05, graduated in 2005. PhD dissertation by Steven Kelk, examiner in 2003. PhD dissertation by Ahmed Alkindi, supervisor in 2000 01, graduated in 2003. Teaching Experience Computer Security (30 hours), course organiser and lecturer, Warwick, 2012/13 Advanced Topics in Algorithms (30 hours), course organiser and lecturer, Warwick, 2010/11, 2012/13 Discrete Mathematics and Its Applications 1 (30 hours), course organiser and lecturer, Warwick, 2008/09 (joint), 2010/11 (joint) Data Structures and Algorithms (15 hours), course organiser and lecturer, Warwick, 2010/11 Algorithm Design (15 hours), course organiser and lecturer, Warwick, 2010/11 Complexity of Algorithms (30 hours), course organiser and lecturer, Warwick, 2008/09 (joint) Mathematics for Computer Scientists 1 (30 hours), course organiser and lecturer, Warwick, 2006/07 to 2008/09. Efficient Parallel Algorithms (30 hours), course organiser and lecturer, Warwick, 2004/05, 2006/07 to 2007/08. Mathematical Programming 3 (10 hours), course lecturer, Warwick, 2004/05. Discrete Mathematics 1 (30 hours), course organiser and lecturer, Warwick, 1999/00 to 2004/05. MEng computer science group project, supervisor, Warwick, 2003/04, 2012/13.

BSc, MEng and MSc computer science projects, supervisor and second assessor, Warwick, since 2000. MSc project co-supervisor, Warwick Business School, 2011/12. Various Computer Science courses (approx. 10 titles), seminar tutor, lab demonstrator and college tutor, Oxford, 1997 99. Administrative Service MSc Project Co-ordinator, 2012/13. Member of Science Faculty IT Committee, 2012/13. Discrete Mathematics Course Manager, 2010/11. Member of Student-Staff Liaison Committee, 2010/11. Intercalated Year Co-ordinator, 2006/07 to 2008/09. Member of Undergraduate Studies Committee, 2006/07 to 2008/09, 2010/11. Deputy Examination Secretary, 2008/09. Undergraduate Course Selector (joint), 2002/03 to 2003/04, 2010/11. Third-Year Tutor, 2001/02 to 2002/03. Member of various Computer Science Examination Boards, since 1999/00 Member of Science Faculty First-Year Examination Board, 1999/00 to 2002/03. Personal Tutor, since 1999/00. Professional Activities Invited tutorial, Computer Science Club, St Petersburg, Russia, 2012. Invited lecture, Undergraduate Research Conference, King s College London, 2010. Invited tutorial, Latest Advances in Informatics, University of La Laguna, Spain, 2007. Steering committee member: HLPP (since 2012). Program committee chair (joint): HLPP 2005. Program committee member: CPM 2012, SPIRE 2011 and 2012, PARCA 2010, Euro-Par 2009, I-SPAN 2005, PAPP 2004 and 2006, SCCC 2001, 2003 and 2005. Book refereeing: Wiley, Palgrave, Oxford University Press, Chapman & Hall / CRC Press. Journal refereeing: Journal of ACM; Theoretical Computer Science; Concurrency: Practice and Experience; Discrete Applied Mathematics; Discrete Mathematics; Parallel Computing; Journal of Parallel and Distributed Computing; Information Processing Letters; International Journal of Foundations of Computer Science; International Journal of Parallel, Emergent and Distributed Systems; Journal of Mathematical Sciences; The Computer Journal.

Grant proposal refereeing: EPSRC, British Council, CNRS (France). Publications Under review L. Baxter, A. Jironkin, R. Hickman, J. Moore, C. Barrington, P. Krusche, N. P. Dyer, V. Buchanan- Wollaston, A. Tiskin, J. Beynon, K. Denby, S. Ott. Conserved Noncoding Sequences Highlight Shared Components of Regulatory Networks in Dicotyledonous Plants. Book chapters A. Tiskin. Bulk-synchronous parallelism. In Encyclopedia of Parallel Computing. Springer, 2011. A. Tiskin. Bulk-synchronous parallelism: An emerging paradigm of high-performance computing. In High Performance Computing: Paradigm and Infrastructure. John Wiley and Sons, 2005. Journal articles L. Baxter, A. Jironkin, R. Hickman, J. Moore, C. Barrington, P. Krusche, N. P. Dyer, V. Buchanan- Wollaston, A. Tiskin, J. Beynon, K. Denby, and S. Ott. Conserved Noncoding Sequences Highlight Shared Components of Regulatory Networks in Dicotyledonous Plants. Plant Cell, 24, 10, pp. 3949 3965, 2012. N. Korpelainen, V. Lozin, D. S. Malyshev, and A. Tiskin. Boundary properties of graphs for algorithmic graph problems. Theoretical Computer Science, 412, 29, pp. 3545-3554, 2011. E. Picot, P. Krusche, A. Tiskin, I. Carré, and S. Ott. Evolutionary Analysis of Regulatory Sequences (EARS) in Plants. The Plant Journal, 164, 1, pp. 165 176, 2010. V. Deineko and A. Tiskin. Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? ACM Journal on Experimental Algorithmics, 14, Article 4.6, 2009. A. Tiskin. Faster subsequence recognition in compressed strings. Journal of Mathematical Sciences, 158, 5, pp. 759 769, 2009. A. Tiskin. Semi-local longest common subsequences in subquadratic time. Journal of Discrete Algorithms, 6, 4, pp. 570 581, 2008. A. Tiskin. Semi-local string comparison: Algorithmic techniques and applications. Mathematics in Computer Science, 1, 4, pp. 571 603, 2008. A. Tiskin. Communication-efficient parallel generic pairwise elimination. Future Generation Computer Systems, 23, 2, pp. 179 188, 2007. A. Tiskin. Packing tripods: Narrowing the density gap. Discrete Mathematics, 307, 16, pp. 1973 1981, 2007. D. Irony, S. Toledo and A. Tiskin. Communication Lower Bounds for Distributed-Memory Matrix Multiplication. Journal of Parallel and Distributed Computing, 64, 9, pp. 1017 1026, 2004.

A. V. Gerbessiotis, C. J. Siniolakis and A. Tiskin. Parallel priority queue and list contraction: The BSP approach. Computing and Informatics, 21, pp. 59 90, 2002. A. Tiskin. Bulk-synchronous parallel Gaussian elimination. Journal of Mathematical Sciences, 108, 6, pp. 977 991, 2002. A. Tiskin. A new way to divide and conquer. Parallel Processing Letters, 11, 4, pp. 409 422, 2001. W. F. McColl and A. Tiskin. Memory-efficient matrix computations in the BSP model. Algorithmica, 24, 3 4, pp. 287 297, 1999. A. Tiskin. The bulk-synchronous parallel random access machine. Theoretical Computer Science, 196, 1 2, pp. 109 130, 1998. A. N. Terekhov and A. V. Tiskin. Public-key cryptography: from theory to standard. Programming and Computer Software, 20, 5, pp. 189 192, 1994. (Translated from Russian.) Conference articles Efficient High-Similarity String Comparison: The Waterfall Algorithm. In Proceedings of EDBT/ICDT, 2013, to appear. A. Tiskin. Towards approximate matching in compressed strings: Local subsequence recognition. In Proceedings of CSR, vol. 6651 of Lecture Notes in Computer Science, pp. 401 414, 2011. P. Krusche and A. Tiskin. New algorithms for efficient parallel string comparison. In Proceedings of ACM SPAA, pp. 209 216, 2010. A. Tiskin. Parallel selection by regular sampling. In Proceedings of Euro-Par, Part II, vol. 6272 of Lecture Notes in Computer Science, pp. 393 399, 2010. A. Tiskin. Fast distance multiplication of unit-monge matrices. In Proceedings of ACM-SIAM SODA, pp. 1287 1296, 2010. N. Korpelainen, V. Lozin and A. Tiskin. Hamiltonian cycles in subcubic graphs: What makes the problem difficult. In Proceedings of TAMC, vol. 6108 of Lecture Notes in Computer Science, pp. 320 327, 2010. P. Krusche and A. Tiskin. Longest increasing subsequences in scalable time and memory. In Proceedings of PPAM 2009, Revised Selected Papers, Part I, vol. 6067 of Lecture Notes in Computer Science, pp. 176 185, 2010. P. Krusche and A. Tiskin. Computing alignment plots efficiently. In Proceedings of ParCo, 2009. Appeared in Parallel Computing: From Multicores and GPUs to Petascale, vol. 19 of Advances in Parallel Computing series, IOS Press, pp. 158 165, 2010. A. Tiskin. Periodic string comparison. In Proceedings of CPM, vol. 5577 of Lecture Notes in Computer Science, pp. 193 206, 2009.

V. Deineko and A. Tiskin. Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio. In Proceedings of DIMAP Workshop on Algorithmic Graph Theory, Electronic Notes in Discrete Mathematics, 32, pp. 19 26, 2009. P. Krusche and A. Tiskin. String comparison by transposition networks. In Proceedings of London Algorithmics Workshop, 2008. Appeared in London Algorithmics 2008: Theory and Practice, vol. 11 of Texts in Algorithmics, College Publications, pp. 184 204, 2009. P. Krusche and A. Tiskin. Efficient parallel string comparison. In Proceedings of ParCo, 2007. Appeared in Parallel Computing: Architectures, Algorithms and Applications, vol. 15 of Advances in Parallel Computing series, IOS Press, pp. 193 200, 2008. V. Deineko and A. Tiskin. Fast minimum-weight double-tree shortcutting for Metric TSP. In Proceedings of WEA, vol. 4525 of Lecture Notes in Computer Science, pp. 136 149, 2007. A. Tiskin. Longest common subsequences in permutations and maximum cliques in circle graphs. In Proceedings of CPM, vol. 4009 of Lecture Notes in Computer Science, pp. 271 282, 2006. A. Tiskin. All semi-local longest common subsequences in subquadratic time. In Proceedings of CSR, vol. 3967 of Lecture Notes in Computer Science, pp. 352 363, 2006. P. Krusche and A. Tiskin. Efficient longest common subsequence computation using bulk-synchronous parallelism. In Proceedings of ICCSA, vol. 3984 of Lecture Notes in Computer Science, pp. 165 174, 2006. V. Deineko and A. Tiskin. One-sided Monge TSP is NP-hard. In Proceedings of ICCSA, vol. 3982 of Lecture Notes in Computer Science, pp. 793 801, 2006. A. Tiskin. Efficient representation and parallel computation of string-substring longest common subsequences. In Proceedings of ParCo, vol. 33 of NIC Series, John von Neumann Institute for Computing, pp. 827 834, 2005. J. M. R. Martin and A. V. Tiskin. Dynamic BSP: towards a flexible approach to parallel computing over the grid. In Communicating Process Architectures, Proceedings of WoTUG, pp. 219 226, 2004. V. Deineko, A. Tiskin. The double-tree approximation for Metric TSP: Is the best good enough? Abstract in Proceedings of ISMP, 2003. A. Tiskin. Communication-efficient parallel Gaussian elimination. In Proceedings of PaCT 03, vol. 2763 of Lecture Notes in Computer Science, pp. 369 383, 2003. A. Tiskin. Packing tripods: A computational approach. Extended abstract in J. Fiala, ed., Proceedings of Eurocomb, Charles University, pp. 353 357, 2003. A. Tiskin. Parallel convex hull computation by generalised regular sampling. In Proceedings of Euro-Par 02, vol. 2400 of Lecture Notes in Computer Science, pp. 392 399, 2002. A. Tiskin. All-pairs shortest paths computation in the BSP model. In Proceedings of ICALP, vol. 2076 of Lecture Notes in Computer Science, pp. 178 189, 2001.

A. Tiskin. A new way to divide and conquer. In Proceedings of HLPP, pp. 74 82, 2001. A. Tiskin. Tripods do not pack densely. In Proceedings of COCOON, vol. 1858 of Lecture Notes in Computer Science, pp. 272 280, 2000. J. M. R. Martin and A. V. Tiskin. BSP modelling of two-tiered parallel architectures. In Architectures, Languages and Techniques for Concurrent Systems, Proceedings of WoTUG, pp. 47 55, 1999. A. Tiskin. Bulk-synchronous parallel Gaussian elimination. In Representation Theory, Dynamical Systems, Combinatorial and Algorithmic Methods (Part 4), vol. 258 of Zapiski Nauchnykh Seminarov POMI, pp. 115 133, 1999. A. Tiskin. Bulk-synchronous parallel multiplication of Boolean matrices. In Proceedings of ICALP, vol. 1443 of Lecture Notes in Computer Science, pp. 494 506, 1998. A. V. Gerbessiotis, C. J. Siniolakis and A. Tiskin. Parallel priority queue and list contraction: The BSP approach. In Proceedings of Euro-Par, vol. 1300 of Lecture Notes in Computer Science, pp. 409 416, 1997. A. Tiskin. The bulk-synchronous parallel random access machine. In Proceedings of Euro-Par, part II, vol. 1124 of Lecture Notes in Computer Science, pp. 327 338, 1996. Doctorate thesis A. Tiskin. The design and analysis of bulk-synchronous parallel algorithms. DPhil thesis, Oxford University, 1998. Editorship F. Loulergue and A. Tiskin, eds. High-Level Parallel Programming and Applications, Proceedings of HLPP 2005. Special issue of Parallel Processing Letters, 18, 1, 2008. January 2013