The following pages link to Jens Gustedt (Q666106):
Displaying 28 items.
- Iterative computations with ordered read-write locks (Q666107) (← links)
- Two linear time Union--Find strategies for image processing (Q672744) (← links)
- Efficient sampling of random permutations (Q954966) (← links)
- \(N\)-free orders and minimal interval extensions (Q1207724) (← links)
- Efficient Union-Find for planar graphs and other sparse graph classes (Q1274324) (← links)
- Finiteness theorems for graphs and posets obtained by compositions (Q1304910) (← links)
- Interval reductions and extensions of orders: Bijections to chains in lattices (Q1304911) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- Constructing colorings for diagrams (Q1329806) (← links)
- Weak-order extensions of an order. (Q1401400) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- Well quasi ordering finite posets and formal languages (Q1898732) (← links)
- (Q2766681) (← links)
- Efficient and Practical Algorithms for Sequential Modular Decomposition (Q2775895) (← links)
- Bounded Arboricity to Determine the Local Structure of Sparse Graphs (Q3522953) (← links)
- (Q4023737) (← links)
- (Q4250226) (← links)
- (Q4273867) (← links)
- (Q4373670) (← links)
- (Q4525263) (← links)
- (Q4533374) (← links)
- <tt>Arbogast</tt>: Higher order automatic differentiation for special functions with Modular C (Q4685591) (← links)
- (Q4707790) (← links)
- Memory management for Union-Find algorithms (Q5047160) (← links)
- Portable list ranking (Q5463429) (← links)
- (Q5501779) (← links)
- (Q5757085) (← links)
- Theoretical Computer Science (Q5897355) (← links)
