Search for persons
X
?
Towards a Hybrid, Flexible and Socially Engaged Higher Education; Lecture Notes in Networks and Systems ,
1
Methodology and Conceptual Model for Digital Accessibility ..:
, In:
?
XV International Scientific Conference "INTERAGROMASH 2022"; Lecture Notes in Networks and Systems ,
2
More on Bones Pathology Caused by Osteoporosis in Wolf (Can..:
, In:
?
XV International Scientific Conference "INTERAGROMASH 2022"; Lecture Notes in Networks and Systems ,
3
Morphological Characteristics of Atrioventricular Heart Val..:
, In:
?
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) ,
4
Factorial Lower Bounds for (Almost) Random Order Streams:
, In:
?
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) ,
5
Spectral Hypergraph Sparsifiers of Nearly Linear Size:
, In:
?
2022 International Conference Laser Optics (ICLO) ,
6
Investigation of the polymeric thin films deposed on the su..:
, In:
?
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) ,
7
Motif Cut Sparsifiers:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
8
Graph spanners by sketching in dynamic streams and the simu..:
, In:
?
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing ,
9
Towards tight bounds for spectral sparsification of hypergr..:
, In:
?
2021 International Conference on Electrical Engineering and Photonics (EExPolytech) ,
10
Algorithm for Constructing a Multidimensional Stability Dom..:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
11
Spectral clustering oracles in sublinear time:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
12
Spectral Clustering Oracles in Sublinear Time:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
13
Space Lower Bounds for Approximating Maximum Matching in th..:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
14
Space lower bounds for approximating maximum matching in th..:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
15