Riko Jacob

Publikation

Publikationer pr. år 2015 2016 2018 2019 2021 2022 2024 2024

• 11 Konferencebidrag i proceedings
• 3 Tidsskriftartikel
• 3 Konferenceartikel
• 1 Rapport
• 1 Mere
  • 1 Working paper

Publikationer pr. år

Publikationer pr. år

Søgeresultater

• 2024

  An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio

  Jacob, R. & Goswami, M., 24 jan. 2024, I: Leibniz International Proceedings in Informatics (LIPIcs). 287, s. 1-17 17 s.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning

  Åben adgang

  • Bichromatic 100%
  • Competitive Ratio 100%
  • Worst-case Performance 20%
  • Randomized Algorithms 20%
  • Sorting Algorithm 20%

• Finding the saddlepoint faster than sorting

  Jacob, R., Dallant, J., Haagensen, F., Kozma, L. & Wild, S., 2024, 2024 Symposium on Simplicity in Algorithms (SOSA). Society for Industrial and Applied Mathematics, s. 168 - 178 11 s.

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning

  Åben adgang

  • Sorted Matrices 100%
  • Feasibility Trial 100%
  • Iterated Logarithm 100%
  • Recursive Method 100%
  • Shor 100%

• On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting

  Jacob, R. & Goswami, M., aug. 2024, I: Leibniz International Proceedings in Informatics (LIPIcs). 317, s. 1-23 23 s.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

  Åben adgang

  • Optimal Algorithm 100%
  • Instance Optimal 100%
  • Optimality 100%
  • Competitive Ratio 100%
  • Cost Function 100%
• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  • Parallel Sorting 100%
  • Dislocation 100%
  • Comparison Errors 100%
  • Probability Theory 100%
  • Non-persistent 80%
• 2022

  Fragile complexity of adaptive algorithms

  Jacob, R., Fagerberg, R., Bose, P., Cano, P., Iacono, J. & Langerman, S., 5 jun. 2022, I: Theoretical Computer Science. 915, s. 92-102 11 s.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Fil

  • Adaptive Algorithm 100%
  • Fragile Complexity 100%
  • Minimum Element 50%
  • Log-log 25%
  • Algorithm Complexity 12%

• Universal Sorting: Finding a DAG using Priced Comparisons

  Jacob, R. & Goswami, M., 8 nov. 2022, 40 s.

  Publikation: Bog / Antologi / Rapport › Rapport › Forskning

  Åben adgang

  • Competitive Ratio 100%
  • Bichromatic 75%
  • Sorting Task 50%
  • Randomized Algorithms 25%
  • Optimal Algorithm 25%
• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Butterfly Network 100%
  • Non-atomic 100%
  • Fork-Join Model 100%
  • Memory Access 100%
  • Join Operation 100%

• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Adaptive Algorithm 100%
  • Fragile Complexity 100%
  • Minimum Element 50%
  • Algorithm Complexity 9%
  • Input Elements 9%
• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • I/O-complexity 100%
  • K-nearest 100%
  • Input/Output 100%
  • Polynomial Space 100%
  • Data Structure 50%
• 2019

  Dynamic Planar Convex Hull

  Jacob, R. & Brodal, G., 28 feb. 2019, 87 s.

  Publikation: Working paper › Forskning

  Åben adgang

  • Convex Hull 100%
  • Data Structure 100%
  • Extreme Points 40%
  • Computational Complexity 25%
  • Space Use 25%

• External memory priority queues with decrease-key and applications to graph algorithms

  Iacono, J., Jacob, R. & Tsakalidis, K., 7 mar. 2019, I: Leibniz International Proceedings in Informatics. s. 60:1–60:14 60.

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Konferenceartikel › Forskning › peer review

  Åben adgang

  Fil

  • Priority Queue 100%
  • External Memory 100%
  • Graph Algorithms 100%
  • Frac-N 100%
  • E-Value 100%

• 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 fuer Informatik GmbH, s. 2:1–2:19 2. (Leibniz International Proceedings in Informatics (LIPIcs)).

  Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Fragile Complexity 100%
  • Algorithm Comparison 100%
  • Comparator 100%
  • Computational Complexity 50%
  • Maximal Number 50%

• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Oblivious Data Structure 100%
  • Data Structure 100%
  • Search Tree 66%
  • Priority Queue 66%
  • Black Box 33%
• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Cache-oblivious 100%
  • Sparse Matrix multiplication 100%
  • Product Matrix 100%
  • Matrix (Mathematics) 100%
  • Sparse Matrix 100%

• Charting the Algorithmic Complexity of Waypoint Routing

  Akhoondian Amiri, S., Förster, K.-T., Jacob, R. & Schmid, S., jan. 2018, I: Computer Communications Review. 48, 1, s. 42-48

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Åben adgang

  Fil

  • Waypoint Routing 100%
  • Algorithmic Complexity 100%
  • Routing Problem 100%
  • Routing Model 66%
  • Computer Network 50%
• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • External Memory Model 100%
  • Asymmetric 100%
  • Symmetric Memories 50%
  • Sorting Algorithm 25%
  • Sparse Matrices 25%
• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Hierarchization 100%
  • Caching 100%
  • Cache Miss 100%
  • Optimal Alternative 100%
  • Communication Overhead 100%

• Global communication schemes for the numerical solution of high-dimensional PDEs

  Hupp, P., Heene, M., Jacob, R. & Pflüger, D., feb. 2016, I: Parallel Computing. 52, s. 78-105

  Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

  Fil

  • Global Communication 100%
  • High-dimensional PDEs 100%
  • Communication Scheme 100%
  • Numerical Solution 100%
  • Partial Differential Equation 100%
• 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 kapitel › Konferencebidrag i proceedings › Forskning › peer review

  Åben adgang

  Fil

  • Matrix multiplication 100%
  • Sensitive Matrix 100%
  • Output-sensitive 100%
  • Arithmetic Operations 100%
  • Matrix (Mathematics) 100%