Shahar Timnat
- Ittai Abraham, Danny Dolev, and Joseph Y. Halpern. Distributed protocols for leader election: A game-theoretic perspective. In DISC, pages 61--75, 2013.Google Scholar
Digital Library
- James Aspnes and Keren Censor-Hillel. Atomic snapshots in O(log3 n) steps using randomized helping. In DISC, pages 254--268, 2013.Google ScholarCross Ref
- Silvio Frischknecht, Barbara Keller, and Roger Wattenhofer. Convergence in (social) influence networks. In DISC, pages 433--446, 2013.Google Scholar
- Mohsen Ghaffari and Fabian Kuhn. Distributed minimum cut approximation. In DISC, pages 1--15, 2013.Google ScholarDigital Library
- George Giakkoupis, Maryam Helmi, Lisa Higham, and Philipp Woelfel. An O(√n) space bound for obstruction-free leader election. In DISC, pages 46--60, 2013.Google Scholar
- Mohsen Lesani and Jens Palsberg. Proving non-opacity. In DISC, pages 106--120, 2013.Google ScholarDigital Library
- Li Lu and Michael L. Scott. Generic multiversion STM. In DISC, pages 134--148, 2013.Google ScholarDigital Library
- Erez Petrank and Shahar Timnat. Lock-free data-structure iterators. In DISC, pages 224--238, 2013.Google ScholarDigital Library
- Kunlong Zhang, Yujiao Zhao, Yajun Yang, Yujie Liu, and Michael F. Spear. Practical nonblocking unordered lists. In DISC, pages 239--253, 2013.Google Scholar
Recommendations
Scalable lineage capture for debugging DISC analytics
SOCC '13: Proceedings of the 4th annual Symposium on Cloud ComputingA fundamental challenge for big-data analytics is how to efficiently tune and debug multi-step dataflows. This paper presents Newt, a scalable architecture for capturing and using record-level data lineage to discover and resolve errors in analytics. ...
Comments