default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFedor Petrov 0001
Person information
- affiliation: St. Petersburg State University, St. Petersburg Department of V.A. Steklov Institute of Mathematics of the Russian Academy of Sciences, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Danila D. Cherkashin
, Fedor Petrov, Pavel Prozorov:
On stability of spanning tree degree enumerators. Discret. Math. 346(12): 113629 (2023)- [j12]Zhiguo Li, Zeling Shao, Fedor Petrov, Alexey Gordeev:
The Alon-Tarsi number of a toroidal grid. Eur. J. Comb. 111: 103697 (2023) - [i3]Semyon Petrov, Fedor Petrov, Alexander Okhotin:
On the rank of the communication matrix for deterministic two-way finite automata. CoRR abs/2312.05909 (2023) - 2021
- [j11]Darij Grinberg, Fedor Petrov:
A Greedoid and a Matroid Inspired by Bhargava's $p$-Orderings. Electron. J. Comb. 28(3): 3 (2021) - [j10]Ivan A. Bochkov, Fedor V. Petrov:
The Bounds for the Number of Linear Extensions Via Chain and Antichain Coverings. Order 38(2): 323-328 (2021) - 2020
- [j9]Ji-Cai Liu, Fedor Petrov:
Congruences on sums of q-binomial coefficients. Adv. Appl. Math. 116: 102003 (2020) - [j8]Igor Pak, Fedor Petrov:
Hidden Symmetries of Weighted Lozenge Tilings. Electron. J. Comb. 27(3): 3 (2020) - [j7]Dmitry Krachun, Fedor Petrov, Zhi-Wei Sun, Maxim Vsemirnov:
On some determinants involving Jacobi symbols. Finite Fields Their Appl. 64: 101672 (2020) - [j6]Danila D. Cherkashin, Fedor Petrov:
Regular Behavior of the Maximal Hypergraph Chromatic Number. SIAM J. Discret. Math. 34(2): 1326-1333 (2020)
2010 – 2019
- 2019
- [j5]Danila D. Cherkashin, Fedor Petrov:
On small n-uniform hypergraphs with positive discrepancy. J. Comb. Theory B 139: 353-359 (2019) - [i2]Darij Grinberg, Fedor Petrov:
A greedoid and a matroid inspired by Bhargava's p-orderings. CoRR abs/1909.01965 (2019) - 2018
- [j4]Fedor Petrov:
Combinatorial and probabilistic formulae for divided symmetrization. Discret. Math. 341(2): 336-340 (2018) - 2017
- [j3]Fedor Petrov:
General Parity Result and Cycle-Plus-Triangles Graphs. J. Graph Theory 85(4): 803-807 (2017) - 2010
- [j2]Fedor Petrov, Anatoly M. Vershik:
Uncountable graphs and invariant measures on the set of universal countable graphs. Random Struct. Algorithms 37(3): 389-406 (2010) - [c1]Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov:
Frugal Mechanism Design via Spectral Techniques. FOCS 2010: 755-764
2000 – 2009
- 2009
- [i1]Ning Chen, Edith Elkind, Nick Gravin, Fedor Petrov:
Frugal Mechanism Design via Spectral Techniques. CoRR abs/0912.3403 (2009) - 2007
- [j1]George E. Andrews, Henrik Eriksson, Fedor Petrov, Dan Romik:
Integrals, partitions and MacMahon's Theorem. J. Comb. Theory A 114(3): 545-554 (2007)
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-10-07 22:12 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:
