240 results on '"Merav Parter"'
Search Results
2. Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition.
3. Having Hope in Missing Spanners: New Distance Preservers and Light Hopsets.
4. Brief Announcement: Distributed Maximum Flow in Planar Graphs.
5. The Algorithmic Power of the Greene-Kleitman Theorem.
6. Giving Some Slack: Shortcuts and Transitive Closure Compressions.
7. Connectivity Labeling and Routing with Multiple Vertex Failures.
8. Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free.
9. Deterministic Replacement Path Covering.
10. Component stability in low-space massively parallel computation.
11. Near-optimal distributed computation of small vertex cuts.
12. Facilitated variation: how evolution learns from past environments to generalize to new environments.
13. New Additive Emulators.
14. Secure Computation Meets Distributed Universal Optimality.
15. Towards Bypassing Lower Bounds for Graph Shortcuts.
16. Distributed CONGEST Algorithms against Mobile Adversaries.
17. Secure Distributed Network Optimization Against Eavesdroppers.
18. Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain Covers.
19. Distributed Maximum Flow in Planar Graphs.
20. Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults.
21. Parks and Recreation: Color Fault-Tolerant Spanners Made Local.
22. The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication.
23. Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs.
24. Graphs Shortcuts: New Bounds and Algorithms (Invited Talk).
25. Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts.
26. Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets.
27. Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel.
28. Õptimal Dual Vertex Failure Connectivity Labels.
29. Near-Optimal Distributed Computation of Small Vertex Cuts.
30. Broadcast CONGEST Algorithms Against Eavesdroppers.
31. New Diameter-Reducing Shortcuts and Directed Hopsets: Breaking the Barrier.
32. Exponentially Faster Shortest Paths in the Congested Clique.
33. Connectivity Labeling for Multiple Vertex Failures.
34. Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free.
35. Broadcast CONGEST Algorithms against Adversarial Edges.
36. General CONGEST Compilers against Adversarial Edges.
37. Component Stability in Low-Space Massively Parallel Computation.
38. Fault-Tolerant Labeling and Compact Routing Schemes.
39. Low-Congestion Shortcuts in Constant Diameter Graphs.
40. Improved Deterministic (Δ+1) Coloring in Low-Space MPC.
41. Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs.
42. Invited Talk: Resilient Distributed Algorithms.
43. Deterministic Replacement Path Covering.
44. On Packing Low-Diameter Spanning Trees.
45. New Fault Tolerant Subset Preservers.
46. Spiking Neural Networks Through the Lens of Streaming Algorithms.
47. Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers.
48. Distributed Planar Reachability in Nearly Optimal Time.
49. Exponentially Faster Shortest Paths in the Congested Clique.
50. Simple, Deterministic, Constant-Round Coloring in the Congested Clique.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.