( en | de | ru )

 

Disambiguation of "Jacob, Riko"

Author of the publication

copydeleteadd this publication to your clipboard
On Computational Models for Flash Memory Devices.

, , , , and . SEA, volume 5526 of Lecture Notes in Computer Science, page 16-27. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Riko Jacob

Riko Rosman

Aegidius Rikowski

Eckhard Rikowski

Riko Wichmann

 

Other publications of authors with the same name

Tight Bounds for Low Dimensional Star Stencils in the External Memory Model., and . WADS, volume 8037 of Lecture Notes in Computer Science, page 415-426. Springer, (2013)Cache oblivious search trees via binary trees of small height., , and . SODA, page 39-48. ACM/SIAM, (2002)Fast Output-Sensitive Matrix Multiplication., and . ESA, volume 9294 of Lecture Notes in Computer Science, page 766-778. Springer, (2015)An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio., and . ITCS, volume 287 of LIPIcs, page 56:1-56:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router., , , , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 126-138. Springer, (2002)Dynamic Planar Convex Hull., and . CoRR, (2019)Formal Language Constrained Path Problems., , and . SWAT, volume 1432 of Lecture Notes in Computer Science, page 234-245. Springer, (1998)Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model., , , , and . Theory Comput. Syst., 47 (4): 934-962 (2010)On the I/O complexity of the k-nearest neighbor problem., , and . CoRR, (2020)On the I/O Complexity of the k-Nearest Neighbors Problem., , and . PODS, page 205-212. ACM, (2020)