The following pages link to Artur Czumaj (Q590542):
Displaying 20 items.
- (Q169709) (redirect page) (← links)
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Guthrie's problem: new equivalences and rapid reductions (Q672855) (← links)
- Faster Deterministic Communication in Radio Networks (Q4598282) (← links)
- Very Fast Approximation of the Matrix Chain Product Problem (Q4895797) (← links)
- (Q5009578) (← links)
- (Q5090905) (← links)
- (Q5090906) (← links)
- Algorithms and Computation (Q5191683) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- Communicating with Beeps (Q5363821) (← links)
- Broadcasting algorithms in radio networks with unknown topology (Q5491455) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- Haystack hunting hints and locker room communication (Q6076212) (← links)
- (Q6084359) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- (Q6128570) (← links)
- Routing schemes for hybrid communication networks (Q6145044) (← links)
- Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph (Q6491305) (← links)
