Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Sharir, Micha"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing the discrete Fréchet distance in subquadratic time
Pankaj K. Agarwal
,
Rinat Ben Avraham
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
43
(2), 2014, pp. 429-449
Reporting neighbors in high-dimensional Euclidean space
Dror Aiger
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
43
(4), 2014, pp. 1363-1395
Improved bounds for the union of locally fat objects in the plane
Boris Aronov
,
Mark de Berg
,
Esther Ezra
,
Micha Sharir
SIAM Journal on Computing
43
(2), 2014, pp. 543-572
Minimum partial-matching and Hausdorff RMS-distance under translation: Combinatorics and algorithms
Rinat Ben-Avraham
,
Matthias Henze
,
Rafel Jaume
,
Balázs Keszegh
,
Orit E. Raz
,
Micha Sharir
,
Igor Tubis
Lecture Notes in Computer Science
8737
, 2014, pp. 100-111
Union of random Minkowski sums and network vulnerability analysis
Pankaj K. Agarwal
,
Haim Kaplan
,
Micha Sharir
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 177-186
On range searching with semialgebraic sets. II
Pankaj K. Agarwal
,
Jiȓí Matous̑ek
,
Micha Sharir
SIAM Journal on Computing
42
(6), 2013, pp. 2039-2062
Distinct distances on two lines
Micha Sharir
,
Adam Sheffer
,
József Solymosi
Journal of Combinatorial Theory Series A
120
(7), 2013, pp. 1732-1736
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique
Micha Sharir
,
Adam Sheffer
,
Emo Welzl
Journal of Combinatorial Theory Series A
120
(4), 2013, pp. 777-794
Improved bounds for incidences between points and circles
Micha Sharir
,
Adam Sheffer
,
Joshua Zahl
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 97-106
Counting plane graphs: Cross-graph charging schemes
Micha Sharir
,
Adam Sheffer
Lecture Notes in Computer Science
7704
, 2013, pp. 19-30
Near-linear approximation algorithms for geometric hitting sets
Pankaj K. Agarwal
,
Esther Ezra
,
Micha Sharir
Algorithmica
63
(1-2), 2012, pp. 1-25
Finding the maximal empty disk containing a query point
Haim Kaplan
,
Micha Sharir
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 287-292
Improved bounds for geometric permutations
Natan Rubin
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
41
(2), 2012, pp. 367-390
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique
Micha Sharir
,
Adam Sheffer
,
Emo Welzl
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 189-198
On lines, joints, and incidences in three dimensions
György Elekes
,
Haim Kaplan
,
Micha Sharir
Journal of Combinatorial Theory Series A
118
(3), 2011, pp. 962-977
Counting plane graphs: Flippability and its applications
Michael Hoffmann
,
Micha Sharir
,
Adam Sheffer
,
Csaba D. Tóth
,
Emo Welzl
Lecture Notes in Computer Science
6844
, 2011, pp. 524-535
Optimal cover of points by disks in a simple polygon
Haim Kaplan
,
Matthew J. Katz
,
Gila Morgenstern
,
Micha Sharir
SIAM Journal on Computing
40
(6), 2011, pp. 1647-1661
Semialgebraic range reporting and emptiness searching with applications
Micha Sharir
,
Hayim Shaul
SIAM Journal on Computing
40
(4), 2011, pp. 1045-1074
On degrees in random triangulations of point sets
Micha Sharir
,
Adam Sheffer
,
Emo Welzl
Journal of Combinatorial Theory Series A
118
(7), 2011, pp. 1979-1999
Guarding a terrain by two watchtowers
Pankaj K. Agarwal
,
Sergey Bereg
,
Ovidiu Daescu
,
Haim Kaplan
,
Simeon Ntafos
,
Micha Sharir
,
Binhai Zhu
Algorithmica
58
(2), 2010, pp. 352-390
Small-size
\epsilon
-nets for axis-parallel rectangles and boxes
Boris Aronov
,
Esther Ezra
,
Micha Sharir
SIAM Journal on Computing
39
(7), 2010, pp. 3248-3282
Approximate halfspace range counting
Boris Aronov
,
Micha Sharir
SIAM Journal on Computing
39
(7), 2010, pp. 2704-2725
On the union of fat tetrahedra in three dimensions
Esther Ezra
,
Micha Sharir
Journal of the ACM
57
(1), 2010, pp. 2: 1-23
Optimal cover of points by disks in a simple polygon
Haim Kaplan
,
Matthew J. Katz
,
Gila Morgenstern
,
Micha Sharir
Lecture Notes in Computer Science
6346
, 2010, pp. 475-486
Line transversals of convex polyhedra in
\mathbb{R}^3
Haim Kaplan
,
Natan Rubin
,
Micha Sharir
SIAM Journal on Computing
39
(7), 2010, pp. 3283-3310
Seiten 1
2
3
4
5
6
>