The following pages link to Artur Czumaj (Q590542):
Displaying 50 items.
- Local Graph Exploration and Fast Property Testing (Q3586481) (← links)
- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications (Q3590961) (← links)
- Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks (Q3608499) (← links)
- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k (Q3652286) (← links)
- Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs (Q3654386) (← links)
- Time and Cost Trade-Offs in Gossiping (Q4210214) (← links)
- (Q4219046) (← links)
- (Q4234122) (← links)
- (Q4252298) (← links)
- (Q4252299) (← links)
- (Q4281529) (← links)
- (Q4471376) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- Delayed path coupling and generating random permutations (Q4521548) (← links)
- (Q4535042) (← links)
- (Q4536939) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q4556954) (← links)
- Fast generation of random permutations via networks simulation (Q4595492) (← links)
- Faster Deterministic Communication in Radio Networks (Q4598282) (← links)
- Deterministic Communication in Radio Networks (Q4605275) (← links)
- An <i>O</i> (log <i>k</i> )-Competitive Algorithm for Generalized Caching (Q4629976) (← links)
- Problems on pairs of trees and the four colour problem of planar graphs (Q4630251) (← links)
- (Q4737224) (← links)
- (Q4796180) (← links)
- (Q4828962) (← links)
- Very Fast Approximation of the Matrix Chain Product Problem (Q4895797) (← links)
- Testing Expansion in Bounded-Degree Graphs (Q4911108) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Testing Monotone Continuous Distributions on High-Dimensional Real Cubes (Q4933371) (← links)
- Contention Resolution in Hashing Based Shared Memory Simulations (Q4943890) (← links)
- (Q4952595) (← links)
- Testing Euclidean minimum spanning trees in the plane (Q4962736) (← links)
- (Q5009578) (← links)
- Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space (Q5032024) (← links)
- An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129) (← links)
- Parallel and sequential approximation of shortest superstrings (Q5056169) (← links)
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks (Q5056444) (← links)
- (Q5090905) (← links)
- (Q5090906) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- Sublinear time approximation of the cost of a metric <i>k</i>-nearest neighbor graph (Q5146977) (← links)
- Thorp Shuffling, Butterflies, and Non-Markovian Couplings (Q5167754) (← links)
- Algorithms and Computation (Q5191683) (← links)
- Round compression for parallel matching algorithms (Q5230311) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- Abstract Combinatorial Programs and Efficient Property Testers (Q5317165) (← links)
- Fault-tolerant geometric spanners (Q5361598) (← links)
- Relating two property testing models for bounded degree directed graphs (Q5361900) (← links)
- Brief Announcement (Q5361915) (← links)
