Shay Mozes

Available identifiers

zbMath Open mozes.shayWikidataQ59641724 ScholiaQ59641724MaRDI QIDQ732017

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147419	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147524	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6187842	2024-01-15	Paper
Exact Distance Oracles for Planar Graphs with Failing Vertices	2023-10-31	Paper
On the hardness of computing the edit distance of shallow trees	2023-08-04	Paper
Compressed range minimum queries	2023-07-28	Paper
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)	2023-04-26	Paper
Dynamic String Alignment.	2023-02-07	Paper
Fault-tolerant distance labeling for planar graphs	2022-05-10	Paper
Fault-tolerant distance labeling for planar graphs	2022-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q5009573	2021-08-04	Paper
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search	2021-05-03	Paper
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time	2021-04-14	Paper
https://portal.mardi4nfdi.de/entity/Q5111728	2020-05-27	Paper
Compressed range minimum queries	2020-02-20	Paper
Almost optimal distance oracles for planar graphs	2020-01-30	Paper
Efficient dynamic approximate distance oracles for vertex-labeled planar graphs	2019-12-19	Paper
Exact Distance Oracles for Planar Graphs with Failing Vertices	2019-10-15	Paper
Short and Simple Cycle Separators in Planar Graphs	2019-09-12	Paper
https://portal.mardi4nfdi.de/entity/Q5743390	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q5743404	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4633831	2019-05-06	Paper
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications	2018-11-05	Paper
Efficient dynamic approximate distance oracles for vertex-labeled planar graphs	2018-06-22	Paper
Efficient vertex-label distance oracles for planar graphs	2018-04-12	Paper
https://portal.mardi4nfdi.de/entity/Q4607913	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607914	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607915	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607916	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607965	2018-03-15	Paper
The nearest colored node in a tree	2018-02-16	Paper
Faster shortest paths in dense distance graphs, with applications	2018-02-16	Paper
The Nearest Colored Node in a Tree	2017-10-17	Paper
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2017-08-16	Paper
Short and Simple Cycle Separators in Planar Graphs	2017-06-16	Paper
Efficient vertex-label distance oracles for planar graphs	2016-02-26	Paper
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search	2015-10-27	Paper
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection	2015-08-21	Paper
Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm	2014-11-18	Paper
Structured recursive separator decompositions for planar graphs in linear time	2014-08-07	Paper
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time	2014-07-30	Paper
Improved Submatrix Maximum Queries in Monge Matrices	2014-07-01	Paper
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time	2011-08-12	Paper
The Train Delivery Problem - Vehicle Routing Meets Bin Packing	2011-02-15	Paper
Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time	2010-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q3579429	2010-08-06	Paper
Fast algorithms for computing tree LCS	2009-10-09	Paper
Speeding up HMM decoding and training by exploiting sequence repetitions	2009-08-27	Paper
New construction for a QMA complete three-local Hamiltonian	2008-10-14	Paper
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions	2008-06-17	Paper
Fast Algorithms for Computing Tree LCS	2008-06-17	Paper
An Optimal Decomposition Algorithm for Tree Edit Distance	2007-11-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Shay Mozes