Riko Jacob

According to our database1, Riko Jacob authored at least 54 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the I/O complexity of the k-nearest neighbor problem.
CoRR, 2020

2019
Lower Bounds for Oblivious Data Structures.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Fragile Complexity of Comparison-Based Algorithms.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Charting the Algorithmic Complexity of Waypoint Routing.
Computer Communication Review, 2018

Waypoint Routing in Special Networks.
Proceedings of the 17th International IFIP TC6 Networking Conference, 2018

Cache Oblivious Sparse Matrix Multiplication.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Charting the Complexity Landscape of Waypoint Routing.
CoRR, 2017

Lower Bounds in the Asymmetric External Memory Model.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
List Ranking.
Encyclopedia of Algorithms, 2016

Shortest Paths Approaches for Timetable Information.
Encyclopedia of Algorithms, 2016

Global communication schemes for the numerical solution of high-dimensional PDEs.
Parallel Computing, 2016

2015
Fast Output-Sensitive Matrix Multiplication.
Proceedings of the Algorithms - ESA 2015, 2015

2014
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
Theory Comput. Syst., 2014

SKIP+: A Self-Stabilizing Skip Graph.
J. ACM, 2014

On the Complexity of List Ranking in the Parallel External Memory Model.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Treewidth Computation and Kernelization in the Parallel External Memory Model.
Proceedings of the Theoretical Computer Science, 2014

Data Delivery by Energy-Constrained Mobile Agents on a Line.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Tight Bounds for Low Dimensional Star Stencils in the External Memory Model.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Global Communication Schemes for the Sparse Grid Combination Technique.
Proceedings of the Parallel Computing: Accelerating Computational Science and Engineering (CSE), 2013

2012
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs.
Theor. Comput. Sci., 2012

The Efficiency of MapReduce in Parallel External Memory.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms.
Proceedings of the 11th International Symposium on Parallel and Distributed Computing, 2012

2011
Multistage methods for freight train classification.
Networks, 2011

Hierarchical Package Bidding: Computational Complexity and Bidder Behavior.
Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011

2010
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Theory Comput. Syst., 2010

Approximate Shortest Paths Guided by a Small Index.
Algorithmica, 2010

Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The I/O Complexity of Sparse Matrix Dense Matrix Multiplication.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
On Computational Models for Flash Memory Devices.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.
Proceedings of the Stabilization, 2009

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

A Self-stabilizing and Local Delaunay Graph Construction.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Shortest Paths Approaches for Timetable Information.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Sequential vector packing.
Theor. Comput. Sci., 2008

2007
PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra.
Bioinformatics, 2007

An Algorithmic View on OVSF Code Assignment.
Algorithmica, 2007

Optimal Randomized Comparison Based Algorithms for Collision.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
ATMOS 2006 Abstracts Collection - Presentations at the 6th Workshop on Algorithmic Methods and Models for Optimization of Railways.
Proceedings of the ATMOS 2006, 2006

ATMOS 2006 Preface - Algorithmic Methods and Models for Optimization of Railways.
Proceedings of the ATMOS 2006, 2006

2005
The Computational Complexity of Delay Management.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries.
Electr. Notes Theor. Comput. Sci., 2004

Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics).
Bulletin of the EATCS, 2004

Joint Base Station Scheduling.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Railway Delay Management: Exploring Its Algorithmic Complexity.
Proceedings of the Algorithm Theory, 2004

Algorithms for Centrality Indices.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

Online Delay Management on a Single Train Line.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2002
Cache oblivious search trees via binary trees of small height.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Dynamic Planar Convex Hull.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router.
Proceedings of the Algorithms, 2002

2000
Formal-Language-Constrained Path Problems.
SIAM J. Comput., 2000

Dynamic Planar Convex Hull with Optimal Query Time.
Proceedings of the Algorithm Theory, 2000

1999
A Computational Study of Routing Algorithms for Realistic Transportation Networks.
ACM Journal of Experimental Algorithmics, 1999


  Loading...