The following pages link to Jakub Tětek (Q2327473):
Displayed 6 items.
- Compact I/O-efficient representation of separable graphs and optimal tree layouts (Q2327474) (← links)
- Theoretical model of computation and algorithms for FPGA-based hardware accelerators (Q2327481) (← links)
- On the simultaneous minimum spanning trees problem (Q2636567) (← links)
- Edge sampling and graph parameter estimation via vertex neighborhood accesses (Q6083564) (← links)
- Better Sum Estimation via Weighted Sampling (Q6381517) (← links)
- Estimating the Effective Support Size in Constant Query Complexity (Q6417947) (← links)