Sergey A. Afonin

Affiliations:
  • Lomonosov Moscow State University, Russia


According to our database1, Sergey A. Afonin authored at least 17 papers between 2006 and 2021.

Collaborative distances:
  • Dijkstra number2 of seven.
  • Erdős number3 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Algorithm for Searching Experts in Scientometric Systems.
Proceedings of the 23rd Conference on Scientific Services & Internet (SSI 2021), 2021

2020
Determining the Thematic Proximity of Scientific Journals and Conferences Using Big Data Technologies.
Russ. Digit. Libr. J., 2020

The Use of Thematic Analysis Methods in Scientometric Systems.
Proceedings of the 22nd Conference on Scientific Services & Internet (SSI-2020) Novorossiysk-Abrau (online), 2020

2019
Determination of Thematic Proximity of Scientific Journals and Conferences Using Big Data Technologies.
Proceedings of the 21st Conference on Scientific Services & Internet (SSI-2019), 2019

2018
Algorithm for linking translated articles using authorship statistics.
Russ. Digit. Libr. J., 2018

Decision Problems and Applications of Rational Sets of Regular Languages.
Fundam. Informaticae, 2018

Validation of Safety-Like Properties for Entity-Based Access Control Policies.
Proceedings of the Advances in Soft and Hard Computing, 2018

2017
On high-precision chessboard detection on static scene videos from mobile eye-tracking devices.
Proceedings of the 21st Conference of Open Innovations Association, 2017

2016
Performance evaluation of a rule-based access control framework.
Proceedings of the 39th International Convention on Information and Communication Technology, 2016

2014
SQLReports - Yet Another Relational Database Reporting System.
Proceedings of the ICSOFT-EA 2014, 2014

2010
On the Structure of Finitely Generated Semigroups of Unary Regular Languages.
Int. J. Found. Comput. Sci., 2010

On Automated Hyperonym Hierarchy Construction Using an Internet Search Engine.
Proceedings of the 24th Pacific Asia Conference on Language, Information and Computation, 2010

Calculating Semantic Similarity between Facts.
Proceedings of the KDIR 2010, 2010

2009
Minimal Union-Free Decompositions of Regular Languages.
Proceedings of the Language and Automata Theory and Applications, 2009

2008
The View Selection Problem for Regular Path Queries.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Semigroups of regular languages over a one letter alphabet are rational.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2006
Membership and Finiteness Problems for Rational Sets of Regular Languages.
Int. J. Found. Comput. Sci., 2006


  Loading...