The following pages link to Artur Czumaj (Q590542):
Displaying 50 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)
- Bounded degree spanning trees (extended abstract) (Q826078) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
- On polynomial-time approximation algorithms for the variable length scheduling problem. (Q1401344) (← links)
- Algorithms for the parallel alternating direction access machine (Q1575740) (← links)
- Fast practical multi-pattern matching (Q1606976) (← links)
- Sublinear graph augmentation for fast query implementation (Q1757769) (← links)
- Fault-tolerant geometric spanners (Q1762946) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- On parallel time in population protocols (Q2094385) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- Leader election in multi-hop radio networks (Q2326383) (← links)
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs (Q2373733) (← links)
- Fast message dissemination in random geometric networks (Q2375822) (← links)
- (Q2723970) (← links)
- Randomized allocation processes (Q2746211) (← links)
- (Q2753932) (← links)
- (Q2754202) (← links)
- (Q2768392) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- (Q2934631) (← links)
- (Q2934691) (← links)
- Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games (Q2938662) (← links)
- Random Permutations using Switching Networks (Q2941565) (← links)
- Testing Cluster Structure of Graphs (Q2941567) (← links)
- Computing equilibria for a service provider game with (Im)perfect information (Q2944536) (← links)
- Tight bounds for worst-case equilibria (Q2944540) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
- Selfish Traffic Allocation for Server Farms (Q3053156) (← links)
- PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k (Q3069731) (← links)
- Sequential and Parallel Approximation of Shortest Superstrings (Q3128987) (← links)
- Multiple-Choice Balanced Allocation in (Almost) Parallel (Q3167413) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) (Q3191969) (← links)
- Balanced allocations (Q3192049) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- (Q3396583) (← links)
- Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
- Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication (Q3558009) (← links)
- Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time (Q3575153) (← links)
- Selfish traffic allocation for server farms (Q3579231) (← links)
- Estimating the weight of metric minimum spanning trees in sublinear-time (Q3580967) (← links)
