default search action
Nikolai Yu. Zolotykh
Person information
- affiliation: National Research Lobachevsky State University of Nizhni Novgorod, Russia
- affiliation: National Research University Higher School of Economics, Nizhni Novgorod, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j15]Dmitry V. Gribanov
, Ivan A. Shumilov, Dmitry S. Malyshev, Nikolai Yu. Zolotykh:
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems. J. Glob. Optim. 89(4): 1033-1067 (2024) - 2022
- [j14]Alexander Kirdin, Sergey V. Sidorov
Rosenblatt's First Theorem and Frugality of Deep Learning. Entropy 24(11): 1635 (2022) - [j13]Vadim V. Lozin, Viktor Zamaraev
On Boolean threshold functions with minimum specification number. Inf. Comput. 289(Part): 104926 (2022) - [j12]Dmitry V. Gribanov
On lattice point counting in $\varDelta $-modular polyhedra. Optim. Lett. 16(7): 1991-2018 (2022) - [j11]Sergey O. Semenov
How to find the convex hull of all integer points in a polyhedron? Optim. Lett. 16(7): 2177-2189 (2022) - 2021
- [j10]Sergey I. Bastrakov
Accelerating Fourier-Motzkin elimination using bit pattern trees. Optim. Methods Softw. 36(5): 1082-1095 (2021) - 2020
- [j9]Alena I. Kalyakulina
LUDB: A New Open-Access Validation Tool for Electrocardiogram Delineation Algorithms. IEEE Access 8: 186181-186190 (2020) - [j8]Sergey I. Veselov
A polynomial algorithm for minimizing discrete convic functions in fixed dimension. Discret. Appl. Math. 283: 11-19 (2020) - [j7]Sergey V. Sidorov
Linear and Fisher Separability of Random Points in the d-Dimensional Spherical Layer and Inside the d-Dimensional Cube. Entropy 22(11): 1281 (2020) - 2019
- [j6]Nikolai Yu. Zolotykh
Two variations of graph test in double description method. Comput. Appl. Math. 38(3) (2019) - [j5]Antonio Candelieri, Ilaria Giordani, Francesco Archetti, Konstantin Barkalov
Tuning hyperparameters of a SVM-based water demand forecasting system through parallel global optimization. Comput. Oper. Res. 106: 202-209 (2019) - [j4]Aleksandr Yu. Chirkov, Dmitry V. Gribanov, Dmitriy S. Malyshev
On the complexity of quasiconvex integer minimization problem. J. Glob. Optim. 73(4): 761-788 (2019) - 2018
- [j3]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
Linear read-once and related Boolean functions. Discret. Appl. Math. 250: 16-27 (2018) - 2016
- [j2]Aleksandr Yu. Chirkov, Nikolai Yu. Zolotykh
On the Number of Irreducible Points in Polyhedra. Graphs Comb. 32(5): 1789-1803 (2016) - 2015
- [j1]Max A. Alekseyev
On the Minimal Teaching Sets of Two-Dimensional Threshold Functions. SIAM J. Discret. Math. 29(1): 157-165 (2015)
Conference and Workshop Papers
- 2020
- [c9]Sergey V. Sidorov
Linear and Fisher Separability of Random Points in the d-dimensional Spherical Layer. IJCNN 2020: 1-6 - 2019
- [c8]Evgeny Dolotov, Nikolai Yu. Zolotykh
Evolutionary Algorithms for Constructing an Ensemble of Decision Trees. AIST (Supplement) 2019: 9-15 - [c7]Sergey V. Sidorov
On the Linear Separability of Random Points in the d-dimensional Spherical Layer and in the d-dimensional Cube. IJCNN 2019: 1-4 - [c6]Sergey O. Semenov
A Dynamic Algorithm for Constructing the Dual Representation of a Polyhedral Cone. MOTOR 2019: 59-69 - [c5]Valentina Kustikova
Educational Course "Introduction to Deep Learning Using the Intel neon Framework". RuSCDays 2019: 554-562 - 2017
- [c4]Oleg Durandin
SyntaxNet Errors from the Linguistic Point of View. AIST 2017: 34-46 - [c3]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
Specifying a positive threshold function via extremal points. ALT 2017: 208-222 - 2013
- [c2]Konstantin Barkalov
SVM Regression Parameters Optimization Using Parallel Global Search Algorithm. PaCT 2013: 154-166 - 1998
- [c1]Valery N. Shevchenko, Nikolai Yu. Zolotykh
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries. ALT 1998: 61-71
Informal and Other Publications
- 2023
- [i14]Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Nikolai Yu. Zolotykh:
Faster Integer Points Counting in Parametric Polyhedra. CoRR abs/2310.13788 (2023) - 2022
- [i13]A. N. Kirdin, Sergey V. Sidorov
Rosenblatt's first theorem and frugality of deep learning. CoRR abs/2208.13778 (2022) - 2020
- [i12]Viktor A. Moskalenko, Nikolai Yu. Zolotykh, Grigory V. Osipov:
Deep Learning for ECG Segmentation. CoRR abs/2001.04689 (2020) - [i11]V. V. Kuznetsov, V. A. Moskalenko, Nikolai Yu. Zolotykh:
Electrocardiogram Generation and Feature Extraction Using a Variational Autoencoder. CoRR abs/2002.00254 (2020) - [i10]Evgeny Dolotov, Nikolai Yu. Zolotykh:
Evolutionary algorithms for constructing an ensemble of decision trees. CoRR abs/2002.00721 (2020) - [i9]Sergey V. Sidorov, Nikolai Yu. Zolotykh:
Linear and Fisher Separability of Random Points in the d-dimensional Spherical Layer. CoRR abs/2002.01306 (2020) - [i8]Dmitry V. Gribanov, Nikolai Yu. Zolotykh:
On lattice point counting in Δ-modular polyhedra. CoRR abs/2010.05768 (2020) - [i7]Sergey O. Semenov, Nikolai Yu. Zolotykh:
How to Find the Convex Hull of All Integer Points in a Polyhedron? CoRR abs/2010.13147 (2020) - [i6]Sergey I. Veselov, Dmitriy V. Gribanov, Nikolai Yu. Zolotykh, Aleksandr Yu. Chirkov:
A polynomial algorithm for minimizing discrete convic functions in fixed dimension. CoRR abs/2011.00598 (2020) - 2018
- [i5]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
Linear read-once and related Boolean functions. CoRR abs/1805.10159 (2018) - [i4]Aleksandr Yu. Chirkov, Dmitry V. Gribanov, Dmitriy S. Malyshev, Panos M. Pardalos, Sergey I. Veselov, Nikolai Yu. Zolotykh:
On the complexity of quasiconvex integer minimization problem. CoRR abs/1807.02790 (2018) - 2017
- [i3]Vadim V. Lozin, Igor Razgon, Victor Zamaraev
Specifying a positive threshold function via extremal points. CoRR abs/1706.01747 (2017) - 2013
- [i2]Max A. Alekseyev, Marina G. Basova, Nikolai Yu. Zolotykh:
The average cardinality of the minimal teaching set of a threshold function on a two-dimensional rectangular grid. CoRR abs/1307.1058 (2013) - [i1]Nikolai Yu. Zolotykh:
Alcuin's Propositiones de Civitatibus: the Earliest Packing Problems. CoRR abs/1308.0892 (2013)
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 21:26 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: