pith. sign in

Oren Weimann

Identifiers

  • name variant Oren Weimann 0.60 · backfill

Papers (26)

  1. Compressed Range Minimum Queries cs.DS · 2019 · author #4
  2. Almost Optimal Distance Oracles for Planar Graphs cs.DS · 2018 · author #4
  3. Near-Optimal Distance Emulator for Planar Graphs cs.DS · 2018 · author #4
  4. A Faster FPTAS for #Knapsack cs.DS · 2018 · author #3
  5. Better Tradeoffs for Exact Distance Oracles in Planar Graphs cs.DS · 2017 · author #3
  6. Dispersion on Trees cs.DS · 2017 · author #4
  7. A Faster Construction of Greedy Consensus Trees cs.DS · 2017 · author #4
  8. Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can) cs.DS · 2017 · author #4
  9. Near-Optimal Compression for the Planar Graph Metric cs.DS · 2017 · author #4
  10. Optimal Distance Labeling Schemes for Trees cs.DS · 2016 · author #4
  11. Minimum Cut of Directed Planar Graphs in O(nloglogn) Time cs.DS · 2015 · author #4
  12. Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search cs.DS · 2015 · author #3
  13. Longest Common Extensions in Trees cs.DS · 2014 · author #5
  14. Faster Shortest Paths in Dense Distance Graphs, with Applications cs.DS · 2014 · author #3
  15. Binary Jumbled Pattern Matching via All-Pairs Shortest Paths cs.DS · 2014 · author #4
  16. Improved Submatrix Maximum Queries in Monge Matrices cs.DS · 2013 · author #3
  17. Tree Compression with Top Trees cs.DS · 2013 · author #4
  18. Binary Jumbled Pattern Matching on Trees and Tree-Like Structures cs.DS · 2013 · author #4
  19. Improved Bounds for Online Preemptive Matching cs.DS · 2012 · author #4
  20. On Approximating String Selection Problems with Outliers cs.DS · 2012 · author #5
  21. Approximating the Diameter of Planar Graphs in Near Linear Time cs.DS · 2011 · author #1
  22. Unified Compression-Based Acceleration of Edit-Distance Computation cs.DS · 2010 · author #4
  23. Random Access to Grammar Compressed Strings cs.DS · 2010 · author #6
  24. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs cs.GT · 2009 · author #6
  25. The Stackelberg Minimum Spanning Tree Game cs.GT · 2007 · author #7
  26. An O(n^3)-Time Algorithm for Tree Edit Distance cs.DS · 2006 · author #4

Mentions

  • 1207.1788 #4 · backfill · confidence 0.70 Oren Weimann
  • 1202.2820 #5 · backfill · confidence 0.70 Oren Weimann
  • 1112.1116 #1 · backfill · confidence 0.70 Oren Weimann
  • 1004.1194 #4 · backfill · confidence 0.70 Oren Weimann
  • 1001.1565 #6 · backfill · confidence 0.70 Oren Weimann
  • 0909.3221 #6 · backfill · confidence 0.70 Oren Weimann

Frequent Coauthors