Riko Jacob

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 26

Top Topics

Matrix Multiplication

Noise Cancellation

External Memory

Nearest Neighbor

Top Venues

Publications

Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR (2024)
Mayank Goswami, Riko Jacob
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. ITCS (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
Finding the saddlepoint faster than sorting. SOSA (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
Finding the saddlepoint faster than sorting. CoRR (2023)
Michael T. Goodrich, Riko Jacob
Optimal Parallel Sorting with Comparison Errors. SPAA (2023)
Mayank Goswami, Riko Jacob
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. CoRR (2023)
Mayank Goswami, Riko Jacob
Universal Sorting: Finding a DAG using Priced Comparisons. CoRR (2022)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919 (2022)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile Complexity of Adaptive Algorithms. CoRR (2021)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile Complexity of Adaptive Algorithms. CIAC (2021)
Michael T. Goodrich, Riko Jacob, Nodari Sitchinava
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. SODA (2021)
Mayank Goswami, Riko Jacob, Rasmus Pagh
On the I/O complexity of the k-nearest neighbor problem. CoRR (2020)
Mayank Goswami, Riko Jacob, Rasmus Pagh
On the I/O Complexity of the k-Nearest Neighbors Problem. PODS (2020)
John Iacono, Riko Jacob, Konstantinos Tsakalidis
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. ESA (2019)
Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen
Lower Bounds for Oblivious Data Structures. SODA (2019)
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
Fragile Complexity of Comparison-Based Algorithms. ESA (2019)
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
Fragile Complexity of Comparison-Based Algorithms. CoRR (2019)
Riko Jacob, Gerth Stølting Brodal
Dynamic Planar Convex Hull. CoRR (2019)
John Iacono, Riko Jacob, Konstantinos Tsakalidis
External memory priority queues with decrease-key and applications to graph algorithms. CoRR (2019)
Matteo Dusefante, Riko Jacob
Cache Oblivious Sparse Matrix Multiplication. LATIN (2018)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Mahmoud Parham, Stefan Schmid
Waypoint Routing in Special Networks. Networking (2018)
Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen
Lower Bounds for Oblivious Data Structures. CoRR (2018)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid
Charting the Algorithmic Complexity of Waypoint Routing. Comput. Commun. Rev. 48 (1) (2018)
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid
Charting the Complexity Landscape of Waypoint Routing. CoRR (2017)
Riko Jacob, Nodari Sitchinava
Lower Bounds in the Asymmetric External Memory Model. SPAA (2017)
Philipp Hupp, Mario Heene, Riko Jacob, Dirk Pflüger
Global communication schemes for the numerical solution of high-dimensional PDEs. Parallel Comput. 52 (2016)
Riko Jacob, Morten Stöckel
Fast Output-Sensitive Matrix Multiplication. ESA (2015)
Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
: A Self-Stabilizing Skip Graph. J. ACM 61 (6) (2014)
Riko Jacob, Tobias Lieber, Nodari Sitchinava
On the Complexity of List Ranking in the Parallel External Memory Model. MFCS (2) (2014)
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory Comput. Syst. 55 (1) (2014)
Riko Jacob, Tobias Lieber, Nodari Sitchinava
On the Complexity of List Ranking in the Parallel External Memory Model. CoRR (2014)
Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer
Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) (2014)
Riko Jacob, Tobias Lieber, Matthias Mnich
Treewidth Computation and Kernelization in the Parallel External Memory Model. IFIP TCS (2014)
Philipp Hupp, Riko Jacob
Tight Bounds for Low Dimensional Star Stencils in the External Memory Model. WADS (2013)
Philipp Hupp, Riko Jacob, Mario Heene, Dirk Pflüger, Markus Hegland
Global Communication Schemes for the Sparse Grid Combination Technique. PARCO (2013)
Gero Greiner, Riko Jacob
The Efficiency of MapReduce in Parallel External Memory. LATIN (2012)
Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theor. Comput. Sci. 457 (2012)
Philipp Hupp, Riko Jacob
Tight Bounds for Low Dimensional Star Stencils in the External Memory Model CoRR (2012)
Gerrit Buse, Dirk Pflüger, Alin Florindor Murarasu, Riko Jacob
A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms. ISPDC (2012)
Riko Jacob, Peter Marton, Jens Maue, Marc Nunkesser
Multistage methods for freight train classification. Networks 57 (1) (2011)
Gero Greiner, Riko Jacob
The Efficiency of MapReduce in Parallel External Memory CoRR (2011)
Riko Jacob, Tobias Scheffel, Georg Ziegler, Martin Bichler
Hierarchical Package Bidding: Computational Complexity and Bidder Behavior. AMMA (2011)
Gero Greiner, Riko Jacob
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication. LATIN (2010)
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. Theory Comput. Syst. 47 (4) (2010)
Jörg Derungs, Riko Jacob, Peter Widmayer
Approximate Shortest Paths Guided by a Small Index. Algorithmica 57 (4) (2010)
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. LATIN (2010)
Gero Greiner, Riko Jacob
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model. MFCS (2010)
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz
On Computational Models for Flash Memory Devices. SEA (2009)
Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. PODC (2009)
Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. SSS (2009)
Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid
A Self-stabilizing and Local Delaunay Graph Construction. ISAAC (2009)
Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser
Sequential vector packing. Theor. Comput. Sci. 409 (3) (2008)
Riko Jacob
Optimal Randomized Comparison Based Algorithms for Collision. MFCS (2007)
Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
An Algorithmic View on OVSF Code Assignment. Algorithmica 47 (3) (2007)
Riko Jacob, Peter Marton, Jens Maue, Marc Nunkesser
Multistage Methods for Freight Train Classification. ATMOS (2007)
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari
Optimal sparse matrix dense vector multiplication in the I/O-model. SPAA (2007)
Jörg Derungs, Riko Jacob, Peter Widmayer
Approximate Shortest Paths Guided by a Small Index. WADS (2007)
Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser
Sequential Vector Packing. ESCAPE (2007)
Franz F. Roos, Riko Jacob, Jonas Grossmann, Bernd Fischer, Joachim M. Buhmann, Wilhelm Gruissem, Sacha Baginsky, Peter Widmayer
PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra. Bioinform. 23 (22) (2007)
Riko Jacob, Matthias Müller-Hannemann
ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways. ATMOS (2006)
Riko Jacob, Matthias Müller-Hannemann
ATMOS 2006 Abstracts Collection - Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways. ATMOS (2006)
Michael Gatto, Riko Jacob, Leon Peeters, Anita Schöbel
The Computational Complexity of Delay Management. WG (2005)
Michael Gatto, Riko Jacob, Leon Peeters, Birgitta Weber, Peter Widmayer
Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics). Bull. EATCS 84 (2004)
Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer
Railway Delay Management: Exploring Its Algorithmic Complexity. SWAT (2004)
Riko Jacob, Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Dagmar Tenfelde-Podehl
Algorithms for Centrality Indices. Network Analysis (2004)
Gerth Stølting Brodal, Riko Jacob
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. Electron. Notes Theor. Comput. Sci. 92 (2004)
Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
An Algorithmic View on OVSF Code Assignment. STACS (2004)
Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
Joint Base Station Scheduling. WAOA (2004)
Michael Gatto, Riko Jacob, Leon Peeters, Peter Widmayer
Online Delay Management on a Single Train Line. ATMOS (2004)
Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. ESA (2002)
Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob
Cache oblivious search trees via binary trees of small height. SODA (2002)
Gerth Stølting Brodal, Riko Jacob
Dynamic Planar Convex Hull. FOCS (2002)
Gerth Stølting Brodal, Riko Jacob
Dynamic Planar Convex Hull with Optimal Query Time. SWAT (2000)
Christopher L. Barrett, Riko Jacob, Madhav V. Marathe
Formal-Language-Constrained Path Problems. SIAM J. Comput. 30 (3) (2000)
Riko Jacob, Madhav V. Marathe, Kai Nagel
A Computational Study of Routing Algorithms for Realistic Transportation Networks. ACM J. Exp. Algorithmics 4 (1999)
Christopher L. Barrett, Riko Jacob, Madhav V. Marathe
Formal Language Constrained Path Problems. SWAT (1998)
Riko Jacob, Madhav V. Marathe, Kai Nagel
A Computational Study of Routing Algorithms for Realistic Transportation Networks. WAE (1998)