| Slim graph: Practical lossy graph compression for approximate graph processing, storage, and analytics M Besta, S Weber, L Gianinazzi, R Gerstenberger, A Ivanov, Y Oltchik, ... Proceedings of the International Conference for High Performance Computing …, 2019 | 32 | 2019 |
| Network topologies and inevitable contention G Ballard, J Demmel, A Gearhart, B Lipshitz, Y Oltchik, O Schwartz, ... 2016 First International Workshop on Communication Optimizations in HPC …, 2016 | 9 | 2016 |
| Parametric Graph Templates: Properties and Algorithms T Ben-Nun, L Gianinazzi, T Hoefler, Y Oltchik arXiv preprint arXiv:2011.07001, 2020 | 2 | 2020 |
| Network Partitioning and Avoidable Contention Y Oltchik, O Schwartz Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 2 | 2020 |
| Maximum Flows in Parametric Graph Templates T Ben-Nun, L Gianinazzi, T Hoefler, Y Oltchik International Conference on Algorithms and Complexity, 97-111, 2023 | | 2023 |
| Brief Announcement: Network Partitioning and Avoidable Contention Y Oltchik, O Schwartz | | 2020 |
| HU DB at TREC 2014 Microblog Track. J Klein, Y Oltchik, N Or, S Cohen, HEBREW UNIV JERUSALEM (ISRAEL) TREC, 2014 | | 2014 |
Oded SchwartzHebrew UniversityVerified email at cs.huji.ac.il
