VLDB 2026 Research / reviewers in the wild / expert
Nikolai K. Krivulin
dblp:120/7698 · also Nikolai Krivulin
· DBLP profile ↗
10ranked-venue papers
9as first author
3since 2021 · last 2024
0000-0003-3070-9355ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 5 first-author · 1 since 2021Artificial intelligence and machine learning · 3 · 3 first-author · 2 since 2021Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Using Matrix Sparsification to Solve Tropical Linear Vector Equations
Nikolai K. Krivulin |
RAMiCS | 1 |
| 2024 | Application of tropical optimization for solving multicriteria problems of pairwise comparisons using log-Chebyshev approximation
Nikolai K. Krivulin |
Int. J. Approx. Reason. | 1 |
| 2024 | On solution of tropical discrete best approximation problems
Nikolai K. Krivulin |
Soft Comput. | 1 |
| 2020 | Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances
Nikolai K. Krivulin |
J. Log. Algebraic Methods Program. | 1 |
| 2019 | Tropical implementation of the Analytical Hierarchy Process decision method
Nikolai K. Krivulin, Sergei Sergeev |
Fuzzy Sets Syst. | 1 |
| 2018 | Algebraic Solution of Weighted Minimax Single-Facility Constrained Location Problems
Nikolai K. Krivulin |
RAMiCS | 1 |
| 2017 | Complete Solution of an Optimization Problem in Tropical Semifield
Nikolai K. Krivulin |
RAMiCS | 1 |
| 2015 | Solving a Tropical Optimization Problem via Matrix Sparsification
Nikolai K. Krivulin |
RAMiCS | 1 |
| 2014 | Complete Solution of a Constrained Tropical Optimization Problem with Application to Location Analysis
Nikolai K. Krivulin |
RAMiCS | 1 |
| 2007 | Average Network Blocking Probabilities for TDM WDM Optical Networks with OTSIs and without WCabstractPrevious works have considered analytical models of TDM wavelength networks to evaluate the blocking performance, but they differ in their underlying assumptions and have varying computation complexities. In this paper, we present an analytical model of TDM WDM optical networks with optical time-slot interchangers and without wavelength converter for minimum fixed hop routing. In order to make the analysis tractable, we proposed an algorithm that works for any number of partition patterns regardless of numbers of links, wavelengths in each link, and time-slots in each wavelength. Our analytical model provides good accuracies in average network blocking probabilities when compared with the simulation results. Cheah Huei Yoong, Pung Hung Keng, Nikolai K. Krivulin |
MASCOTS | 3 |