Nikolai Yu. Zolotykh

Orcid: 0000-0003-4542-9233

Affiliations:
  • National Research Lobachevsky State University of Nizhni Novgorod, Russia
  • National Research University Higher School of Economics, Nizhni Novgorod, Russia


According to our database1, Nikolai Yu. Zolotykh authored at least 31 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems.
J. Glob. Optim., August, 2024

2023
Faster Integer Points Counting in Parametric Polyhedra.
CoRR, 2023

2022
How to find the convex hull of all integer points in a polyhedron?
Optim. Lett., 2022

On lattice point counting in $\varDelta $-modular polyhedra.
Optim. Lett., 2022

On Boolean threshold functions with minimum specification number.
Inf. Comput., 2022

Rosenblatt's First Theorem and Frugality of Deep Learning.
Entropy, 2022

Rosenblatt's first theorem and frugality of deep learning.
CoRR, 2022

2021
Accelerating Fourier-Motzkin elimination using bit pattern trees.
Optim. Methods Softw., 2021

2020
Linear and Fisher Separability of Random Points in the d-Dimensional Spherical Layer and Inside the d-Dimensional Cube.
Entropy, 2020

A polynomial algorithm for minimizing discrete convic functions in fixed dimension.
Discret. Appl. Math., 2020

On lattice point counting in Δ-modular polyhedra.
CoRR, 2020

Electrocardiogram Generation and Feature Extraction Using a Variational Autoencoder.
CoRR, 2020

Deep Learning for ECG Segmentation.
CoRR, 2020

LUDB: A New Open-Access Validation Tool for Electrocardiogram Delineation Algorithms.
IEEE Access, 2020

Linear and Fisher Separability of Random Points in the d-dimensional Spherical Layer.
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

2019
On the complexity of quasiconvex integer minimization problem.
J. Glob. Optim., 2019

Tuning hyperparameters of a SVM-based water demand forecasting system through parallel global optimization.
Comput. Oper. Res., 2019

Two variations of graph test in double description method.
Comput. Appl. Math., 2019

Educational Course "Introduction to Deep Learning Using the Intel neon Framework".
Proceedings of the Supercomputing, 2019

A Dynamic Algorithm for Constructing the Dual Representation of a Polyhedral Cone.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

On the Linear Separability of Random Points in the d-dimensional Spherical Layer and in the d-dimensional Cube.
Proceedings of the International Joint Conference on Neural Networks, 2019

Evolutionary Algorithms for Constructing an Ensemble of Decision Trees.
Proceedings of the Analysis of Images, Social Networks and Texts, 2019

2018
Linear read-once and related Boolean functions.
Discret. Appl. Math., 2018

2017
Specifying a positive threshold function via extremal points.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

SyntaxNet Errors from the Linguistic Point of View.
Proceedings of the Analysis of Images, Social Networks and Texts, 2017

2016
On the Number of Irreducible Points in Polyhedra.
Graphs Comb., 2016

2015
On the Minimal Teaching Sets of Two-Dimensional Threshold Functions.
SIAM J. Discret. Math., 2015

2013
Alcuin's Propositiones de Civitatibus: the Earliest Packing Problems.
CoRR, 2013

The average cardinality of the minimal teaching set of a threshold function on a two-dimensional rectangular grid.
CoRR, 2013

SVM Regression Parameters Optimization Using Parallel Global Search Algorithm.
Proceedings of the Parallel Computing Technologies - 12th International Conference, 2013

1998
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998


  Loading...