Alexei Lisitsa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alexei Lisitsa has a total of 60 co-authors. Here are the top co-authors by number of shared publications:
- Alexei Vernitski
University of Essex
14 shared publications - Clare Dixon
The University of Manchester
4 shared publications - Michael Fisher
Department of Computer Science, The University of Manchester, Manchester, U.K.
4 shared publications - Bei Peng
School of Computer Science University of Sheffield Sheffield UK
3 shared publications - Georgios Kourtis
Department of Computer Science, The University of Manchester, Manchester, UK
3 shared publications - Manolis Pitsikalis
University of Liverpool
3 shared publications
Latest Publications
- Open Access
- 8 July 2026
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 70 (2) , 11
Probabilistic Automaton Classifier Applied to Examples Related to the Andrews-Curtis Conjecture
The unsolved Andrews-Curtis conjecture in group theory gives rise to many famously challenging theorem-proving problems. Automated reasoning is one of the best state-of-the-art approaches to solving them. We have developed a new classifier inspired by group theory and a new search algorithm orientated at using for the Andrews-Curtis conjecture. We combine them with automated reasoning and compare their performance with automated reasoning.
- 8 July 2026
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 70 (2) , 11
Open AccessProbabilistic Automaton Classifier Applied to Examples Related to the Andrews-Curtis Conjecture
The unsolved Andrews-Curtis conjecture in group theory gives rise to many famously challenging theorem-proving problems. Automated reasoning is one of the best state-of-the-art approaches to solving them. We have developed a new classifier inspired by group theory and a new search algorithm orientated at using for the Andrews-Curtis conjecture. We combine them with automated reasoning and compare their performance with automated reasoning.
- Open Access
- 28 November 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (8) , 982
Fast and Secure Multiparty Querying over Federated Graph Databases
We have developed a framework for efficient privacy preserving multi-party querying (PPMQ) over federated graph databases, leveraging Secure Multi-Party Computation (SMPC) protocols to enhance data security. The system offers two distinct security protocols: a client-based protocol and a server-based protocol. In the client-based protocol, standard SMPC techniques are employed, allowing computations to be performed on data without exposing the data itself. The server-based protocol employs SMPC to facilitate secure data processing and is further enhanced by encrypted hashing, which adds an additional layer of security to prevent data exposure. We conducted experiments comparing PPMQ with Neo4j Fabric and two previous systems, SMPQ and Conclave. The results indicate that PPMQ’s execution times and overheads are comparable to those of Neo4j Fabric, while outperforming both SMPQ and Conclave, demonstrating its superior efficiency. Additionally, PPMQ, like SMPQ and Conclave, utilises an honest but curious security model. However, it enhances the security of the server protocol, making it more robust against brute force attacks and providing stronger privacy guarantees than previous solutions.
- 28 November 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (8) , 982
Open AccessFast and Secure Multiparty Querying over Federated Graph Databases
We have developed a framework for efficient privacy preserving multi-party querying (PPMQ) over federated graph databases, leveraging Secure Multi-Party Computation (SMPC) protocols to enhance data security. The system offers two distinct security protocols: a client-based protocol and a server-based protocol. In the client-based protocol, standard SMPC techniques are employed, allowing computations to be performed on data without exposing the data itself. The server-based protocol employs SMPC to facilitate secure data processing and is further enhanced by encrypted hashing, which adds an additional layer of security to prevent data exposure. We conducted experiments comparing PPMQ with Neo4j Fabric and two previous systems, SMPQ and Conclave. The results indicate that PPMQ’s execution times and overheads are comparable to those of Neo4j Fabric, while outperforming both SMPQ and Conclave, demonstrating its superior efficiency. Additionally, PPMQ, like SMPQ and Conclave, utilises an honest but curious security model. However, it enhances the security of the server protocol, making it more robust against brute force attacks and providing stronger privacy guarantees than previous solutions.
- Open Access
Heuristic Transformer: Belief Augmented In-Context Reinforcement Learning
Transformers have demonstrated exceptional in-context learning (ICL) capabilities, enabling applications across natural language processing, computer vision, and sequential decision-making. In reinforcement learning, ICL reframes learning as a supervised problem, facilitating task adaptation without parameter updates. Building on prior work leveraging transformers for sequential decision-making, we propose Heuristic Transformer (HT), an in-context reinforcement learning (ICRL) approach that augments the in-context dataset with a belief distribution over rewards to achieve better decision-making. Using a variational auto-encoder (VAE), a low-dimensional stochastic variable is learned to represent the posterior distribution over rewards, which is incorporated alongside an in-context dataset and query states as prompt to the transformer policy. We assess the performance of HT across the Darkroom, Miniworld, and MuJoCo environments, showing that it consistently surpasses comparable baselines in terms of both effectiveness and generalization. Our method presents a promising direction to bridge the gap between belief-based augmentations and transformer-based decision-making.
Open AccessHeuristic Transformer: Belief Augmented In-Context Reinforcement Learning
Transformers have demonstrated exceptional in-context learning (ICL) capabilities, enabling applications across natural language processing, computer vision, and sequential decision-making. In reinforcement learning, ICL reframes learning as a supervised problem, facilitating task adaptation without parameter updates. Building on prior work leveraging transformers for sequential decision-making, we propose Heuristic Transformer (HT), an in-context reinforcement learning (ICRL) approach that augments the in-context dataset with a belief distribution over rewards to achieve better decision-making. Using a variational auto-encoder (VAE), a low-dimensional stochastic variable is learned to represent the posterior distribution over rewards, which is incorporated alongside an in-context dataset and query states as prompt to the transformer policy. We assess the performance of HT across the Darkroom, Miniworld, and MuJoCo environments, showing that it consistently surpasses comparable baselines in terms of both effectiveness and generalization. Our method presents a promising direction to bridge the gap between belief-based augmentations and transformer-based decision-making.
- 10 November 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 19 (1) , 1-16
ML-BF: Responsive and Dynamic Intrusion Detection towards Intelligent Connected Vehicles
- 10 November 2025
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 19 (1) , 1-16
ML-BF: Responsive and Dynamic Intrusion Detection towards Intelligent Connected Vehicles
- Open Access
- 15 October 2025
- Published by Elsevier in Journal of Computational Algebra
- Vol. 16
Stable Andrews-Curtis trivialization of AK(3) revisited. A case study using automated deduction
- 15 October 2025
- Published by Elsevier in Journal of Computational Algebra
- Vol. 16
Open AccessStable Andrews-Curtis trivialization of AK(3) revisited. A case study using automated deduction
- Open Access
- 23 September 2025
- Published by Elsevier in Examples and Counterexamples
- Vol. 8
Automated theorem proving reveals a lengthy Andrews–Curtis trivialization for a Miller-Schupp trivial group presentation
- 23 September 2025
- Published by Elsevier in Examples and Counterexamples
- Vol. 8
Open AccessAutomated theorem proving reveals a lengthy Andrews–Curtis trivialization for a Miller-Schupp trivial group presentation
- Open Access
- 30 July 2025
- Published by Springer Nature in Research Square
Automated reasoning boosted by a probabilistic automaton classifier: An application to the Andrews-Curtis conjecture
Automated reasoning can take a prohibitively long time to run. We present a combined approach which makes automated reasoning more efficient by using supervised learning to identify promising tasks for automated reasoning. For supervised learning, we have developed a new, simple and efficient way of training an automaton classifier. We demonstrate the efficiency of our approach on examples drawn from the Andrews-Curtis conjecture, a famously challenging problem.
- 30 July 2025
- Published by Springer Nature in Research Square
Open AccessAutomated reasoning boosted by a probabilistic automaton classifier: An application to the Andrews-Curtis conjecture
Automated reasoning can take a prohibitively long time to run. We present a combined approach which makes automated reasoning more efficient by using supervised learning to identify promising tasks for automated reasoning. For supervised learning, we have developed a new, simple and efficient way of training an automaton classifier. We demonstrate the efficiency of our approach on examples drawn from the Andrews-Curtis conjecture, a famously challenging problem.
- 22 July 2025
- Published by Springer Nature
- p. 22-42
Secure Multi-party Querying Federated Graph Databases
- 22 July 2025
- Published by Springer Nature
- p. 22-42
Secure Multi-party Querying Federated Graph Databases
- Open Access
- 11 July 2025
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 69 (3) , 1-32
Automated reasoning for proving non-orderability of groups
We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as reasoning from the first principles, positive cones, torsions, generalised torsions and cofinal elements.
- 11 July 2025
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 69 (3) , 1-32
Open AccessAutomated reasoning for proving non-orderability of groups
We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as reasoning from the first principles, positive cones, torsions, generalised torsions and cofinal elements.
- 29 November 2024
- Published by Springer Nature
- p. 207-220
Contextual Transformers for Goal-Oriented Reinforcement Learning
- 29 November 2024
- Published by Springer Nature
- p. 207-220
Contextual Transformers for Goal-Oriented Reinforcement Learning