The following pages link to Morten Stöckel (Q2077382):
Displaying 13 items.
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Near-optimal induced universal graphs for cycles and paths (Q2185721) (← links)
- I/O-efficient similarity join (Q2408174) (← links)
- The Hardness of the Functional Orientation 2-Color Problem (Q2848741) (← links)
- Fast and Cache-Oblivious Dynamic Programming with Local Dependencies (Q2890186) (← links)
- The Input/Output Complexity of Sparse Matrix Multiplication (Q2921459) (← links)
- Fast Output-Sensitive Matrix Multiplication (Q3452839) (← links)
- Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence (Q3452844) (← links)
- I/O-Efficient Similarity Join (Q3452853) (← links)
- Graph reconstruction with a betweenness oracle (Q4601854) (← links)
- Finding even cycles faster via capped k-walks (Q4977965) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs (Q5111460) (← links)
