Riko Jacob

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

An Optimal Randomized Algorithm for Finding the Saddlepoint.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Unplugging Dijkstra's Algorithm as a Mechanical Device.

[BibT_eX]

[DOI]

Francesco Silvestri

Proceedings of the Creative Mathematical Sciences Communication: 7th International Conference, 2024

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

Optimal Parallel Sorting with Comparison Errors.

[BibT_eX]

[DOI]

Michael T. Goodrich

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022

Fragile complexity of adaptive algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Universal Sorting: Finding a DAG using Priced Comparisons.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model.

[BibT_eX]

[DOI]

Michael T. Goodrich

Nodari Sitchinava

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

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

[BibT_eX]

[DOI]

Rasmus Pagh

CoRR, 2020

On the I/O Complexity of the k-Nearest Neighbors Problem.

[BibT_eX]

[DOI]

Rasmus Pagh

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

2019

Lower Bounds for Oblivious Data Structures.

[BibT_eX]

[DOI]

Kasper Green Larsen

Jesper Buus Nielsen

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms.

[BibT_eX]

[DOI]

John Iacono

Konstantinos Tsakalidis

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Fragile Complexity of Comparison-Based Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Charting the Algorithmic Complexity of Waypoint Routing.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Klaus-Tycho Foerster

Stefan Schmid

Comput. Commun. Rev., 2018

Waypoint Routing in Special Networks.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Proceedings of the 2018 IFIP Networking Conference and Workshops, 2018

Cache Oblivious Sparse Matrix Multiplication.

[BibT_eX]

[DOI]

Matteo Dusefante

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Charting the Complexity Landscape of Waypoint Routing.

[BibT_eX]

[DOI]

Saeed Akhoondian Amiri

Klaus-Tycho Foerster

Stefan Schmid

CoRR, 2017

Lower Bounds in the Asymmetric External Memory Model.

[BibT_eX]

[DOI]

Nodari Sitchinava

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016

List Ranking.

[BibT_eX]

[DOI]

Ulrich Meyer

Laura Toma

Encyclopedia of Algorithms, 2016

Shortest Paths Approaches for Timetable Information.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Global communication schemes for the numerical solution of high-dimensional PDEs.

[BibT_eX]

[DOI]

Parallel Comput., 2016

2015

Fast Output-Sensitive Matrix Multiplication.

[BibT_eX]

[DOI]

Morten Stöckel

Proceedings of the Algorithms - ESA 2015, 2015

2014

A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

SKIP<sup>+</sup>: A Self-Stabilizing Skip Graph.

[BibT_eX]

[DOI]

J. ACM, 2014

On the Complexity of List Ranking in the Parallel External Memory Model.

[BibT_eX]

[DOI]

Tobias Lieber

Nodari Sitchinava

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Treewidth Computation and Kernelization in the Parallel External Memory Model.

[BibT_eX]

[DOI]

Tobias Lieber

Matthias Mnich

Proceedings of the Theoretical Computer Science, 2014

Data Delivery by Energy-Constrained Mobile Agents on a Line.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Tight Bounds for Low Dimensional Star Stencils in the External Memory Model.

[BibT_eX]

[DOI]

Philipp Hupp

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Global Communication Schemes for the Sparse Grid Combination Technique.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

The Efficiency of MapReduce in Parallel External Memory.

[BibT_eX]

[DOI]

Gero Greiner

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms.

[BibT_eX]

[DOI]

Gerrit Buse

Dirk Pflüger

Alin Florindor Murarasu

Proceedings of the 11th International Symposium on Parallel and Distributed Computing, 2012

2011

Multistage methods for freight train classification.

[BibT_eX]

[DOI]

Networks, 2011

Hierarchical Package Bidding: Computational Complexity and Bidder Behavior.

[BibT_eX]

[DOI]

Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011

2010

Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.

[BibT_eX]

[DOI]

Michael A. Bender

Rolf Fagerberg

Elias Vicari

Theory Comput. Syst., 2010

Approximate Shortest Paths Guided by a Small Index.

[BibT_eX]

[DOI]

Jörg Derungs

Peter Widmayer

Algorithmica, 2010

Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model.

[BibT_eX]

[DOI]

Gero Greiner

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

The I/O Complexity of Sparse Matrix Dense Matrix Multiplication.

[BibT_eX]

[DOI]

Gero Greiner

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

On Computational Models for Flash Memory Devices.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

A Self-stabilizing and Local Delaunay Graph Construction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Shortest Paths Approaches for Timetable Information.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Sequential vector packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

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

[BibT_eX]

[DOI]

Bioinform., 2007

An Algorithmic View on OVSF Code Assignment.

[BibT_eX]

[DOI]

Algorithmica, 2007

Optimal Randomized Comparison Based Algorithms for Collision.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

Proceedings of the ATMOS 2006, 2006

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

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

Proceedings of the ATMOS 2006, 2006

2005

The Computational Complexity of Delay Management.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004

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

[BibT_eX]

Bull. EATCS, 2004

Joint Base Station Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Railway Delay Management: Exploring Its Algorithmic Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Algorithms for Centrality Indices.

[BibT_eX]

[DOI]

Dirk Koschützki

Katharina Anna Lehmann

Leon Peeters

Dagmar Tenfelde-Podehl

Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

Online Delay Management on a Single Train Line.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2003

Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

2002

Cache oblivious search trees via binary trees of small height.

[BibT_eX]

[DOI]

Rolf Fagerberg

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Dynamic Planar Convex Hull.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Christopher L. Barrett

Proceedings of the Algorithms, 2002

2000

Formal-Language-Constrained Path Problems.

[BibT_eX]

[DOI]

Christopher L. Barrett

Madhav V. Marathe

SIAM J. Comput., 2000

Dynamic Planar Convex Hull with Optimal Query Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

1999

A Computational Study of Routing Algorithms for Realistic Transportation Networks.

[BibT_eX]

[DOI]