Artigos com autorizações de acesso público - Micha SharirSaiba mais
4 artigos não disponíveis publicamente
A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model
E Ezra, M Sharir
Discrete & Computational Geometry 61, 735-755, 2019
Autorizações: US National Science Foundation
Erratum:“Breaking the 3/2 barrier for unit distances in three dimensions”
M Sharir, J Zahl
International Mathematics Research Notices 2023 (2), 1795-1800, 2023
Autorizações: Natural Sciences and Engineering Research Council of Canada
Counting and Cutting Rich Lenses in Arrangements of Circles
E Ezra, OE Raz, M Sharir, J Zahl
SIAM Journal on Discrete Mathematics 36 (2), 958-974, 2022
Autorizações: US National Science Foundation, Natural Sciences and Engineering Research …
Algebraic Techniques in Geometry: The 10th Anniversary
M Sharir
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
Autorizações: US National Science Foundation
58 artigos disponíveis publicamente
Small-size ε-nets for axis-parallel rectangles and boxes
B Aronov, E Ezra, M Shair
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
Autorizações: US National Institutes of Health
Dynamic time warping and geometric edit distance: Breaking the quadratic barrier
O Gold, M Sharir
ACM Transactions On Algorithms (TALG) 14 (4), 1-17, 2018
Autorizações: US National Science Foundation
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
H Kaplan, W Mulzer, L Roditty, P Seiferth, M Sharir
Discrete & Computational Geometry 64, 838-904, 2020
Autorizações: US National Science Foundation, German Research Foundation, European …
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited
OE Raz, M Sharir, J Solymosi
Proceedings of the thirtieth annual symposium on Computational geometry, 251-260, 2014
Autorizações: Hungarian Scientific Research Fund
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Time
P Gawrychowski, H Kaplan, S Mozes, M Sharir, O Weimann
SIAM Journal on Computing 50 (2), 509-554, 2021
Autorizações: Federal Ministry of Education and Research, Germany
Polynomials vanishing on Cartesian products: The Elekes–Szabó theorem revisited
OE Raz, M Sharir, F De Zeeuw
Autorizações: US National Science Foundation, Swiss National Science Foundation
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
PK Agarwal, R Klein, C Knauer, S Langerman, P Morin, M Sharir, M Soss
Discrete & Computational Geometry 39 (1), 17-37, 2008
Autorizações: German Research Foundation
Cutting algebraic curves into pseudo-segments and applications
M Sharir, J Zahl
Journal of Combinatorial Theory, Series A 150, 1-35, 2017
Autorizações: US National Science Foundation
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
M Sharir, A Sheffer, E Welzl
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
Autorizações: Swiss National Science Foundation
Distinct distances on two lines
M Sharir, A Sheffer, J Solymosi
Journal of Combinatorial Theory, Series A 120 (7), 1732-1736, 2013
Autorizações: Hungarian Scientific Research Fund
Counting plane graphs: flippability and its applications
M Hoffmann, A Schulz, M Sharir, A Sheffer, CD Tóth, E Welzl
Thirty Essays on Geometric Graph Theory, 303-325, 2012
Autorizações: Swiss National Science Foundation
Submatrix maximum queries in monge matrices and partial monge matrices, and their applications
H Kaplan, S Mozes, Y Nussbaum, M Sharir
ACM Transactions on Algorithms (TALG) 13 (2), 1-42, 2017
Autorizações: US National Science Foundation, Federal Ministry of Education and Research …
Kinetic stable Delaunay graphs
PK Agarwal, J Gao, L Guibas, H Kaplan, V Koltun, N Rubin, M Sharir
Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010
Autorizações: US National Institutes of Health
On degrees in random triangulations of point sets
M Sharir, A Sheffer, E Welzl
Proceedings of the twenty-sixth annual symposium on Computational geometry …, 2010
Autorizações: Swiss National Science Foundation
Near-linear approximation algorithms for geometric hitting sets
PK Agarwal, E Ezra, M Shair
Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009
Autorizações: US National Institutes of Health
Sets with few distinct distances do not have heavy lines
OE Raz, O Roche-Newton, M Sharir
Discrete Mathematics 338 (8), 1484-1492, 2015
Autorizações: Austrian Science Fund
As informações de publicação e financiamento são determinadas automaticamente por um programa de computador