We stand with Ukraine  

Pavel G. Emelyanov

Orcid: 0000-0001-8747-0600

Affiliations:
  • Russian Academy of Sciences, Siberian Branch, Ershov Institute of Informatics Systems (IIS), Novosibirsk, Russia
  • Novosibirsk State University, Russia


According to our database1, Pavel G. Emelyanov authored at least 14 papers between 1996 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation.
[BibTeX]
[DOI]
Pavel G. Emelyanov
,
Madhava Krishna C
,
Vadiraj Kulkarni
,
S. K. Nandy
,
Denis K. Ponomaryov
,
Soumyendu Raha
Program. Comput. Softw., 2021

2020
The complexity of AND - decomposition of Boolean functions.
[BibTeX]
[DOI]
Pavel G. Emelyanov
,
Denis K. Ponomaryov
Discret. Appl. Math., 2020

2019
Parallel Factorization of Boolean Polynomials.
[BibTeX]
[DOI]
Vadiraj Kulkarni
,
Pavel G. Emelyanov
,
Denis K. Ponomaryov
,
Madhava Krishna C
,
Soumyendu Raha
,
S. K. Nandy
Proceedings of the Perspectives of System Informatics, 2019

2018
On Polytime Algorithm for Factorization of Multilinear Polynomials Over F2.
[BibTeX]
[DOI]
Pavel G. Emelyanov
,
Denis K. Ponomaryov
CoRR, 2018

Mobile Applications as Tools of Alternative Communication, Diagnostics and Language Development for Children with Language Disorders.
[BibTeX]
[DOI]
Liudmila Mozheikina
,
Pavel G. Emelyanov
Proceedings of the Social Informatics, 2018

On Two Kinds of Dataset Decomposition.
[BibTeX]
[DOI]
Pavel G. Emelyanov
Proceedings of the Computational Science - ICCS 2018, 2018

On a Polytime Factorization Algorithm for Multilinear Polynomials over \mathbb F_2.
[BibTeX]
[DOI]
Pavel G. Emelyanov
,
Denis K. Ponomaryov
Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2016
AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables.
[BibTeX]
[DOI]
Pavel G. Emelyanov
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Algorithmic issues of AND-decomposition of boolean formulas.
[BibTeX]
[DOI]
Pavel G. Emelyanov
,
Denis K. Ponomaryov
Program. Comput. Softw., 2015

2014
On Tractability of Disjoint AND-Decomposition of Boolean Formulas.
[BibTeX]
[DOI]
Pavel G. Emelyanov
,
Denis K. Ponomaryov
Proceedings of the Perspectives of System Informatics, 2014

2001
Visualization Facilities in Program Reengineering.
[BibTeX]
[DOI]
Danil E. Baburin
,
Mikhail A. Bulyonkov
,
Pavel G. Emelianov
,
N. N. Filatkina
Program. Comput. Softw., 2001

2000
On the maximal length of a snake in hypercubes of small dimension.
[BibTeX]
[DOI]
Pavel G. Emelyanov
,
Agung Lukito
Discret. Math., 2000

1997
Semantic Analyzer of Modula-Programs.
[BibTeX]
[DOI]
Pavel G. Emelianov
,
Danil E. Baburin
Proceedings of the Static Analysis, 4th International Symposium, 1997

1996
Analysis of the Equality Relations for the Program Terms.
[BibTeX]
[DOI]
Pavel G. Emeljanov
Proceedings of the Static Analysis, Third International Symposium, 1996


  Loading...