default search action
Pavel G. Emelyanov
Person information
- affiliation: Russian Academy of Sciences, Siberian Branch, Ershov Institute of Informatics Systems (IIS), Novosibirsk, Russia
- affiliation: Novosibirsk State University, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j5]Pavel G. Emelyanov
, Madhava Krishna C, Vadiraj Kulkarni, S. K. Nandy, Denis K. Ponomaryov, Soumyendu Raha:
Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation. Program. Comput. Softw. 47(2): 108-118 (2021) - 2020
- [j4]Pavel G. Emelyanov
The complexity of AND - decomposition of Boolean functions. Discret. Appl. Math. 280: 113-132 (2020)
2010 – 2019
- 2019
- [c8]Vadiraj Kulkarni, Pavel G. Emelyanov
Parallel Factorization of Boolean Polynomials. Ershov Informatics Conference 2019: 80-94 - 2018
- [c7]Pavel G. Emelyanov, Denis K. Ponomaryov:
On a Polytime Factorization Algorithm for Multilinear Polynomials over \mathbb F_2. CASC 2018: 164-176 - [c6]Pavel G. Emelyanov
On Two Kinds of Dataset Decomposition. ICCS (2) 2018: 171-183 - [c5]Liudmila Mozheikina
Mobile Applications as Tools of Alternative Communication, Diagnostics and Language Development for Children with Language Disorders. SocInfo (2) 2018: 75-84 - [i1]Pavel G. Emelyanov, Denis K. Ponomaryov:
On Polytime Algorithm for Factorization of Multilinear Polynomials Over F2. CoRR abs/1805.08186 (2018) - 2016
- [c4]Pavel G. Emelyanov:
AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables. CALDAM 2016: 164-175 - 2015
- [j3]Pavel G. Emelyanov
Algorithmic issues of AND-decomposition of boolean formulas. Program. Comput. Softw. 41(3): 162-169 (2015) - 2014
- [c3]Pavel G. Emelyanov
On Tractability of Disjoint AND-Decomposition of Boolean Formulas. Ershov Memorial Conference 2014: 92-101
2000 – 2009
- 2001
- [j2]Danil E. Baburin, Mikhail A. Bulyonkov, Pavel G. Emelianov
Visualization Facilities in Program Reengineering. Program. Comput. Softw. 27(2): 69-77 (2001) - 2000
- [j1]Pavel G. Emelyanov
On the maximal length of a snake in hypercubes of small dimension. Discret. Math. 218(1-3): 51-59 (2000)
1990 – 1999
- 1997
- [c2]Pavel G. Emelianov
Semantic Analyzer of Modula-Programs. SAS 1997: 361-363 - 1996
- [c1]Pavel G. Emeljanov
Analysis of the Equality Relations for the Program Terms. SAS 1996: 174-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: