pith. sign in

Shay Mozes

Identifiers

  • name variant Shay Mozes 0.60 · backfill

Papers (24)

  1. Compressed Range Minimum Queries cs.DS · 2019 · author #3
  2. Almost Optimal Distance Oracles for Planar Graphs cs.DS · 2018 · author #3
  3. Near-Optimal Distance Emulator for Planar Graphs cs.DS · 2018 · author #3
  4. Better Tradeoffs for Exact Distance Oracles in Planar Graphs cs.DS · 2017 · author #2
  5. Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs cs.DS · 2017 · author #2
  6. Dispersion on Trees cs.DS · 2017 · author #3
  7. Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can) cs.DS · 2017 · author #3
  8. Near-Optimal Compression for the Planar Graph Metric cs.DS · 2017 · author #3
  9. Minimum Cut of Directed Planar Graphs in O(nloglogn) Time cs.DS · 2015 · author #1
  10. A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection cs.DS · 2015 · author #3
  11. Efficient Vertex-Label Distance Oracles for Planar Graphs cs.DS · 2015 · author #1
  12. Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search cs.DS · 2015 · author #2
  13. Faster Shortest Paths in Dense Distance Graphs, with Applications cs.DS · 2014 · author #1
  14. Improved Submatrix Maximum Queries in Monge Matrices cs.DS · 2013 · author #2
  15. Structured Recursive Separator Decompositions for Planar Graphs in Linear Time cs.DM · 2012 · author #2
  16. Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time cs.DM · 2011 · author #3
  17. Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time cs.DM · 2011 · author #2
  18. Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time cs.DM · 2010 · author #1
  19. Exact Distance Oracles for Planar Graphs cs.DS · 2010 · author #1
  20. Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time cs.DS · 2010 · author #2
  21. Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time cs.DM · 2009 · author #1
  22. A new construction for a QMA complete 3-local Hamiltonian quant-ph · 2006 · author #2
  23. An O(n^3)-Time Algorithm for Tree Edit Distance cs.DS · 2006 · author #2
  24. Not So SuperDense Coding - Deterministic Dense Coding with Partially Entangled States quant-ph · 2004 · author #1

Mentions

  • 1504.08008 #3 · backfill · confidence 0.70 Shay Mozes
  • 1504.04690 #1 · backfill · confidence 0.70 Shay Mozes
  • 1502.07663 #2 · backfill · confidence 0.70 Shay Mozes
  • 1404.0977 #1 · backfill · confidence 0.70 Shay Mozes
  • 1307.2313 #2 · backfill · confidence 0.70 Shay Mozes
  • 1208.2223 #2 · backfill · confidence 0.70 Shay Mozes
  • 1105.2228 #3 · backfill · confidence 0.70 Shay Mozes
  • 1104.4728 #2 · backfill · confidence 0.70 Shay Mozes
  • 1012.5870 #1 · backfill · confidence 0.70 Shay Mozes
  • 1011.5549 #1 · backfill · confidence 0.70 Shay Mozes
  • 1008.5332 #2 · backfill · confidence 0.70 Shay Mozes
  • 0911.4963 #1 · backfill · confidence 0.70 Shay Mozes

Frequent Coauthors