476 results on '"Artur Czumaj"'
Search Results
2. Parallel Derandomization for Coloring.
3. Streaming Graph Algorithms in the Massively Parallel Computation Model.
4. Log Diameter Rounds MST Verification and Sensitivity in MPC.
5. Component stability in low-space massively parallel computation.
6. Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph.
7. Parallel Derandomization for Coloring (Abstract).
8. Optimal (Degree+1)-Coloring in Congested Clique.
9. Routing Schemes for Hybrid Communication Networks.
10. On Parallel k-Center Clustering.
11. Haystack hunting hints and locker room communication.
12. Deterministic Massively Parallel Connectivity.
13. Routing schemes for hybrid communication networks.
14. Streaming Algorithms for Geometric Steiner Forest.
15. Streaming Facility Location in High Dimension via Geometric Hashing.
16. Deterministic massively parallel connectivity.
17. Modern Parallel Algorithms (Invited Talk).
18. Fast Parallel Degree+1 List Coloring.
19. Fully Scalable MPC Algorithms for Clustering in High Dimension.
20. Letter from the President.
21. Almost Tight Bounds for Reordering Buffer Management.
22. Haystack Hunting Hints and Locker Room Communication.
23. Component Stability in Low-Space Massively Parallel Computation.
24. Improved Deterministic (Δ+1) Coloring in Low-Space MPC.
25. Near-Shortest Path Routing in Hybrid Communication Networks.
26. Simple, Deterministic, Constant-Round Coloring in the Congested Clique.
27. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.
28. Testable Properties in General Graphs and Random Order Streaming.
29. Sublinear time approximation of the cost of a metric k-nearest neighbor graph.
30. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.
31. Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.
32. Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.
33. On parallel time in population protocols.
34. Near-Shortest Path Routing in Hybrid Communication Networks.
35. Streaming Facility Location in High Dimension via New Geometric Hashing.
36. Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs.
37. Letter from the President.
38. A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs).
39. Detecting cliques in CONGEST networks.
40. Round compression for parallel matching algorithms.
41. Deterministic Blind Radio Networks.
42. Detecting Cliques in CONGEST Networks.
43. Online Facility Location with Deletions.
44. Sublinear Graph Augmentation for Fast Query Implementation.
45. Communicating with beeps.
46. Planar graphs: Random walks and bipartiteness testing.
47. An O(log k)-Competitive Algorithm for Generalized Caching.
48. Distributed Methods for Computing Approximate Equilibria.
49. Leader election in multi-hop radio networks.
50. Deterministic Massively Parallel Connectivity.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.