Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Mozes, Shay
100  Ergebnisse:
Personensuche X
?
1

Minimum Cut in $$O(m\log ^2 n)$$ Time:

Gawrychowski, Paweł ; Mozes, Shay ; Weimann, Oren
Theory of Computing Systems.  , 2024
Link: https://doi.org/10.1007/..
 
?
2

Almost Optimal Exact Distance Oracles for Planar Graphs:

Charalampopoulos, Panagiotis ; Gawrychowski, Paweł ; Long, Yaowei...
Journal of the ACM.  70 (2023)  2 - p. 1-50 , 2023
Link: https://doi.org/10.1145/..
 
?
3

Exact Distance Oracles for Planar Graphs with Failing Verti..:

Charalampopoulos, Panagiotis ; Mozes, Shay ; Tebeka, Benjamin
ACM Transactions on Algorithms.  18 (2022)  2 - p. 1-23 , 2022
Link: https://doi.org/10.1145/..
 
?
4

Fault-tolerant distance labeling for planar graphs:

Bar-Natan, Aviv ; Charalampopoulos, Panagiotis ; Gawrychowski, Paweł..
Theoretical Computer Science.  918 (2022)  - p. 48-59 , 2022
Link: https://doi.org/10.1016/..
 
?
5

On the Hardness of Computing the Edit Distance of Shallow T..:

, In: String Processing and Information Retrieval; Lecture Notes in Computer Science,
Charalampopoulos, Panagiotis ; Gawrychowski, Paweł ; Mozes, Shay. - p. 290-302 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Planar negative k-cycle:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Gawrychowski, Paweł ; Mozes, Shay ; Weimann, Oren - p. 2717-2724 , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

Fault-Tolerant Distance Labeling for Planar Graphs:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,
Bar-Natan, Aviv ; Charalampopoulos, Panagiotis ; Gawrychowski, Paweł.. - p. 315-333 , 2021
Link: https://doi.org/10.1007/..
 
?
8

Planar Negative k-Cycle:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Gawrychowski, Paweł ; Mozes, Shay ; Weimann, Oren - p. 2717-2724 , 2021
Link: https://doi.org/10.1137/..
 
?
9

Voronoi Diagrams on Planar Graphs, and Computing the Diamet..:

Gawrychowski, Paweł ; Kaplan, Haim ; Mozes, Shay..
SIAM Journal on Computing.  50 (2021)  2 - p. 509-554 , 2021
Link: https://doi.org/10.1137/..
 
?
10

Compressed range minimum queries:

Gawrychowski, Paweł ; Jo, Seungbum ; Mozes, Shay.
Theoretical Computer Science.  812 (2020)  - p. 39-48 , 2020
Link: https://doi.org/10.1016/..
 
?
11

Submatrix Maximum Queries in Monge and Partial Monge Matric..:

Gawrychowski, Paweł ; Mozes, Shay ; Weimann, Oren
ACM Transactions on Algorithms (TALG).  16 (2020)  2 - p. 1-24 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Tree Edit Distance Cannot be Computed in Strongly Subcubic ..:

Bringmann, Karl ; Gawrychowski, Paweł ; Mozes, Shay.
ACM Transactions on Algorithms.  16 (2020)  4 - p. 1-22 , 2020
Link: https://doi.org/10.1145/..
 
?
13

Submatrix Maximum Queries in Monge and Partial Monge Matric..:

Gawrychowski, Paweł ; Mozes, Shay ; Weimann, Oren
ACM Transactions on Algorithms.  16 (2020)  2 - p. 1-24 , 2020
Link: https://doi.org/10.1145/..
 
?
14

Tree Edit Distance Cannot be Computed in Strongly Subcubic ..:

Bringmann, Karl ; Gawrychowski, Paweł ; Mozes, Shay.
ACM Transactions on Algorithms (TALG).  16 (2020)  4 - p. 1-22 , 2020
Link: https://dl.acm.org/doi/1..
 
?
15

Efficient Dynamic Approximate Distance Oracles for Vertex-L..:

Laish, Itay ; Mozes, Shay
Theory of Computing Systems.  63 (2019)  8 - p. 1849-1874 , 2019
Link: https://doi.org/10.1007/..
 
1-15