Filter
Konferencebidrag i proceedings

Søgeresultater

  • 2023

    Optimal Parallel Sorting with Comparison Errors

    Jacob, R. & Goodrich, M. T., 17 jun. 2023, Proceedings SPAA '23. Association for Computing Machinery, s. 355-365 11 s.

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • 2021

    Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model

    Jacob, R., Sitchinava, N. & Goodrich, M. T., 14 jan. 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, s. 2141-2153 13 s.

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • Fragile Complexity of Adaptive Algorithms

    Jacob, R., Fagerberg, R., Bose, P., Cano, P., Iacono, J. & Langerman, S., 10 maj 2021, International Conference on Algorithms and Complexity. Springer, Bind LNCS 12701. s. 144-157 14 s. (LNCS, Bind 12701).

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • 2020

    On the I/O Complexity of the k-Nearest Neighbors Problem

    Goswami, M., Jacob, R. & Pagh, R., jun. 2020, PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. Association for Computing Machinery, s. 205-212 (ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems).

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • 2019

    Fragile Complexity of Comparison-Based Algorithms

    Afshani, P., Fagerberg, R., Hammer, D. M. G., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M. & Sitchinava, N., 9 sep. 2019, 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, s. 2:1–2:19 2. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • Lower Bounds for Oblivious Data Structures

    Jacob, R., Larsen, K. G. & Nielsen, J. B., 6 jan. 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • 2018

    Cache Oblivious Sparse Matrix Multiplication

    Dusefante, M. & Jacob, R., 13 mar. 2018, Latin American Symposium on Theoretical Informatics: LATIN 2018: Theoretical Informatics . Springer, s. 437-447 (Lecture Notes in Computer Science, Bind 10807).

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • 2017

    Lower Bounds in the Asymmetric External Memory Model

    Jacob, R. & Sitchinava, N., jul. 2017, SPAA '17 Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures . Association for Computing Machinery, s. 247-254

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • 2016

    A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm

    Hupp, P. & Jacob, R., 17 mar. 2016, Sparse Grids and Applications - Stuttgart 2014. Springer, s. 103-132 (Lecture Notes in Computational Science and Engineering, Bind 109).

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
  • 2015

    Fast Output-sensitive Matrix Multiplication

    Jacob, R. & Stöckel, M., 14 sep. 2015, Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, s. 766-778 12 s. (Lecture Notes in Computer Science, Bind 9294).

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil