The following pages link to Slobodan Mitrović (Q2509752):
Displaying 13 items.
- Homometric sets in trees (Q2509753) (← links)
- (Q3117045) (← links)
- On the Resiliency of Randomized Routing Against Multiple Edge Failures (Q4598277) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Walking randomly, massively, and efficiently (Q5144923) (← links)
- Weighted Matchings via Unweighted Augmentations (Q5145261) (← links)
- Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples (Q5146888) (← links)
- Improved Local Computation Algorithm for Set Cover via Sparsification (Q5146979) (← links)
- Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover (Q5197674) (← links)
- Round compression for parallel matching algorithms (Q5230311) (← links)
- Massively parallel algorithms for small subgraph counting (Q6591892) (← links)
- New partitioning techniques and faster algorithms for approximate interval scheduling (Q6614114) (← links)
- New partitioning techniques and faster algorithms for approximate interval scheduling (Q6638045) (← links)
