The following pages link to Ran Ben-Basat (Q249083):
Displaying 13 items.
- A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds (Q1713914) (← links)
- (Q1741862) (redirect page) (← links)
- Succinct summing over sliding windows (Q1741865) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Give me some slack: efficient network measurements (Q2272404) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- The $$k$$-Distinct Language: Parameterized Automata Constructions (Q2946010) (← links)
- A Game Theoretic Analysis of the Adversarial Retrieval Setting (Q4600731) (← links)
- Optimal Distributed Covering Algorithms (Q5145187) (← links)
- Efficient Summing over Sliding Windows (Q5369513) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
- Optimal distributed covering algorithms (Q6487522) (← links)
- Parameterized distributed algorithms (Q6487523) (← links)
