Professor Igor Potapov
Professor Computer Science
- +44 (0)151 795 4258
- Work email Potapov@liverpool.ac.uk
- Personal Websitehttp://cgi.csc.liv.ac.uk/~igor/
Research
Theoretical Computer Science and Discrete Mathematics
In particular I am interested in
- Reachability problems in infinite state systems;
- Distributed computing and pattern formation;
- Combinatorial optimisation and scheduling;
- Decidability questions for a variety of mathematical objects;
- Design and analysis of sequential/parallel/distributed algorithms.
Research Grants
UoL-SumDU Collaboration for Digitalisation and Digital Transformation of Ukraine
RESEARCH ENGLAND (UK)
April 2023 - December 2023
The 15th International Conference on Reachability Problems (RP21)
LONDON MATHEMATICAL SOCIETY (UK)
July 2021 - October 2022
Cornerstones of Reachability: Between Automata and Matrix Theories
ROYAL SOCIETY
October 2020 - September 2021
Design and Analysis of Systems with Reachability Objectives
ROYAL SOCIETY
August 2019 - August 2024
Reachability in iterative maps, beta-expansions and topological properties of orbits
LONDON MATHEMATICAL SOCIETY (UK)
February 2018 - May 2018
Leverhulme Research Centre for Functional Materials Design
LEVERHULME TRUST (UK)
October 2016 - March 2027
Reachability problems for words, matrices and maps: Algorithms and Complexity
ENGINEERING & PHYSICAL SCIENCES RESEARCH COUNCIL
December 2014 - March 2023
Specification and Verification of Infinite-State Systems: Focus on Data
ROYAL SOCIETY (CHARITABLE)
May 2011 - September 2013
Discrete analogues of dynamical systems and their applications for secure data transmission
NORTH ATLANTIC TREATY ORGANISATION(BELGIUM)
February 2008 - January 2010
Computational problems for low-dimensional structures
ROYAL SOCIETY
August 2007 - July 2009
Reachability analysis of dynamical systems
ROYAL SOCIETY (CHARITABLE)
May 2006 - June 2006
Feasibility of verification and reachibility techniques for matrix semigroup problems.
LONDON MATHEMATICAL SOCIETY (UK)
August 2007
Investigation of the dynamics of discrete adaptive games using an automata theoretic approach.
THE NUFFIELD FOUNDATION (UK)
March 2002 - May 2005
Concatenation State Machines and Simple Functions (algorithms and complexity)
ENGINEERING & PHYSICAL SCIENCES RESEARCH COUNCIL
February 2008 - July 2008
Application of computation theory to computational topology problems.
LONDON MATHEMATICAL SOCIETY (UK)
February 2015 - June 2015
Distinguished Visiting Fellowship Scheme (Prof. Oscar Ibarra)
ROYAL ACADEMY OF ENGINEERING (UK)
August 2008 - September 2008
Workshop on Reachability Problems, RP2008
LONDON MATHEMATICAL SOCIETY (UK)
August 2008 - December 2008
University of Liverpool Institutional Discipline Bridging.
MEDICAL RESEARCH COUNCIL
October 2003 - October 2006
An influence of the external world constraints on computational models.
ROYAL SOCIETY (CHARITABLE)
June 2005 - August 2005
From post systems to the reachability problems for matrix semigroups and counter automata.
ROYAL SOCIETY (CHARITABLE)
December 2004