default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShiri Chechik
Person information
- affiliation: Tel-Aviv University, Department of Computer Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j15]Davide Bilò
, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS 3 (2024)- [c60]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Distance (Sensitivity) Oracles with Subquadratic Space. FOCS 2024: 1550-1558 - [c59]Shiri Chechik, Doron Mukhtar, Tianyi Zhang:
Streaming Edge Coloring with Subquadratic Palette Size. ICALP 2024: 40:1-40:12 - [c58]Shiri Chechik, Tianyi Zhang:
Faster Algorithms for Dual-Failure Replacement Paths. ICALP 2024: 41:1-41:20 - [c57]Shiri Chechik, Tianyi Zhang:
Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. ICALP 2024: 42:1-42:18 - [c56]Shiri Chechik, Tianyi Zhang:
Nearly Optimal Approximate Dual-Failure Replacement Paths. SODA 2024: 2568-2596 - [i25]Shiri Chechik, Tianyi Zhang:
Faster Algorithms for Dual-Failure Replacement Paths. CoRR abs/2404.13907 (2024) - [i24]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR abs/2408.10014 (2024) - 2023
- [c55]Shiri Chechik, Tianyi Zhang:
Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. SODA 2023: 87-99 - [c54]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC 2023: 1396-1409 - [i23]Shiri Chechik, Doron Mukhtar, Tianyi Zhang:
Streaming Edge Coloring with Subquadratic Palette Size. CoRR abs/2305.07090 (2023) - [i22]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR abs/2305.11580 (2023) - [i21]Shiri Chechik, Shay Mozes, Oren Weimann:
Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs. CoRR abs/2307.07222 (2023) - [i20]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR abs/2307.11677 (2023) - 2022
- [j14]Shiri Chechik, Doron Mukhtar:
Single-source shortest paths in the CONGEST model with improved bounds. Distributed Comput. 35(4): 357-374 (2022) - [c53]Shiri Chechik, Tianyi Zhang:
Constant Approximation of Min-Distances in Near-Linear Time. FOCS 2022: 896-906 - [c52]Shiri Chechik, Tianyi Zhang:
Constant-Round Near-Optimal Spanners in Congested Clique. PODC 2022: 325-334 - [c51]Shiri Chechik, Tianyi Zhang:
Nearly 2-Approximate Distance Oracles in Subquadratic Time. SODA 2022: 551-580 - [e1]Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman:
30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany. LIPIcs 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-247-1 [contents] - [i19]Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein:
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12(11): 45-65 (2022) - 2021
- [c50]Shiri Chechik, Gur Lifshitz:
Optimal Girth Approximation for Dense Directed Graphs. SODA 2021: 290-300 - [c49]Shiri Chechik, Tianyi Zhang:
Incremental Single Source Shortest Paths in Sparse Digraphs. SODA 2021: 2463-2477 - 2020
- [j13]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and Their Applications. ACM Trans. Algorithms 16(2): 19:1-19:21 (2020) - [c48]Shiri Chechik, Moran Nechushtan:
Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs. ICALP 2020: 29:1-29:12 - [c47]Shiri Chechik, Ofer Magen:
Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem. ICALP 2020: 81:1-81:17 - [c46]Shiri Chechik, Doron Mukhtar:
Single-Source Shortest Paths in the CONGEST Model with Improved Bound. PODC 2020: 464-473 - [c45]Shiri Chechik, Tianyi Zhang:
Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. SODA 2020: 463-475 - [c44]Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford:
Constant girth approximation for directed graphs in subquadratic time. STOC 2020: 1010-1023 - [c43]Shiri Chechik, Sarel Cohen:
Distance sensitivity oracles with subcubic preprocessing time and fast query time. STOC 2020: 1375-1388 - [i18]Shiri Chechik, Ofer Magen:
Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem. CoRR abs/2004.13673 (2020)
2010 – 2019
- 2019
- [j12]Shiri Chechik, Ronen Shaltiel:
Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword. Theory Comput. 15: 1-3 (2019) - [c42]Shiri Chechik, Tianyi Zhang:
Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. FOCS 2019: 370-381 - [c41]Noga Alon, Shiri Chechik, Sarel Cohen:
Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. ICALP 2019: 12:1-12:14 - [c40]Shiri Chechik, Doron Mukhtar:
Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model. SODA 2019: 787-804 - [c39]Shiri Chechik, Sarel Cohen:
Near Optimal Algorithms For The Single Source Replacement Paths Problem. SODA 2019: 2090-2109 - [c38]Shiri Chechik, Doron Mukhtar:
Reachability and Shortest Paths in the Broadcast CONGEST Model. DISC 2019: 11:1-11:13 - [i17]Noga Alon, Shiri Chechik, Sarel Cohen:
Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. CoRR abs/1905.07483 (2019) - [i16]Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford:
Improved Girth Approximation and Roundtrip Spanners. CoRR abs/1907.10779 (2019) - [i15]Shiri Chechik, Tianyi Zhang:
Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. CoRR abs/1909.03445 (2019) - [i14]Shiri Chechik, Doron Mukhtar:
Reachability and Shortest Paths in the Broadcast CONGEST Model. CoRR abs/1910.05645 (2019) - 2018
- [j11]Shiri Chechik, Christian Wulff-Nilsen:
Near-Optimal Light Spanners. ACM Trans. Algorithms 14(3): 33:1-33:15 (2018) - [c37]Edith Cohen, Shiri Chechik, Haim Kaplan:
Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. AAAI 2018: 2884-2891 - [c36]Shiri Chechik:
Near-Optimal Approximate Decremental All Pairs Shortest Paths. FOCS 2018: 170-181 - [c35]Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. ICALP 2018: 7:1-7:16 - [c34]Aaron Bernstein, Shiri Chechik:
Incremental Topological Sort and Cycle Detection in Expected Total Time. SODA 2018: 21-34 - [c33]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. SODA 2018: 1650-1664 - [i13]Shiri Chechik, Doron Mukhtar:
Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model. CoRR abs/1804.00137 (2018) - 2017
- [j10]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. Algorithmica 79(3): 708-741 (2017) - [c32]Ittai Abraham, Shiri Chechik, Sebastian Krinninger:
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. SODA 2017: 440-452 - [c31]Aaron Bernstein, Shiri Chechik:
Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs. SODA 2017: 453-469 - [c30]Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan:
(1 + ∊)-Approximate f-Sensitive Distance Oracles. SODA 2017: 1479-1496 - [c29]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis:
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA 2017: 1900-1918 - [i12]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis:
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR abs/1705.10709 (2017) - [i11]Edith Cohen, Shiri Chechik, Haim Kaplan:
Clustering over Multi-Objective Samples: The one2all Sample. CoRR abs/1706.03607 (2017) - [i10]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. CoRR abs/1707.08769 (2017) - [i9]Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. CoRR abs/1711.06625 (2017) - 2016
- [j9]Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg:
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. ACM Trans. Algorithms 12(2): 22:1-22:17 (2016) - [c28]Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis:
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS 2016: 315-324 - [c27]Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA 2016: 740-753 - [c26]Shiri Chechik, Christian Wulff-Nilsen:
Near-Optimal Light Spanners. SODA 2016: 883-892 - [c25]Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick:
Bottleneck Paths and Trees and Deterministic Graphical Games. STACS 2016: 27:1-27:13 - [c24]Aaron Bernstein, Shiri Chechik:
Deterministic decremental single source shortest paths: beyond the o(mn) bound. STOC 2016: 389-397 - [r2]Shiri Chechik:
Additive Spanners. Encyclopedia of Algorithms 2016: 22-24 - [r1]Shiri Chechik:
Compact Routing Schemes. Encyclopedia of Algorithms 2016: 362-364 - [i8]Ittai Abraham, Shiri Chechik, Sebastian Krinninger:
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. CoRR abs/1607.05132 (2016) - 2015
- [j8]Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins:
Low-Distortion Inference of Latent Similarities from a Multiplex Social Network. SIAM J. Comput. 44(3): 617-668 (2015) - [j7]Shiri Chechik, David Peleg:
The fault-tolerant capacitated K-center problem. Theor. Comput. Sci. 566: 12-25 (2015) - [j6]Gilad Braunschvig, Shiri Chechik, David Peleg, Adam Sealfon:
Fault tolerant additive and (μ, α)-spanners. Theor. Comput. Sci. 580: 94-100 (2015) - [c23]Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder:
Approximate Nearest Neighbor Search in Metrics of Planar Graphs. APPROX-RANDOM 2015: 20-42 - [c22]Shiri Chechik, Edith Cohen, Haim Kaplan:
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. APPROX-RANDOM 2015: 659-679 - [c21]Shiri Chechik:
Approximate Distance Oracles with Improved Bounds. STOC 2015: 1-10 - [i7]Shiri Chechik, Edith Cohen, Haim Kaplan:
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. CoRR abs/1503.08528 (2015) - 2014
- [j5]Shiri Chechik, David Peleg:
Robust fault tolerant uncapacitated facility location. Theor. Comput. Sci. 543: 9-23 (2014) - [c20]Ittai Abraham, Shiri Chechik, Kunal Talwar:
Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier. APPROX-RANDOM 2014: 1-16 - [c19]Ittai Abraham, Shiri Chechik:
Distance Labels with Optimal Local Stretch. ICALP (1) 2014: 52-63 - [c18]Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams:
Better Approximation Algorithms for the Graph Diameter. SODA 2014: 1041-1052 - [c17]Shiri Chechik:
Approximate distance oracles with constant query time. STOC 2014: 654-663 - 2013
- [j4]Shiri Chechik:
Fault-tolerant compact routing schemes for general graphs. Inf. Comput. 222: 36-44 (2013) - [c16]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. ESA 2013: 301-312 - [c15]Shiri Chechik:
Compact routing schemes with improved stretch. PODC 2013: 33-41 - [c14]Shiri Chechik:
New Additive Spanners. SODA 2013: 498-512 - [c13]Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins:
Low-distortion Inference of Latent Similarities from a Multiplex Social Network. SODA 2013: 1853-1872 - [i6]Shiri Chechik:
Approximate Distance Oracle with Constant Query Time. CoRR abs/1305.3314 (2013) - [i5]Ittai Abraham, Shiri Chechik:
Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch. CoRR abs/1307.1516 (2013) - 2012
- [j3]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica 63(4): 861-882 (2012) - [j2]Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg:
Sparse reliable graph backbones. Inf. Comput. 210: 31-39 (2012) - [c12]Shiri Chechik:
Improved Distance Oracles and Spanners for Vertex-Labeled Graphs. ESA 2012: 325-336 - [c11]Shiri Chechik, Quentin Godfroy, David Peleg:
Multipath Spanners via Fault-Tolerant Spanners. MedAlg 2012: 108-119 - [c10]Shiri Chechik, David Peleg:
The Fault Tolerant Capacitated k-Center Problem. SIROCCO 2012: 13-24 - [c9]Ittai Abraham, Shiri Chechik, Cyril Gavoille:
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC 2012: 1199-1218 - [c8]Gilad Braunschvig, Shiri Chechik, David Peleg:
Fault Tolerant Additive Spanners. WG 2012: 206-214 - [i4]Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins:
Low-distortion Inference of Latent Similarities from a Multiplex Social Network. CoRR abs/1202.0922 (2012) - [i3]Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg:
Secluded Connectivity Problems. CoRR abs/1212.6176 (2012) - 2011
- [c7]Shiri Chechik:
Fault-Tolerant Compact Routing Schemes for General Graphs. ICALP (2) 2011: 101-112 - [i2]Shiri Chechik:
Improved Distance Oracles for Vertex-Labeled Graphs. CoRR abs/1109.3114 (2011) - 2010
- [j1]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault Tolerant Spanners for General Graphs. SIAM J. Comput. 39(7): 3403-3423 (2010) - [c6]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
f-Sensitivity Distance Oracles and Routing Schemes. ESA (1) 2010: 84-96 - [c5]Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg:
Sparse Reliable Graph Backbones. ICALP (2) 2010: 261-272 - [c4]Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg:
Forbidden-set distance labels for graphs of bounded doubling dimension. PODC 2010: 192-200 - [c3]Shiri Chechik, David Peleg:
Robust Fault Tolerant Uncapacitated Facility Location. STACS 2010: 191-202
2000 – 2009
- 2009
- [c2]Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty:
Fault-tolerant spanners for general graphs. STOC 2009: 435-444 - [c1]Shiri Chechik, David Peleg:
Low-Port Tree Representations. WG 2009: 66-76 - [i1]Shiri Chechik, David Peleg:
Robust Fault Tolerant uncapacitated facility location. CoRR abs/0912.3188 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
