| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7788466 (Why is no real title available?) | 2024-01-15 | Paper |
| Finding the saddlepoint faster than sorting | 2023-10-25 | Paper |
Fragile complexity of adaptive algorithms
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Formal language constrained path problems
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Fragile complexity of comparison-based algorithms
(available as arXiv preprint) | 2022-05-11 | Paper |
| scientific article; zbMATH DE number 7525497 (Why is no real title available?) | 2022-05-11 | Paper |
Fragile complexity of adaptive algorithms
Theoretical Computer Science | 2022-05-10 | Paper |
| Cache oblivious sparse matrix multiplication | 2020-02-12 | Paper |
Lower bounds for oblivious data structures
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A cache-optimal alternative to the unidirectional hierarchization algorithm
Lecture Notes in Computational Science and Engineering | 2016-05-26 | Paper |
Fast Output-Sensitive Matrix Multiplication
Algorithms - ESA 2015 | 2015-11-19 | Paper |
\(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
Journal of the ACM | 2015-08-14 | Paper |
Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids
Lecture Notes in Computational Science and Engineering | 2015-06-10 | Paper |
Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout
Lecture Notes in Computational Science and Engineering | 2015-06-10 | Paper |
A note on the parallel runtime of self-stabilizing graph linearization
Theory of Computing Systems | 2015-02-05 | Paper |
On the complexity of list ranking in the parallel external memory model
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Treewidth computation and kernelization in the parallel external memory model
Advanced Information Systems Engineering | 2014-09-15 | Paper |
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Data delivery by energy-constrained mobile agents on a line
Automata, Languages, and Programming | 2014-07-01 | Paper |
| Time-dependent networks as models to achieve fast exact time-table queries | 2013-09-09 | Paper |
Tight bounds for low dimensional star stencils in the external memory model
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
Theoretical Computer Science | 2012-10-11 | Paper |
| Multistage methods for freight train classification | 2012-09-28 | Paper |
The efficiency of MapReduce in parallel external memory
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Multistage methods for freight train classification
Networks | 2011-02-17 | Paper |
Optimal sparse matrix dense vector multiplication in the I/O-model
Theory of Computing Systems | 2010-12-17 | Paper |
Evaluating non-square sparse bilinear forms on multiple vector pairs in the I/O-model
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Approximate shortest paths guided by a small index
Algorithmica | 2010-05-28 | Paper |
Time complexity of distributed topological self-stabilization: the case of graph linearization
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
A self-stabilizing and local Delaunay graph construction
Algorithms and Computation | 2009-12-17 | Paper |
| scientific article; zbMATH DE number 5604124 (Why is no real title available?) | 2009-09-15 | Paper |
Sequential Vector Packing
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Approximate Shortest Paths Guided by a Small Index
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Sequential vector packing
Theoretical Computer Science | 2009-01-08 | Paper |
Optimal Randomized Comparison Based Algorithms for Collision
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
An algorithmic view on OVSF code assignment
Algorithmica | 2007-04-26 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Network Analysis
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
A memetic algorithm to schedule planned maintenance for the national grid
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
| scientific article; zbMATH DE number 2119642 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 1947387 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1617248 (Why is no real title available?) | 2001-07-11 | Paper |
Formal-Language-Constrained Path Problems
SIAM Journal on Computing | 2000-10-18 | Paper |
An Optimal Randomized Algorithm for Finding the Saddlepoint
(available as arXiv preprint) | N/A | Paper |
