The following pages link to Merav Parter (Q831781):
Displayed 50 items.
- (Q402390) (redirect page) (← links)
- Testing the irreducibility of nonsquare Perron-Frobenius systems (Q402391) (← links)
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- Computing in additive networks with bounded-information codes (Q1664154) (← links)
- Nonuniform SINR+Voroni diagrams are effectively uniform (Q1664168) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Vertex fault tolerant additive spanners (Q1689749) (← links)
- The topology of wireless communication on a line (Q1698733) (← links)
- Nonuniform SINR+Voronoi diagrams are effectively uniform (Q2043011) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Fault tolerant approximate BFS structures with additive stretch (Q2211352) (← links)
- Randomized distributed decision (Q2256969) (← links)
- Dual Failure Resilient BFS Structure (Q2796286) (← links)
- Sparse Fault-Tolerant BFS Trees (Q2849365) (← links)
- The Topology of Wireless Communication (Q3177746) (← links)
- Efficient Oracles and Routing Schemes for Replacement Paths (Q3304107) (← links)
- Fault-Tolerant Approximate BFS Structures (Q4554956) (← links)
- Local-on-Average Distributed Tasks (Q4575593) (← links)
- Optimal Vertex Fault Tolerant Spanners (for fixed stretch) (Q4608012) (← links)
- Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks (Q4638064) (← links)
- Sparse Fault-Tolerant BFS Structures (Q4962646) (← links)
- (Q4967205) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space (Q5032024) (← links)
- Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. (Q5075802) (← links)
- (Q5090437) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
- (Q5091249) (← links)
- (Q5111404) (← links)
- Secure Distributed Computing Made (Nearly) Optimal (Q5145188) (← links)
- The Power of Distributed Verifiers in Interactive Proofs (Q5146838) (← links)
- New (<i>α, β</i>) Spanners and Hopsets (Q5146883) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- Planar diameter via metric compression (Q5212756) (← links)
- Low Congestion Cycle Covers and Their Applications (Q5236285) (← links)
- Distributed Algorithms Made Secure: A Graph Theoretic Approach (Q5236286) (← links)
- MST in Log-Star Rounds of Congested Clique (Q5361911) (← links)
- A Polylogarithmic Gossip Algorithm for Plurality Consensus (Q5361925) (← links)
- Fault Tolerant Approximate BFS Structures (Q5384042) (← links)
- The topology of wireless communication (Q5419108) (← links)
- Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications (Q5741743) (← links)
- (Q5743416) (← links)
- Exponentially Faster Shortest Paths in the Congested Clique (Q5855208) (← links)
- Simple, Deterministic, Constant-Round Coloring in the Congested Clique (Q5855250) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)
- Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks. (Q5875717) (← links)
- The Computational Cost of Asynchronous Neural Communication (Q5875750) (← links)
- Exponentially Faster Shortest Paths in the Congested Clique (Q5889790) (← links)
- The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication (Q6051926) (← links)