Shiri Chechik
POST DOC RESEARCHER
.
- schechik "at" microsoft.com
- 1065 La Avenida, Mountain View, CA 94043
SVC-6/2035, 1-650-693-0549
I am a post doctoral researcher at Microsoft Research Silicon Valley. I recently completed my PhD under the supervision of Prof. David Peleg in the Department of Computer Science and Applied Mathematics, at the Weizmann Institute of Science.
Research Interests
I am broadly interested in the theory of algorithms. Specific areas are:- Distributed Algorithms
- Combinatorial Algorithms
- Dynamic Algorithms
- Networking
- Routing
Selected Publications
-
"Compact Routing Schemes with Improved Stretch
". Shiri Chechik.
-
To appear in Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC 2013).
-
"New Additive Spanners" . Shiri Chechik.
-
In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013).
-
"Low-distortion Inference of Latent Similarities from a Multiplex Social Network
". Ittai Abraham, Shiri Chechik, David Kempe and Aleksandrs Slivkins.
-
In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013).
-
"Improved Distance Oracles and Spanners for Vertex-Labeled Graphs
". Shiri Chechik.
-
In Proceedings of the 20th Annual European Symposium on Algorithms (ESA 2012).
-
"Fault Tolerant Additive Spanners". Gilad Braunschvig, Shiri Chechik and David Peleg.
-
In Proceedings of the 38th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2012).
-
"Fully Dynamic Approximate Distance Oracles for Planar Graphs via Forbidden-Set Distance Labels". Ittai Abraham, Shiri Chechik and Cyril Gavoille.
-
In Proceedings of the 44th ACM Symposium on Theory of Computing (STOC 2012).
-
Fault-Tolerant Compact Routing Schemes for General Graphs". Shiri Chechik.
-
In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011).
-
"Forbidden-set distance labels for graphs of bounded doubling dimension
". Ittai Abraham, Shiri Chechik, Cyril Gavoille and David Peleg.
-
In Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC 2010).
-
"Sparse Reliable Graph Backbones". Shiri Chechik, Yuval Emek, Boaz Patt-Shamir and David Peleg.
-
In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010).
- "f-sensitivity distance oracles and routing schemes". Shiri chechik, Michael Langberg, David Peleg and Liam Roditty.
-
To appear in Algorithmica , 2010, special issue for ESA'10.
Preliminary version in Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010).
- "Robust Fault Tolerant uncapacitated facility location". Shiri Chechik and David Peleg.
-
In Proceedings of the 27th international Symposium on Theoretical Aspects of Computer Science (STACS 2010).
- "Fault Tolerant Spanners for General Graphs". Shiri chechik, Michael Langberg, David Peleg and Liam Roditty.
-
In SIAM Journal on Computing 39(7) , SICOMP, 2010.
Preliminary version in Proceedings of the 41st ACM Symposium on Theory of Computing ( STOC 2009).
-
"Low-Port Tree Representations". Shiri Chechik and David Peleg.
-
In Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009).
