Research output per year
Research output per year
- 19 results
Search results
-
2024
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio
Jacob, R. & Goswami, M., 24 Jan 2024, In: Leibniz International Proceedings in Informatics (LIPIcs). 287, p. 1-17 17 p.Research output: Journal Article or Conference Article in Journal › Conference article › Research
Open Access -
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, p. 168 - 178 11 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research
Open Access -
On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
Jacob, R. & Goswami, M., Aug 2024, In: Leibniz International Proceedings in Informatics (LIPIcs). 317, p. 1-23 23 p.Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review
Open Access -
2023
Optimal Parallel Sorting with Comparison Errors
Jacob, R. & Goodrich, M. T., 17 Jun 2023, Proceedings SPAA '23. Association for Computing Machinery, p. 355-365 11 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open Access -
2022
Fragile complexity of adaptive algorithms
Jacob, R., Fagerberg, R., Bose, P., Cano, P., Iacono, J. & Langerman, S., 5 Jun 2022, In: Theoretical Computer Science. 915, p. 92-102 11 p.Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
File -
Universal Sorting: Finding a DAG using Priced Comparisons
Jacob, R. & Goswami, M., 8 Nov 2022, 40 p.Research output: Book / Anthology / Report › Report › Research
Open Access -
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, p. 2141-2153 13 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Fragile Complexity of Adaptive Algorithms
Jacob, R., Fagerberg, R., Bose, P., Cano, P., Iacono, J. & Langerman, S., 10 May 2021, International Conference on Algorithms and Complexity. Springer, Vol. LNCS 12701. p. 144-157 14 p. (LNCS, Vol. 12701).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
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, p. 205-212 (ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
2019
Dynamic Planar Convex Hull
Jacob, R. & Brodal, G., 28 Feb 2019, 87 p.Research output: Working paper › Research
Open Access -
External memory priority queues with decrease-key and applications to graph algorithms
Iacono, J., Jacob, R. & Tsakalidis, K., 7 Mar 2019, In: Leibniz International Proceedings in Informatics. p. 60:1–60:14 60.Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review
Open AccessFile -
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 Sept 2019, 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 2:1–2:19 2. (Leibniz International Proceedings in Informatics (LIPIcs)).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
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 MathematicsResearch output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
2018
Cache Oblivious Sparse Matrix Multiplication
Dusefante, M. & Jacob, R., 13 Mar 2018, Latin American Symposium on Theoretical Informatics: LATIN 2018: Theoretical Informatics . Springer, p. 437-447 (Lecture Notes in Computer Science, Vol. 10807).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Charting the Algorithmic Complexity of Waypoint Routing
Akhoondian Amiri, S., Förster, K.-T., Jacob, R. & Schmid, S., Jan 2018, In: Computer Communications Review. 48, 1, p. 42-48Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
Open AccessFile -
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, p. 247-254Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
2016
A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm
Hupp, P. & Jacob, R., 17 Mar 2016, Sparse Grids and Applications - Stuttgart 2014. Springer, p. 103-132 (Lecture Notes in Computational Science and Engineering, Vol. 109).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile -
Global communication schemes for the numerical solution of high-dimensional PDEs
Hupp, P., Heene, M., Jacob, R. & Pflüger, D., Feb 2016, In: Parallel Computing. 52, p. 78-105Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review
File -
2015
Fast Output-sensitive Matrix Multiplication
Jacob, R. & Stöckel, M., 14 Sept 2015, Algorithms - ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Springer, p. 766-778 12 p. (Lecture Notes in Computer Science, Vol. 9294).Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
Open AccessFile