default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRiko Jacob
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c51]Mayank Goswami, Riko Jacob:
On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting. APPROX/RANDOM 2024: 23:1-23:23- [c50]Riko Jacob, Francesco Silvestri:
Unplugging Dijkstra's Algorithm as a Mechanical Device. CMSC 2024: 39-49 - [c49]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
An Optimal Randomized Algorithm for Finding the Saddlepoint. ESA 2024: 44:1-44:12 - [c48]Mayank Goswami, Riko Jacob:
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. ITCS 2024: 56:1-56:17 - [c47]Justin Dallant, Frederik Haagensen
, Riko Jacob, László Kozma, Sebastian Wild:
Finding the saddlepoint faster than sorting. SOSA 2024: 168-178 - [i14]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR abs/2401.06512 (2024) - 2023
- [c46]Michael T. Goodrich, Riko Jacob:
Optimal Parallel Sorting with Comparison Errors. SPAA 2023: 355-365 - [i13]Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild:
Finding the saddlepoint faster than sorting. CoRR abs/2310.16801 (2023) - [i12]Mayank Goswami, Riko Jacob:
An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio. CoRR abs/2311.05773 (2023) - 2022
- [j15]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919: 92-102 (2022) - [i11]Mayank Goswami, Riko Jacob:
Universal Sorting: Finding a DAG using Priced Comparisons. CoRR abs/2211.04601 (2022) - 2021
- [c45]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CIAC 2021: 144-157 - [c44]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: 2141-2153 - [i10]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CoRR abs/2102.00338 (2021) - 2020
- [c43]Mayank Goswami, Riko Jacob, Rasmus Pagh:
On the I/O Complexity of the k-Nearest Neighbors Problem. PODS 2020: 205-212 - [i9]Mayank Goswami, Riko Jacob, Rasmus Pagh:
On the I/O complexity of the k-nearest neighbor problem. CoRR abs/2002.04870 (2020)
2010 – 2019
- 2019
- [c42]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. ESA 2019: 2:1-2:19 - [c41]John Iacono, Riko Jacob, Konstantinos Tsakalidis:
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms. ESA 2019: 60:1-60:14 - [c40]Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen:
Lower Bounds for Oblivious Data Structures. SODA 2019: 2439-2447 - [i8]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. CoRR abs/1901.02857 (2019) - [i7]Riko Jacob, Gerth Stølting Brodal:
Dynamic Planar Convex Hull. CoRR abs/1902.11169 (2019) - [i6]John Iacono, Riko Jacob, Konstantinos Tsakalidis:
External memory priority queues with decrease-key and applications to graph algorithms. CoRR abs/1903.03147 (2019) - 2018
- [j14]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid:
Charting the Algorithmic Complexity of Waypoint Routing. Comput. Commun. Rev. 48(1): 42-48 (2018) - [c39]Matteo Dusefante, Riko Jacob:
Cache Oblivious Sparse Matrix Multiplication. LATIN 2018: 437-447 - [c38]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Mahmoud Parham, Stefan Schmid:
Waypoint Routing in Special Networks. Networking 2018: 496-504 - [i5]Riko Jacob, Kasper Green Larsen, Jesper Buus Nielsen:
Lower Bounds for Oblivious Data Structures. CoRR abs/1810.10635 (2018) - 2017
- [c37]Riko Jacob, Nodari Sitchinava:
Lower Bounds in the Asymmetric External Memory Model. SPAA 2017: 247-254 - [i4]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid:
Charting the Complexity Landscape of Waypoint Routing. CoRR abs/1705.00055 (2017) - 2016
- [j13]Philipp Hupp, Mario Heene, Riko Jacob, Dirk Pflüger:
Global communication schemes for the numerical solution of high-dimensional PDEs. Parallel Comput. 52: 78-105 (2016) - [r3]Riko Jacob, Ulrich Meyer, Laura Toma:
List Ranking. Encyclopedia of Algorithms 2016: 1117-1121 - [r2]Riko Jacob:
Shortest Paths Approaches for Timetable Information. Encyclopedia of Algorithms 2016: 1969-1971 - 2015
- [c36]Riko Jacob, Morten Stöckel:
Fast Output-Sensitive Matrix Multiplication. ESA 2015: 766-778 - 2014
- [j12]Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig:
SKIP+: A Self-Stabilizing Skip Graph. J. ACM 61(6): 36:1-36:26 (2014) - [j11]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): 110-135 (2014) - [c35]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: 423-434 - [c34]Riko Jacob, Tobias Lieber, Matthias Mnich:
Treewidth Computation and Kernelization in the Parallel External Memory Model. IFIP TCS 2014: 78-89 - [c33]Riko Jacob, Tobias Lieber, Nodari Sitchinava:
On the Complexity of List Ranking in the Parallel External Memory Model. MFCS (2) 2014: 384-395 - [i3]Riko Jacob, Tobias Lieber, Nodari Sitchinava:
On the Complexity of List Ranking in the Parallel External Memory Model. CoRR abs/1406.3279 (2014) - 2013
- [c32]Philipp Hupp, Riko Jacob, Mario Heene, Dirk Pflüger, Markus Hegland:
Global Communication Schemes for the Sparse Grid Combination Technique. PARCO 2013: 564-573 - [c31]Philipp Hupp, Riko Jacob:
Tight Bounds for Low Dimensional Star Stencils in the External Memory Model. WADS 2013: 415-426 - 2012
- [j10]Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid:
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theor. Comput. Sci. 457: 137-148 (2012) - [c30]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: 195-202 - [c29]Gero Greiner, Riko Jacob:
The Efficiency of MapReduce in Parallel External Memory. LATIN 2012: 433-445 - [i2]Philipp Hupp, Riko Jacob:
Tight Bounds for Low Dimensional Star Stencils in the External Memory Model. CoRR abs/1205.0606 (2012) - 2011
- [j9]Riko Jacob, Peter Márton, Jens Maue, Marc Nunkesser:
Multistage methods for freight train classification. Networks 57(1): 87-105 (2011) - [c28]Riko Jacob, Tobias Scheffel, Georg Ziegler, Martin Bichler:
Hierarchical Package Bidding: Computational Complexity and Bidder Behavior. AMMA 2011: 36-37 - [i1]Gero Greiner, Riko Jacob:
The Efficiency of MapReduce in Parallel External Memory. CoRR abs/1112.3765 (2011) - 2010
- [j8]Jörg Derungs, Riko Jacob, Peter Widmayer:
Approximate Shortest Paths Guided by a Small Index. Algorithmica 57(4): 668-688 (2010) - [j7]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): 934-962 (2010) - [c27]Gero Greiner, Riko Jacob:
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication. LATIN 2010: 143-156 - [c26]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: 294-305 - [c25]Gero Greiner, Riko Jacob:
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model. MFCS 2010: 393-404
2000 – 2009
- 2009
- [c24]Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid:
A Self-stabilizing and Local Delaunay Graph Construction. ISAAC 2009: 771-780 - [c23]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: 131-140 - [c22]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: 781-782 - [c21]Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz:
On Computational Models for Flash Memory Devices. SEA 2009: 16-27 - 2008
- [j6]Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser:
Sequential vector packing. Theor. Comput. Sci. 409(3): 351-363 (2008) - [r1]Riko Jacob:
Shortest Paths Approaches for Timetable Information. Encyclopedia of Algorithms 2008 - 2007
- [j5]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): 269-298 (2007) - [j4]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): 3016-3023 (2007) - [c20]Riko Jacob, Peter Márton, Jens Maue, Marc Nunkesser:
Multistage Methods for Freight Train Classification. ATMOS 2007 - [c19]Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser:
Sequential Vector Packing. ESCAPE 2007: 12-23 - [c18]Riko Jacob:
Optimal Randomized Comparison Based Algorithms for Collision. MFCS 2007: 703-714 - [c17]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: 61-70 - [c16]Jörg Derungs, Riko Jacob, Peter Widmayer:
Approximate Shortest Paths Guided by a Small Index. WADS 2007: 553-564 - 2006
- [c15]Riko Jacob, Matthias Müller-Hannemann:
ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways. ATMOS 2006 - [c14]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 - [e1]Riko Jacob, Matthias Müller-Hannemann:
ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, September 14, 2006, ETH Zürich, Zurich, Switzerland, Selected Papers. OASIcs 6, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - 2005
- [c13]Michael Gatto, Riko Jacob, Leon Peeters, Anita Schöbel:
The Computational Complexity of Delay Management. WG 2005: 227-238 - 2004
- [j3]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: 41-70 (2004) - [c12]Michael Gatto, Riko Jacob, Leon Peeters, Peter Widmayer:
Online Delay Management on a Single Train Line. ATMOS 2004: 306-320 - [c11]Riko Jacob, Dirk Koschützki, Katharina Anna Lehmann, Leon Peeters, Dagmar Tenfelde-Podehl:
Algorithms for Centrality Indices. Network Analysis 2004: 62-82 - [c10]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281 - [c9]Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer:
Railway Delay Management: Exploring Its Algorithmic Complexity. SWAT 2004: 199-211 - [c8]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
Joint Base Station Scheduling. WAOA 2004: 225-238 - 2003
- [c7]Gerth Stølting Brodal, Riko Jacob:
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. ATMOS 2003: 3-15 - 2002
- [c6]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: 126-138 - [c5]Gerth Stølting Brodal, Riko Jacob:
Dynamic Planar Convex Hull. FOCS 2002: 617-626 - [c4]Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob:
Cache oblivious search trees via binary trees of small height. SODA 2002: 39-48 - 2000
- [j2]Christopher L. Barrett, Riko Jacob, Madhav V. Marathe:
Formal-Language-Constrained Path Problems. SIAM J. Comput. 30(3): 809-837 (2000) - [c3]Gerth Stølting Brodal, Riko Jacob:
Dynamic Planar Convex Hull with Optimal Query Time. SWAT 2000: 57-70
1990 – 1999
- 1999
- [j1]Riko Jacob, Madhav V. Marathe, Kai Nagel:
A Computational Study of Routing Algorithms for Realistic Transportation Networks. ACM J. Exp. Algorithmics 4: 6 (1999) - 1998
- [c2]Christopher L. Barrett, Riko Jacob, Madhav V. Marathe:
Formal Language Constrained Path Problems. SWAT 1998: 234-245 - [c1]Riko Jacob, Madhav V. Marathe, Kai Nagel:
A Computational Study of Routing Algorithms for Realistic Transportation Networks. WAE 1998: 167-178
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
