1.8k citations
- Tel Aviv UniversityIL43 papers
- Boston UniversityUS31 papers
- Technion – Israel Institute of TechnologyIL26 papers
- Ben-Gurion University of the NegevIL25 papers
- Hebrew University of JerusalemIL22 papers
- Ariel UniversityIL21 papers
- University of Maryland, College ParkUS21 papers
- Weizmann Institute of ScienceIL19 papers
- Centre National de la Recherche ScientifiqueFR18 papers
- Harvard UniversityUS16 papers
- Institute of MathematicsPL13 papers
- Institute of Radio AstronomyUA13 papers
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017★ 13 cited
Conditional Lower Bounds for Space/Time Tradeoffs
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein +1
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showi…
cs.DS2017★ 2 cited
How Hard is it to Find (Honest) Witnesses?
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein +1
In recent years much effort was put into developing polynomial-time conditional lower bounds for algorithms and data structures in both static and dynamic settings. Along these lin…
cs.DS2017
Making Asynchronous Distributed Computations Robust to Noise
Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler
We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interac…