The following pages link to Riko Jacob (Q613120):
Displaying 45 items.
- Optimal sparse matrix dense vector multiplication in the I/O-model (Q613122) (← links)
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs (Q714851) (← links)
- An algorithmic view on OVSF code assignment (Q878438) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- A note on the parallel runtime of self-stabilizing graph linearization (Q2254491) (← links)
- Cache oblivious sparse matrix multiplication (Q2294704) (← links)
- Sequential vector packing (Q2378514) (← links)
- (Q2721968) (← links)
- A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm (Q2808020) (← links)
- Tight Bounds for Low Dimensional Star Stencils in the External Memory Model (Q2842179) (← links)
- (Q2847380) (← links)
- The Efficiency of MapReduce in Parallel External Memory (Q2894486) (← links)
- 11. Multistage Methods for Freight Train Classification (Q2917372) (← links)
- On the Complexity of List Ranking in the Parallel External Memory Model (Q2922625) (← links)
- Multistage methods for freight train classification (Q3076019) (← links)
- Treewidth Computation and Kernelization in the Parallel External Memory Model (Q3190152) (← links)
- (Q3396008) (← links)
- Fast Output-Sensitive Matrix Multiplication (Q3452839) (← links)
- Optimal Randomized Comparison Based Algorithms for Collision (Q3525613) (← links)
- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication (Q3557017) (← links)
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization (Q3557028) (← links)
- Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model (Q3586100) (← links)
- Approximate Shortest Paths Guided by a Small Index (Q3603557) (← links)
- Sequential Vector Packing (Q3611892) (← links)
- A Self-stabilizing and Local Delaunay Graph Construction (Q3652263) (← links)
- (Q4411352) (← links)
- Formal-Language-Constrained Path Problems (Q4507373) (← links)
- (Q4828913) (← links)
- Formal language constrained path problems (Q5054859) (← links)
- Fragile complexity of comparison-based algorithms (Q5075734) (← links)
- (Q5075805) (← links)
- Data Delivery by Energy-Constrained Mobile Agents on a Line (Q5167857) (← links)
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs (Q5170310) (← links)
- Lower Bounds for Oblivious Data Structures (Q5236338) (← links)
- Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids (Q5254889) (← links)
- Efficient Regular Sparse Grid Hierarchization by a Dynamic Memory Layout (Q5254896) (← links)
- STACS 2004 (Q5309706) (← links)
- Algorithm Theory - SWAT 2004 (Q5315372) (← links)
- A memetic algorithm to schedule planned maintenance for the national grid (Q5463391) (← links)
- SKIP <sup>+</sup> (Q5501939) (← links)
- Network Analysis (Q5703979) (← links)
- Approximation and Online Algorithms (Q5713439) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897558) (← links)
- Fragile complexity of adaptive algorithms (Q5918676) (← links)
- Fragile complexity of adaptive algorithms (Q5925676) (← links)
