2009 | ||
---|---|---|
398 | EE | Haim Kaplan, Natan Rubin, Micha Sharir: Line transversals of convex polyhedra in R3. SODA 2009: 170-179 |
397 | EE | Ke Chen, Haim Kaplan, Micha Sharir: Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Transactions on Algorithms 5(2): (2009) |
396 | EE | Esther Ezra, János Pach, Micha Sharir: On Regular Vertices of the Union of Planar Convex Objects. Discrete & Computational Geometry 41(2): 216-231 (2009) |
395 | EE | Gabriel Nivasch, Micha Sharir: Eppstein's bound on intersecting triangles revisited. J. Comb. Theory, Ser. A 116(2): 494-497 (2009) |
2008 | ||
394 | EE | Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang: Stabbing Convex Polygons with a Segment or a Polygon. ESA 2008: 52-63 |
393 | EE | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak ε-nets and interval chains. SODA 2008: 1194-1203 |
392 | EE | Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth: Extremal problems on triangle areas in two and three dimensions. Symposium on Computational Geometry 2008: 208-217 |
391 | EE | Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir: The complexity of the outer face in arrangements of random segments. Symposium on Computational Geometry 2008: 69-78 |
390 | EE | Pankaj K. Agarwal, Micha Sharir, Emo Welzl: Algorithms for center and Tverberg points. ACM Transactions on Algorithms 5(1): (2008) |
389 | EE | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir: Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Transactions on Algorithms 5(1): (2008) |
388 | EE | Gabriel Nivasch, Micha Sharir: Eppstein's bound on intersecting triangles revisited CoRR abs/0804.4415: (2008) |
387 | EE | Haim Kaplan, Natan Rubin, Micha Sharir: Line Transversals of Convex Polyhedra in R3 CoRR abs/0807.1221: (2008) |
386 | EE | Esther Ezra, Micha Sharir, Alon Efrat: On the performance of the ICP algorithm. Comput. Geom. 41(1-2): 77-93 (2008) |
385 | EE | Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss: Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Discrete & Computational Geometry 39(1-3): 17-37 (2008) |
384 | EE | Yevgeny Schreiber, Micha Sharir: An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. Discrete & Computational Geometry 39(1-3): 500-579 (2008) |
383 | EE | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Discrete & Computational Geometry 39(4): 656-677 (2008) |
382 | EE | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak &epsis;-nets and interval chains. J. ACM 55(6): (2008) |
381 | EE | János Pach, Micha Sharir: On planar intersection graphs with forbidden subgraphs. Journal of Graph Theory 59(3): 205-214 (2008) |
380 | EE | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008) |
2007 | ||
379 | EE | Micha Sharir: Arrangements in Geometry: Recent Advances and Challenges. ESA 2007: 12-16 |
378 | EE | Haim Kaplan, Natan Rubin, Micha Sharir: Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA 2007: 287-298 |
377 | EE | Esther Ezra, Micha Sharir: Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. FOCS 2007: 525-535 |
376 | EE | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Counting colors in boxes. SODA 2007: 785-794 |
375 | EE | Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev: Bi-criteria linear-time approximations for generalized k-mean/median/center. Symposium on Computational Geometry 2007: 19-26 |
374 | EE | Esther Ezra, János Pach, Micha Sharir: On regular vertices on the union of planar objects. Symposium on Computational Geometry 2007: 220-226 |
373 | EE | Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir: Similar simplices in a d-dimensional point set. Symposium on Computational Geometry 2007: 232-238 |
372 | EE | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir: Computing the volume of the union of cubes. Symposium on Computational Geometry 2007: 294-301 |
371 | EE | Boris Aronov, Sariel Har-Peled, Micha Sharir: On approximate halfspace range counting and relative epsilon-approximations. Symposium on Computational Geometry 2007: 327-336 |
370 | EE | Giora Alexandron, Haim Kaplan, Micha Sharir: Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. 36(2): 144-158 (2007) |
369 | EE | Esther Ezra, Micha Sharir: A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3. Discrete & Computational Geometry 37(1): 21-41 (2007) |
368 | EE | János Pach, Rom Pinchasi, Micha Sharir: Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. Discrete & Computational Geometry 38(2): 399-441 (2007) |
367 | EE | Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl: Online Conflict-Free Coloring for Intervals. SIAM J. Comput. 36(5): 1342-1359 (2007) |
366 | EE | Roel Apfelbaum, Micha Sharir: Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes. SIAM J. Discrete Math. 21(3): 707-725 (2007) |
2006 | ||
365 | EE | Dan Feldman, Amos Fiat, Micha Sharir: Coresets forWeighted Facilities and Their Applications. FOCS 2006: 315-324 |
364 | EE | Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir: Computing a Center-Transversal Line. FSTTCS 2006: 93-104 |
363 | EE | Haim Kaplan, Micha Sharir: Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. SODA 2006: 484-493 |
362 | EE | Micha Sharir, Emo Welzl: On the number of crossing-free matchings, (cycles, and partitions). SODA 2006: 860-869 |
361 | EE | Micha Sharir, Emo Welzl: Random triangulations of planar point sets. Symposium on Computational Geometry 2006: 273-281 |
360 | EE | Yevgeny Schreiber, Micha Sharir: An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. Symposium on Computational Geometry 2006: 30-39 |
359 | EE | Vladlen Koltun, Micha Sharir: On overlays and minimization diagrams. Symposium on Computational Geometry 2006: 395-401 |
358 | EE | Haim Kaplan, Micha Sharir, Elad Verbin: Colored intersection searching via sparse rectangular matrix multiplication. Symposium on Computational Geometry 2006: 52-60 |
357 | EE | Esther Ezra, Micha Sharir, Alon Efrat: On the ICP algorithm. Symposium on Computational Geometry 2006: 95-104 |
356 | EE | Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner: k-Sets in Four Dimensions. Discrete & Computational Geometry 35(2): 177-191 (2006) |
355 | EE | Eduard Oks, Micha Sharir: Minkowski Sums of Monotone and General Simple Polygons. Discrete & Computational Geometry 35(2): 223-240 (2006) |
354 | EE | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir: On the Union of kappa-Round Objects in Three and Four Dimensions. Discrete & Computational Geometry 36(4): 511-526 (2006) |
353 | EE | Rom Pinchasi, Rados Radoicic, Micha Sharir: On empty convex polygons in a planar point set. J. Comb. Theory, Ser. A 113(3): 385-419 (2006) |
352 | EE | Micha Sharir, Emo Welzl: On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. 36(3): 695-720 (2006) |
351 | EE | Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir: Computing Maximally Separated Sets in the Plane. SIAM J. Comput. 36(3): 815-834 (2006) |
2005 | ||
350 | EE | Micha Sharir: The interface between computational and combinatorial geometry. SODA 2005: 137-145 |
349 | EE | Micha Sharir, Hayim Shaul: Ray shooting amid balls, farthest point from a line, and range emptiness searching. SODA 2005: 525-534 |
348 | EE | Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl: Online conflict-free coloring for intervals. SODA 2005: 545-554 |
347 | EE | Giora Alexandron, Haim Kaplan, Micha Sharir: Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. WADS 2005: 269-281 |
346 | EE | Rom Pinchasi, Micha Sharir: On Graphs That Do Not Contain The Cube And Related Problems. Combinatorica 25(5): 615-623 (2005) |
345 | EE | Micha Sharir, Hayim Shaul: Ray shooting and stone throwing with near-linear storage. Comput. Geom. 30(3): 239-252 (2005) |
344 | EE | Esther Ezra, Micha Sharir: Counting and representing intersections among triangles in three dimensions. Comput. Geom. 32(3): 196-215 (2005) |
343 | EE | Boris Aronov, Vladlen Koltun, Micha Sharir: Incidences between Points and Circles in Three and Higher Dimensions. Discrete & Computational Geometry 33(2): 185-206 (2005) |
342 | EE | Boris Aronov, Vladlen Koltun, Micha Sharir: Cutting Triangular Cycles of Lines in Space. Discrete & Computational Geometry 33(2): 231-247 (2005) |
341 | EE | Sharona Feldman, Micha Sharir: An Improved Bound for Joints in Arrangements of Lines in Space. Discrete & Computational Geometry 33(2): 307-320 (2005) |
340 | EE | Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir: Lines Avoiding Unit Balls in Three Dimensions. Discrete & Computational Geometry 34(2): 231-250 (2005) |
339 | EE | János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth: Topological Graphs with No Large Grids. Graphs and Combinatorics 21(3): 355-364 (2005) |
338 | EE | Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir: Crossing patterns of semi-algebraic sets. J. Comb. Theory, Ser. A 111(2): 310-326 (2005) |
337 | EE | Raimund Seidel, Micha Sharir: Top-Down Analysis of Path Compression. SIAM J. Comput. 34(3): 515-525 (2005) |
336 | EE | Pankaj K. Agarwal, Micha Sharir: Pseudo-Line Arrangements: Duality, Algorithms, and Applications. SIAM J. Comput. 34(3): 526-552 (2005) |
335 | EE | Vladlen Koltun, Micha Sharir: Curve-Sensitive Cuttings. SIAM J. Comput. 34(4): 863-878 (2005) |
334 | EE | Esther Ezra, Micha Sharir: Output-Sensitive Construction of the Union of Triangles. SIAM J. Comput. 34(6): 1331-1351 (2005) |
333 | EE | Roel Apfelbaum, Micha Sharir: Repeated Angles in Three and Four Dimensions. SIAM J. Discrete Math. 19(2): 294-300 (2005) |
2004 | ||
332 | EE | Gady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp: Geometrically aware communication in random wireless networks. PODC 2004: 310-319 |
331 | EE | Eti Ezra, Micha Sharir: Output-sensitive construction of the union of triangles. SODA 2004: 420-429 |
330 | EE | Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir: Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. SODA 2004: 516-525 |
329 | EE | Joseph S. B. Mitchell, Micha Sharir: New results on shortest paths in three dimensions. Symposium on Computational Geometry 2004: 124-133 |
328 | EE | Esther Ezra, Micha Sharir: Counting and representing intersections among triangles in three dimensions. Symposium on Computational Geometry 2004: 210-219 |
327 | EE | Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir: On lines avoiding unit balls in three dimensions. Symposium on Computational Geometry 2004: 36-45 |
326 | EE | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir: On the union of kapa-round objects. Symposium on Computational Geometry 2004: 383-390 |
325 | EE | Rom Pinchasi, Rados Radoicic, Micha Sharir: On empty convex polygons in a planar point set. Symposium on Computational Geometry 2004: 391-400 |
324 | EE | Pankaj K. Agarwal, Micha Sharir, Emo Welzl: Algorithms for center and Tverberg points. Symposium on Computational Geometry 2004: 61-67 |
323 | EE | János Pach, Rom Pinchasi, Micha Sharir: Solution of Scott's problem on the number of directions determined by a point set in 3-space. Symposium on Computational Geometry 2004: 76-85 |
322 | Micha Sharir, Emo Welzl: Point-Line Incidences in Space. Combinatorics, Probability & Computing 13(2): 203-220 (2004) | |
321 | Boris Aronov, János Pach, Micha Sharir, Gábor Tardos: Distinct Distances in Three and Higher Dimensions. Combinatorics, Probability & Computing 13(3): 283-293 (2004) | |
320 | Shakhar Smorodinsky, Micha Sharir: Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. Combinatorics, Probability & Computing 13(3): 389-411 (2004) | |
319 | EE | Eti Ezra, Dan Halperin, Micha Sharir: Speeding up the incremental construction of the union of geometric objects in practice. Comput. Geom. 27(1): 63-85 (2004) |
318 | EE | Boris Aronov, Robert Schiffenbauer, Micha Sharir: On the number of views of translates of a cube and related problems. Comput. Geom. 27(2): 179-192 (2004) |
317 | EE | Vladlen Koltun, Micha Sharir: Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. Discrete & Computational Geometry 31(1): 83-124 (2004) |
316 | EE | Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir: Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. Discrete & Computational Geometry 31(2): 207-227 (2004) |
315 | EE | Boris Aronov, Micha Sharir: Cell Complexities in Hyperplane Arrangements. Discrete & Computational Geometry 32(1): 107-115 (2004) |
314 | EE | Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky: Lenses in arrangements of pseudo-circles and their applications. J. ACM 51(2): 139-186 (2004) |
313 | EE | János Pach, Rom Pinchasi, Micha Sharir: On the number of directions determined by a three-dimensional points set. J. Comb. Theory, Ser. A 108(1): 1-16 (2004) |
312 | EE | Volker Kaibel, Rafael Mechtel, Micha Sharir, Günter M. Ziegler: The Simplex Algorithm in Dimension Three. SIAM J. Comput. 34(2): 475-497 (2004) |
2003 | ||
311 | EE | Micha Sharir, Hayim Shaul: Ray Shooting and Stone Throwing. ESA 2003: 470-481 |
310 | EE | Boris Aronov, János Pach, Micha Sharir, Gábor Tardos: Distinct distances in three and higher dimensions. STOC 2003: 541-546 |
309 | EE | Boris Aronov, Vladlen Koltun, Micha Sharir: Cutting triangular cycles of lines in space. STOC 2003: 547-555 |
308 | EE | János Pach, Rom Pinchasi, Micha Sharir: A tight bound for the number of different directions in three dimensions. Symposium on Computational Geometry 2003: 106-113 |
307 | EE | Vladlen Koltun, Micha Sharir: Curve-sensitive cuttings. Symposium on Computational Geometry 2003: 136-143 |
306 | EE | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang: Hausdorff distance under translation for points and balls. Symposium on Computational Geometry 2003: 282-291 |
305 | EE | Micha Sharir, Shakhar Smorodinsky: Extremal Configurations and Levels in Pseudoline Arrangements. WADS 2003: 127-139 |
304 | Micha Sharir: The Clarkson-Shor Technique Revisited And Extended. Combinatorics, Probability & Computing 12(2): (2003) | |
303 | EE | János Pach, Ido Safruti, Micha Sharir: The Union of Congruent Cubes in Three Dimensions. Discrete & Computational Geometry 30(1): 133-160 (2003) |
302 | EE | Micha Sharir, Shakhar Smorodinsky: On neighbors in geometric permutations. Discrete Mathematics 268(1-3): 327-335 (2003) |
301 | EE | Gennady Pustylnik, Micha Sharir: The Minkowski sum of a simple polygon and a segment. Inf. Process. Lett. 85(4): 179-184 (2003) |
300 | EE | Vladlen Koltun, Micha Sharir: 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. SIAM J. Comput. 32(3): 616-642 (2003) |
299 | EE | Vladlen Koltun, Micha Sharir: The Partition Technique for Overlays of Envelopes. SIAM J. Comput. 32(4): 841-863 (2003) |
2002 | ||
298 | EE | Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl: Translating a Planar Object to Maximize Point Containment. ESA 2002: 42-53 |
297 | EE | Eti Ezra, Dan Halperin, Micha Sharir: Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA 2002: 473-484 |
296 | EE | Vladlen Koltun, Micha Sharir: The Partition Technique for Overlays of Envelopes. FOCS 2002: 637- |
295 | EE | Pankaj K. Agarwal, Micha Sharir: Pseudo-line arrangements: duality, algorithms, and applications. SODA 2002: 800-809 |
294 | EE | Vladlen Koltun, Micha Sharir: On the overlay of envelopes in four dimensions. SODA 2002: 810-819 |
293 | EE | Micha Sharir, Shakhar Smorodinsky: On Neighbors in Geometric Permutations. SWAT 2002: 131-139 |
292 | EE | Micha Sharir, Emo Welzl: Point-line incidences in space. Symposium on Computational Geometry 2002: 107-115 |
291 | EE | Boris Aronov, Vladlen Koltun, Micha Sharir: Incidences between points and circles in three and higher dimensions. Symposium on Computational Geometry 2002: 116-122 |
290 | EE | Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky: Lenses in arrangements of pseudo-circles and their applications. Symposium on Computational Geometry 2002: 123-132 |
289 | EE | Vladlen Koltun, Micha Sharir: Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. Symposium on Computational Geometry 2002: 217-226 |
288 | EE | Vladlen Koltun, Micha Sharir: Polyhedral Voronoi diagrams of polyhedra in three dimensions. Symposium on Computational Geometry 2002: 227-236 |
287 | Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23(2): 195-207 (2002) | |
286 | EE | Boris Aronov, Micha Sharir: Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. Discrete & Computational Geometry 28(4): 475-490 (2002) |
285 | EE | Dan Halperin, Micha Sharir, Kenneth Y. Goldberg: The 2-Center Problem with Obstacles. J. Algorithms 42(1): 109-134 (2002) |
2001 | ||
284 | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: On the Complexity of Many Faces in Arrangements of Circles. FOCS 2001: 74-83 | |
283 | EE | Sariel Har-Peled, Micha Sharir: Online point location in planar arrangements and its applications. SODA 2001: 57-66 |
282 | EE | Pankaj K. Agarwal, Micha Sharir: On the number of congruent simplices in a point. Symposium on Computational Geometry 2001: 1-9 |
281 | EE | Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. Symposium on Computational Geometry 2001: 141-150 |
280 | EE | János Pach, Ido Safruti, Micha Sharir: The union of congruent cubes in three dimensions. Symposium on Computational Geometry 2001: 19-28 |
279 | EE | Micha Sharir: The Clarkson-Shor technique revisited and extended. Symposium on Computational Geometry 2001: 252-256 |
278 | EE | Micha Sharir, Emo Welzl: Balanced lines, halving triangles, and the generalized lower bound theorem. Symposium on Computational Geometry 2001: 315-318 |
277 | EE | Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS 2001: 122-134 |
276 | EE | Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. Discrete & Computational Geometry 25(2): 203-220 (2001) |
275 | EE | Sariel Har-Peled, Micha Sharir: Online Point Location in Planar Arrangements and Its Applications. Discrete & Computational Geometry 26(1): 19-40 (2001) |
274 | EE | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos: An Improved Bound for k-Sets in Three Dimensions. Discrete & Computational Geometry 26(2): 195-204 (2001) |
273 | EE | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Discrete & Computational Geometry 26(3): 307-320 (2001) |
272 | EE | Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir: On the Complexity of Arrangements of Circles in the Plane. Discrete & Computational Geometry 26(4): 465-492 (2001) |
271 | EE | János Pach, Micha Sharir: Radial Points in the Plane. Eur. J. Comb. 22(6): 855-863 (2001) |
2000 | ||
270 | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos: An Improved Bound for k-Sets in Three Dimensions. EWCG 2000: 132-135 | |
269 | EE | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Exact and approximation algorithms for minimum-width cylindrical shells. SODA 2000: 510-517 |
268 | EE | Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir: Computing the Penetration Depth of Two Convex Polytopes in 3D. SWAT 2000: 328-338 |
267 | EE | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos: An improved bound for k-sets in three dimensions. Symposium on Computational Geometry 2000: 43-49 |
266 | EE | Dan Halperin, Micha Sharir, Kenneth Y. Goldberg: The 2-center problem with obstacles. Symposium on Computational Geometry 2000: 80-90 |
265 | Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic data structures for fat objects and their applications. Comput. Geom. 15(4): 215-227 (2000) | |
264 | EE | Alon Efrat, Micha Sharir: On the Complexity of the Union of Fat Convex Objects in the Plane. Discrete & Computational Geometry 23(2): 171-189 (2000) |
263 | EE | Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir: Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. Discrete & Computational Geometry 23(2): 247-259 (2000) |
262 | EE | Pankaj K. Agarwal, Micha Sharir: Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. Discrete & Computational Geometry 24(4): 645-657 (2000) |
261 | EE | Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir: Approximation Algorithms for Minimum-Width Annuli and Shells. Discrete & Computational Geometry 24(4): 687-705 (2000) |
260 | Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir: Penetration Depth of Two Convex Polytopes in 3D. Nord. J. Comput. 7(3): 227-240 (2000) | |
1999 | ||
259 | EE | Micha Sharir: Recent Developments in the Theory of Arrangements of Surfaces. FSTTCS 1999: 1-20 |
258 | EE | Pankaj K. Agarwal, Micha Sharir: Motion Planning of a Ball Amid Segments in Three Dimensions. SODA 1999: 21-30 |
257 | EE | Pankaj K. Agarwal, Micha Sharir: Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. Symposium on Computational Geometry 1999: 143-153 |
256 | EE | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Symposium on Computational Geometry 1999: 31-40 |
255 | EE | Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir: Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Symposium on Computational Geometry 1999: 380-389 |
254 | EE | Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir: Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. Symposium on Computational Geometry 1999: 400-406 |
253 | Gill Barequet, Micha Sharir: Partial surface matching by using directed footprints. Comput. Geom. 12(1-2): 45-62 (1999) | |
252 | EE | János Pach, Micha Sharir: On the Boundary of the Union of Planar Convex Sets. Discrete & Computational Geometry 21(3): 321-328 (1999) |
251 | EE | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Discrete & Computational Geometry 21(3): 373-388 (1999) |
250 | EE | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Motion Planning for a Convex Polygon in a Polygonal Environment. Discrete & Computational Geometry 22(2): 201-221 (1999) |
249 | Pankaj K. Agarwal, Alon Efrat, Micha Sharir: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SIAM J. Comput. 29(3): 912-953 (1999) | |
1998 | ||
248 | EE | Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334 |
247 | EE | Pankaj K. Agarwal, Micha Sharir: Efficient Algorithms for Geometric Optimization. ACM Comput. Surv. 30(4): 412-458 (1998) |
246 | János Pach, Micha Sharir: On the Number of Incidences Between Points and Curves. Combinatorics, Probability & Computing 7(1): 121-127 (1998) | |
245 | EE | Pankaj K. Agarwal, Nina Amenta, Micha Sharir: Largest Placement of One Convex Polygon Inside Another. Discrete & Computational Geometry 19(1): 95-104 (1998) |
244 | EE | Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir: On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discrete & Computational Geometry 19(3): 315-331 (1998) |
243 | EE | Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec: Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. Discrete & Computational Geometry 19(4): 485-519 (1998) |
242 | EE | Pankaj K. Agarwal, Micha Sharir, Emo Welzl: The Discrete 2-Center Problem. Discrete & Computational Geometry 20(3): 287-305 (1998) |
241 | L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl: Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. J. Algorithms 29(2): 238-255 (1998) | |
1997 | ||
240 | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. SODA 1997: 483-492 | |
239 | EE | Alon Efrat, Micha Sharir: On the Complexity of the Union of Fat Objects in the Plane. Symposium on Computational Geometry 1997: 104-112 |
238 | EE | Pankaj K. Agarwal, Micha Sharir, Emo Welzl: The Discrete 2-Center Problem. Symposium on Computational Geometry 1997: 147-155 |
237 | EE | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Symposium on Computational Geometry 1997: 30-38 |
236 | Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic Data Structures for Fat Objects and Their Applications. WADS 1997: 297-306 | |
235 | Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir: Quasi-Planar Graphs Have a Linear Number of Edges. Combinatorica 17(1): 1-9 (1997) | |
234 | Boris Aronov, Micha Sharir: The Common Exterior of Convex Polygons in the Plane. Comput. Geom. 8: 139-149 (1997) | |
233 | EE | Micha Sharir: Optimized-motion planning - theory and implementation by Cherif Ahrikencheikh and Ali Seireg : John Wiley & Sons Inc., Chichester (1994) 366 pp, ISBN 0-471-01903-8. Computer-Aided Design 29(9): 672 (1997) |
232 | EE | Klara Kedem, Micha Sharir, Sivan Toledo: On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. Discrete & Computational Geometry 17(2): 227-239 (1997) |
231 | EE | Micha Sharir: A Near-Linear Algorithm for the Planar 2-Center Problem. Discrete & Computational Geometry 18(2): 125-134 (1997) |
230 | EE | Otfried Schwarzkopf, Micha Sharir: Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. Discrete & Computational Geometry 18(3): 269-288 (1997) |
229 | EE | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating shortest paths on a convex polytope in three dimensions. J. ACM 44(4): 567-584 (1997) |
228 | Shai Mohaban, Micha Sharir: Ray Shooting Amidst Spheres in Three Dimensions and Related Problems. SIAM J. Comput. 26(3): 654-674 (1997) | |
227 | Matthew J. Katz, Micha Sharir: An Expander-Based Approach to Geometric Optimization. SIAM J. Comput. 26(5): 1384-1408 (1997) | |
226 | Boris Aronov, Micha Sharir, Boaz Tagansky: The Union of Convex Polyhedra in Three Dimensions. SIAM J. Comput. 26(6): 1670-1688 (1997) | |
225 | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput. 26(6): 1714-1732 (1997) | |
224 | Boris Aronov, Micha Sharir: On Translational Motion Planning of a Convex Polyhedron in 3-Space. SIAM J. Comput. 26(6): 1785-1803 (1997) | |
1996 | ||
223 | Micha Sharir: Arrangements of Curves and Surfaces in Computational Geometry. ISTCS 1996: 44-50 | |
222 | Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir: Efficient Generation of k-Directional Assembly Sequences. SODA 1996: 122-131 | |
221 | EE | Micha Sharir: A Near-Linear Algorithm for the Planar 2-Center Problem. Symposium on Computational Geometry 1996: 106-112 |
220 | EE | Micha Sharir, Emo Welzl: Rectilinear and Polygonal p-Piercing and p-Center Problems. Symposium on Computational Geometry 1996: 122-132 |
219 | EE | Otfried Schwarzkopf, Micha Sharir: Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. Symposium on Computational Geometry 1996: 20-29 |
218 | EE | Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating Shortest Paths on a Convex Polytope in Three Dimensions. Symposium on Computational Geometry 1996: 329-338 |
217 | EE | Gill Barequet, Micha Sharir: Partial Surface Matching by Using Directed Footprints. Symposium on Computational Geometry 1996: C-9-C-10 |
216 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi: Lines in Space: Combinatorics and Algorithms. Algorithmica 15(5): 428-447 (1996) | |
215 | Jirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Algorithmica 16(4/5): 498-516 (1996) | |
214 | EE | Gill Barequet, Micha Sharir: Piecewise-Linear Interpolation between Polygonal Slices. Computer Vision and Image Understanding 63(2): 251-272 (1996) |
213 | EE | Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir: The Overlay of Lower Envelopes and Its Applications. Discrete & Computational Geometry 15(1): 1-13 (1996) |
212 | EE | Dan Halperin, Micha Sharir: A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. Discrete & Computational Geometry 16(2): 121-134 (1996) |
211 | EE | Alon Efrat, Micha Sharir: A Near-Linear Algorithm for the Planar Segment-Center Problem. Discrete & Computational Geometry 16(3): 239-257 (1996) |
210 | EE | Pankaj K. Agarwal, Micha Sharir: Efficient Randomized Algorithms for Some Geometric. Optimization Problems. Discrete & Computational Geometry 16(4): 317-337 (1996) |
209 | EE | Micha Sharir: Excess in Arrangements of Segments. Inf. Process. Lett. 58(5): 245-247 (1996) |
208 | Pankaj K. Agarwal, Micha Sharir: Ray Shooting Amidst Convex Polygons in 2D. J. Algorithms 21(3): 508-519 (1996) | |
207 | Pankaj K. Agarwal, Micha Sharir: Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. SIAM J. Comput. 25(1): 100-116 (1996) | |
1995 | ||
206 | Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir: Quasi-Planar Graphs Have a Linear Number of Edges. Graph Drawing 1995: 1-7 | |
205 | L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl: Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. SODA 1995: 197-204 | |
204 | EE | Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir: The Overlay of Lower Envelopes in Three Dimensions and Its Applications. Symposium on Computational Geometry 1995: 182-189 |
203 | EE | Pankaj K. Agarwal, Micha Sharir: Efficient Randomized Algorithms for Some Geometric Optimization Problems. Symposium on Computational Geometry 1995: 326-335 |
202 | EE | Pankaj K. Agarwal, Alon Efrat, Micha Sharir: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. Symposium on Computational Geometry 1995: 39-50 |
201 | EE | Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec: Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. Symposium on Computational Geometry 1995: 79-88 |
200 | Micha Sharir: Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. WADS 1995: 109-121 | |
199 | Pankaj K. Agarwal, Micha Sharir: Algorithmic Techniques for Geometric Optimization. Computer Science Today 1995: 234-253 | |
198 | Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders for Fat Objects and Related Problems. Comput. Geom. 5: 187-206 (1995) | |
197 | EE | Gill Barequet, Micha Sharir: Filling gaps in the boundary of a polyhedron. Computer Aided Geometric Design 12(2): 207-229 (1995) |
196 | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Improved Bounds on Weak epsilon-Nets for Convex Sets. Discrete & Computational Geometry 13: 1-15 (1995) | |
195 | Bernard Chazelle, Jirí Matousek, Micha Sharir: An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discrete & Computational Geometry 13: 363-381 (1995) | |
194 | Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discrete & Computational Geometry 14(2): 113-122 (1995) | |
193 | Dan Halperin, Micha Sharir: Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Discrete & Computational Geometry 14(4): 385-410 (1995) | |
192 | EE | Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud: Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. 140(2): 301-317 (1995) |
1994 | ||
191 | Alon Efrat, Micha Sharir: A Near-Linear Algorithm for the Planar Segment Center Problem. SODA 1994: 87-97 | |
190 | Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders and Related Problems. SWAT 1994: 1-12 | |
189 | EE | Dan Halperin, Micha Sharir: Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Symposium on Computational Geometry 1994: 11-20 |
188 | EE | Boris Aronov, Micha Sharir: On Translational Motion Planning in 3-Space. Symposium on Computational Geometry 1994: 21-30 |
187 | EE | Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Computing Envelopes in Four Dimensions with Applications. Symposium on Computational Geometry 1994: 348-358 |
186 | EE | Gill Barequet, Micha Sharir: Piecewise-Linear Interpolation Between Polygonal Slices. Symposium on Computational Geometry 1994: 93-102 |
185 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica 11(2): 116-132 (1994) | |
184 | Pankaj K. Agarwal, Micha Sharir: Planar Geometric Location Problems. Algorithmica 11(2): 185-195 (1994) | |
183 | Mark H. Overmars, Micha Sharir: An Improved Technique for Output-Sensitive Hidden Surface Removal. Algorithmica 11(5): 469-484 (1994) | |
182 | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994) | |
181 | Alon Efrat, Micha Sharir, Alon Ziv: Computing the Smallest K-enclosing Circle and Related Problems. Comput. Geom. 4: 119-136 (1994) | |
180 | Micha Sharir, Sivan Toledo: External Polygon Containment Problems. Comput. Geom. 4: 99-118 (1994) | |
179 | Boris Aronov, Micha Sharir: Castles in the Air Revisited. Discrete & Computational Geometry 12: 119-150 (1994) | |
178 | Pankaj K. Agarwal, Micha Sharir: On the Number of Views of Polyhedral Terrains. Discrete & Computational Geometry 12: 177-182 (1994) | |
177 | Dan Halperin, Micha Sharir: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. Discrete & Computational Geometry 12: 313-326 (1994) | |
176 | Micha Sharir: Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. Discrete & Computational Geometry 12: 327-345 (1994) | |
175 | Dan Halperin, Micha Sharir: On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 51(1): 53-56 (1994) | |
174 | EE | John H. Reif, Micha Sharir: Motion Planning in the Presence of Moving Obstacles. J. ACM 41(4): 764-790 (1994) |
173 | Pankaj K. Agarwal, Micha Sharir, Sivan Toledo: Applications of Parametric Searching in Geometric Optimization. J. Algorithms 17(3): 292-318 (1994) | |
172 | Boris Aronov, Jirí Matousek, Micha Sharir: On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory, Ser. A 65(2): 311-321 (1994) | |
171 | Micha Sharir: On Joints in Arrangements of Lines in Space and Related Problems. J. Comb. Theory, Ser. A 67(1): 89-99 (1994) | |
170 | Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl: Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. 23(1): 154-169 (1994) | |
169 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Selecting Heavily Covered Points. SIAM J. Comput. 23(6): 1138-1151 (1994) | |
1993 | ||
168 | Alon Efrat, Günter Rote, Micha Sharir: On the Union of Fat Wedges and Separating a Collection of Segments By a Line. CCCG 1993: 115-120 | |
167 | Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132 | |
166 | Matthew J. Katz, Micha Sharir: Optimal Slope Selection Via Expanders. CCCG 1993: 139-144 | |
165 | Micha Sharir: Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments. CCCG 1993: 181-186 | |
164 | Klara Kedem, Micha Sharir, Sivan Toledo: On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane. CCCG 1993: 204-209 | |
163 | Alon Efrat, Micha Lindenbaum, Micha Sharir: Finding Maximally Consistent Sets of Halfspaces. CCCG 1993: 432-436 | |
162 | Pankaj K. Agarwal, Micha Sharir: On the Number of Views of Polyhedral Terrains. CCCG 1993: 55-60 | |
161 | Dan Halperin, Micha Sharir: Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment FOCS 1993: 382-391 | |
160 | Micha Sharir: Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions FOCS 1993: 498-507 | |
159 | Boris Aronov, Micha Sharir: The Union of Convex Polyhedra in Three Dimensions FOCS 1993: 518-527 | |
158 | Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir: Reaching a Goal with Directional Uncertainty. ISAAC 1993: 1-10 | |
157 | Pankaj K. Agarwal, Micha Sharir: Ray Shooting Amidst Convex Polytopes in Three Dimensions. SODA 1993: 260-270 | |
156 | EE | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Improved bounds on weak epsilon-nets for convex sets. STOC 1993: 495-504 |
155 | EE | Dan Halperin, Micha Sharir: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. Symposium on Computational Geometry 1993: 11-18 |
154 | EE | Matthew J. Katz, Micha Sharir: An Expander-Based Approach to Geometric Optimization. Symposium on Computational Geometry 1993: 198-207 |
153 | EE | Y. B. Karasik, Micha Sharir: The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry. Symposium on Computational Geometry 1993: 379-388 |
152 | EE | Estarose Wolfson, Micha Sharir: Implementation of a Motion Planning System in Three Dimensions. Symposium on Computational Geometry 1993: 399-400 |
151 | Alon Efrat, Micha Sharir, Alon Ziv: Computing the Smallest k-Enclosing Circle and Related Problems. WADS 1993: 325-336 | |
150 | Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri: Selecting Distances in the Plane. Algorithmica 9(5): 495-514 (1993) | |
149 | Micha Sharir: k-sets and random hulls. Combinatorica 13(4): 483-496 (1993) | |
148 | Kurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. 3: 235-246 (1993) | |
147 | Alon Efrat, Günter Rote, Micha Sharir: On the Union of Fat Wedges and Separating a Collection of Segments By a Line. Comput. Geom. 3: 277-288 (1993) | |
146 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Diameter, Width, Closest Line Pair, and Parametric Searching. Discrete & Computational Geometry 10: 183-196 (1993) | |
145 | Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir: An Invariant Property of Balls in Arrangements of Hyperplanes. Discrete & Computational Geometry 10: 421-425 (1993) | |
144 | Pankaj K. Agarwal, Micha Sharir: Applications of a New Space-Partitioning Technique. Discrete & Computational Geometry 9: 11-38 (1993) | |
143 | Boris Aronov, Marco Pellegrini, Micha Sharir: On the Zone of a Surface in a Hyperplane Arrangement. Discrete & Computational Geometry 9: 177-186 (1993) | |
142 | Daniel P. Huttenlocher, Klara Kedem, Micha Sharir: The Upper Envelope of voronoi Surfaces and Its Applications. Discrete & Computational Geometry 9: 267-291 (1993) | |
141 | Matthew J. Katz, Micha Sharir: Optimal Slope Selection via Expanders. Inf. Process. Lett. 47(3): 115-122 (1993) | |
140 | Pankaj K. Agarwal, Micha Sharir: Circular visibility of a simple polygon from a fixed point. Int. J. Comput. Geometry Appl. 3(1): 1-25 (1993) | |
139 | Pankaj K. Agarwal, Micha Sharir: Circle Shooting in a Simple Polygon. J. Algorithms 14(1): 69-87 (1993) | |
138 | Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo: Computing a Segment Center for a Planar Point Set. J. Algorithms 15(2): 314-323 (1993) | |
137 | Herbert Edelsbrunner, Raimund Seidel, Micha Sharir: On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. 22(2): 418-429 (1993) | |
136 | Pankaj K. Agarwal, Marco Pellegrini, Micha Sharir: Counting Circular Arc Intersections. SIAM J. Comput. 22(4): 778-793 (1993) | |
135 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. 22(6): 1286-1302 (1993) | |
1992 | ||
134 | EE | Pankaj K. Agarwal, Micha Sharir, Sivan Toledo: Applications of Parametric Searching in Geometric Optimization. SODA 1992: 72-82 |
133 | EE | Kurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA 1992: 89-93 |
132 | Micha Sharir, Emo Welzl: A Combinatorial Bound for Linear Programming and Related Problems. STACS 1992: 569-579 | |
131 | EE | Jirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Symposium on Computational Geometry 1992: 1-8 |
130 | EE | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Diameter, Width, Closest Line Pair, and Parametric Searching. Symposium on Computational Geometry 1992: 120-129 |
129 | EE | Boris Aronov, Micha Sharir: Castles in the Air Revisited. Symposium on Computational Geometry 1992: 146-156 |
128 | EE | Y. B. Karasik, Micha Sharir: Optical Computational Geometry. Symposium on Computational Geometry 1992: 232-241 |
127 | EE | Micha Sharir, Mark H. Overmars: A Simple Output-Sensitive Algorithm for Hidden Surface Removal. ACM Trans. Graph. 11(1): 1-11 (1992) |
126 | Leonidas J. Guibas, Donald E. Knuth, Micha Sharir: Randomized Incremental Construction of Delaunay and Voronoi Diagrams. Algorithmica 7(4): 381-413 (1992) | |
125 | Jacob T. Schwartz, Micha Sharir: Finding Effective ``Force Targets'' for Two-Dimensional Multifinger Frictional Grips. Algorithmica 8(1): 1-20 (1992) | |
124 | Bernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Algorithmica 8(5&6): 407-429 (1992) | |
123 | Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: The number of edges of many faces in a line segment arrangement. Combinatorica 12(3): 261-274 (1992) | |
122 | Matthew J. Katz, Mark H. Overmars, Micha Sharir: Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. 2: 223-234 (1992) | |
121 | János Pach, Micha Sharir: Repeated Angles in the Plane and Related Problems. J. Comb. Theory, Ser. A 59(1): 12-22 (1992) | |
120 | Dan Halperin, Mark H. Overmars, Micha Sharir: Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992) | |
119 | Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir: Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. 92(2): 319-336 (1992) | |
1991 | ||
118 | Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl: Fat Triangles Determine Linearly Many Holes FOCS 1991: 49-58 | |
117 | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646 | |
116 | Herbert Edelsbrunner, Raimund Seidel, Micha Sharir: On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science 1991: 108-123 | |
115 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments. SODA 1991: 441-448 | |
114 | Pankaj K. Agarwal, Micha Sharir: Planar Geometric Location Problems and Maintaining the Width of a Planar Set. SODA 1991: 449-458 | |
113 | EE | Pankaj K. Agarwal, Micha Sharir: Counting Circular Arc Intersections. Symposium on Computational Geometry 1991: 10-20 |
112 | EE | Daniel P. Huttenlocher, Klara Kedem, Micha Sharir: The Upper Envelope of Voronoi Surfaces and Its Applications. Symposium on Computational Geometry 1991: 194-203 |
111 | EE | Boris Aronov, Jirí Matousek, Micha Sharir: On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. Symposium on Computational Geometry 1991: 307-313 |
110 | EE | Matthew J. Katz, Mark H. Overmars, Micha Sharir: Efficient Hidden Surface Removal for Objects with small Union Size. Symposium on Computational Geometry 1991: 31-40 |
109 | Boris Aronov, Micha Sharir: On the Zone of a Surface in a Hyperplane Arrangement. WADS 1991: 13-19 | |
108 | Pankaj K. Agarwal, Micha Sharir: Applications of a New Space Partitioning Technique. WADS 1991: 379-391 | |
107 | Micha Sharir, Shmuel Sifrony: Coordinated Motion Planning for Two Independent Robots. Ann. Math. Artif. Intell. 3(1): 107-130 (1991) | |
106 | Dan Halperin, Micha Sharir: Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. Comput. Geom. 1: 269-303 (1991) | |
105 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. 1: 305-323 (1991) | |
104 | Mark H. Overmars, Micha Sharir: Merging Visibility Maps. Comput. Geom. 1: 35-49 (1991) | |
103 | Pankaj K. Agarwal, Micha Sharir: Off-line Dynamic Maintenance of the Width of a Planar Point Set. Comput. Geom. 1: 65-78 (1991) | |
102 | Micha Sharir: On k-Sets in Arrangement of Curves and Surfaces. Discrete & Computational Geometry 6: 593-613 (1991) | |
101 | EE | Micha Sharir, Steven Skiena: Tight bounds on a problem of lines and intersections. Discrete Mathematics 89(3): 313-314 (1991) |
100 | Dan Halperin, Micha Sharir: On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 40(4): 189-192 (1991) | |
99 | János Pach, Micha Sharir: On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm. SIAM J. Comput. 20(3): 460-470 (1991) | |
98 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. Theor. Comput. Sci. 84(1): 77-105 (1991) | |
1990 | ||
97 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space FOCS 1990: 242-251 | |
96 | Leonidas J. Guibas, Donald E. Knuth, Micha Sharir: Randomized Incremental Construction of Delaunay and Voronoi Diagrams. ICALP 1990: 414-431 | |
95 | Herbert Edelsbrunner, Micha Sharir: A Hyperplane Incidence Problem with Applications to Counting Distances. SIGAL International Symposium on Algorithms 1990: 419-428 | |
94 | EE | Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger: Points and Triangles in the Plane and Halving Planes in Space. Symposium on Computational Geometry 1990: 112-115 |
93 | EE | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Slimming Down by Adding: Selecting Heavily Covered Points. Symposium on Computational Geometry 1990: 116-127 |
92 | EE | Mark H. Overmars, Micha Sharir: Merging Visibility Maps. Symposium on Computational Geometry 1990: 168-176 |
91 | EE | Bernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Symposium on Computational Geometry 1990: 23-33 |
90 | EE | Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri: Selecting Distances in the Plane. Symposium on Computational Geometry 1990: 321-331 |
89 | EE | Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger: The Combinatorial Complexity of Hyperplane Transversals. Symposium on Computational Geometry 1990: 83-91 |
88 | Jacob T. Schwartz, Micha Sharir: Algorithmic Motion Planning in Robotics. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 391-430 | |
87 | Mark H. Overmars, Haijo Schipper, Micha Sharir: Storing Line Segments in Partition Trees. BIT 30(3): 385-403 (1990) | |
86 | Boris Aronov, Micha Sharir: Triangles in space or building (and analyzing) castles in the air. Combinatorica 10(2): 137-173 (1990) | |
85 | Imre Bárány, Micha Sharir: The Caratheodory number for the k-core. Combinatorica 10(2): 185-194 (1990) | |
84 | Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments. Discrete & Computational Geometry 5: 161-196 (1990) | |
83 | Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: The Complexity of Many Cells in Arrangements of Planes and Related Problems. Discrete & Computational Geometry 5: 197-216 (1990) | |
82 | Herbert Edelsbrunner, Micha Sharir: The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2. Discrete & Computational Geometry 5: 35-42 (1990) | |
81 | Klara Kedem, Micha Sharir: An Efficient Motion-planning Algorithm for a Convex Polygonal Object in Two Dimensional Polygonal Space. Discrete & Computational Geometry 5: 43-75 (1990) | |
80 | Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discrete & Computational Geometry 5: 99-160 (1990) | |
79 | Bernard Chazelle, Micha Sharir: An Algorithm for Generalized Point Location and its Applications. J. Symb. Comput. 10(3/4): 281-310 (1990) | |
78 | Jacob T. Schwartz, Micha Sharir: On the Two-Dimensional Davenport Schinzel Problem. J. Symb. Comput. 10(3/4): 371-393 (1990) | |
77 | Pankaj K. Agarwal, Micha Sharir: Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. SIAM J. Comput. 19(2): 297-321 (1990) | |
1989 | ||
76 | Mark H. Overmars, Micha Sharir: Output-Sensitive Hidden Surface Removal FOCS 1989: 598-603 | |
75 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. ICALP 1989: 179-193 | |
74 | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Lines in Space-Combinatorics, Algorithms and Applications STOC 1989: 382-393 | |
73 | János Pach, Micha Sharir: The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. Discrete & Computational Geometry 4: 291-309 (1989) | |
72 | Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. Discrete & Computational Geometry 4: 311-336 (1989) | |
71 | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Discrete & Computational Geometry 4: 433-466 (1989) | |
70 | Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony: On the General Motion-Planning Problem with Two Degrees of Freedom. Discrete & Computational Geometry 4: 491-521 (1989) | |
69 | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: On Arrangement of Jordan Arcs with Three Intersection per Pair. Discrete & Computational Geometry 4: 523-539 (1989) | |
68 | Richard Pollack, Micha Sharir, Günter Rote: Computing the Geodesic Center of a Simple Polygon. Discrete & Computational Geometry 4: 611-626 (1989) | |
67 | Micha Sharir: Algorithmic Motion Planning in Robotics. IEEE Computer 22(3): 9-20 (1989) | |
66 | Micha Sharir: A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder. Inf. Process. Lett. 32(4): 187-190 (1989) | |
65 | EE | Pankaj K. Agarwal, Micha Sharir, Peter W. Shor: Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. J. Comb. Theory, Ser. A 52(2): 228-274 (1989) |
64 | Richard Cole, Micha Sharir: Visibility Problems for Polyhedral Terrains. J. Symb. Comput. 7(1): 11-30 (1989) | |
1988 | ||
63 | Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces FOCS 1988: 568-579 | |
62 | Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir: Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP 1988: 214-229 | |
61 | Leonidas J. Guibas, Mark H. Overmars, Micha Sharir: Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. SWAT 1988: 64-73 | |
60 | EE | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: On Arrangements of Jordan Arcs with Three Intersections per Pair. Symposium on Computational Geometry 1988: 258-265 |
59 | EE | Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony: On the General Motion Planning Problem with Two Degrees of Freedom. Symposium on Computational Geometry 1988: 289-298 |
58 | EE | Micha Sharir, Shmuel Sifrony: Coordinated Motion Planning for Two Independent Robots. Symposium on Computational Geometry 1988: 319-328 |
57 | EE | Klara Kedem, Micha Sharir: An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. Symposium on Computational Geometry 1988: 329-340 |
56 | EE | Boris Aronov, Micha Sharir: Triangles in Space or Building (and Analyzing) Castles in the Air. Symposium on Computational Geometry 1988: 381-391 |
55 | EE | Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: The Complexity of Many Faces in Arrangements of Lines of Segments. Symposium on Computational Geometry 1988: 44-55 |
54 | EE | Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Symposium on Computational Geometry 1988: 56-69 |
53 | EE | Pankaj K. Agarwal, Micha Sharir: Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. Symposium on Computational Geometry 1988: 70-80 |
52 | Jacob T. Schwartz, Micha Sharir: A Survey of Motion Planning and Related Geometric Algorithms. Artif. Intell. 37(1-3): 157-169 (1988) | |
51 | Micha Sharir: Improved lower bounds on the length of Davenport - Schinzel sequences. Combinatorica 8(1): 117-124 (1988) | |
50 | P. Pollack, Micha Sharir, Shmuel Sifrony: Separating Two Simple Polygons by a Sequence of Translations. Discrete & Computational Geometry 3: 123-136 (1988) | |
49 | Ady Wiernik, Micha Sharir: Planar Realizations of Nonlinear Davenport-Schnitzel Sequences by Segments. Discrete & Computational Geometry 3: 15-47 (1988) | |
48 | William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 3: 281-293 (1988) | |
47 | Micha Sharir: The Shortest Watchtower and Related Problems for Polyhedral Terrains. Inf. Process. Lett. 29(5): 265-270 (1988) | |
46 | EE | Avikam Baltsan, Micha Sharir: On the shortest paths between two convex polyhedra. J. ACM 35(2): 267-287 (1988) |
1987 | ||
45 | Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir: On the Lower Envelope of Bivariate Functions and its Applications FOCS 1987: 27-37 | |
44 | Jacob T. Schwartz, Micha Sharir: On the Bivariate Function Minimization Problem And Its Applications to Motion Planning. ICALP 1987: 357-363 | |
43 | EE | William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Symposium on Computational Geometry 1987: 1-10 |
42 | Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan: Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. Algorithmica 2: 209-233 (1987) | |
41 | Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap: Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Algorithmica 2: 27-59 (1987) | |
40 | Shmuel Sifrony, Micha Sharir: A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space. Algorithmica 2: 367-402 (1987) | |
39 | Bhubaneswar Mishra, Jacob T. Schwartz, Micha Sharir: On the Existence and Synthesis of Multifinger Positive Grips. Algorithmica 2: 541-558 (1987) | |
38 | Micha Sharir: Almost linear upper bounds on the length of general Davenport-Schinzel sequences. Combinatorica 7(1): 131-143 (1987) | |
37 | Daniel Leven, Micha Sharir: On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space. Discrete & Computational Geometry 2: 255-270 (1987) | |
36 | Daniel Leven, Micha Sharir: Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams. Discrete & Computational Geometry 2: 9-31 (1987) | |
35 | Daniel Leven, Micha Sharir: An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers. J. Algorithms 8(2): 192-215 (1987) | |
34 | Richard Cole, Micha Sharir, Chee-Keng Yap: On k-Hulls and Related Problems. SIAM J. Comput. 16(1): 61-77 (1987) | |
33 | Micha Sharir: On Shortest Paths Amidst Convex Polyhedra. SIAM J. Comput. 16(3): 561-572 (1987) | |
1986 | ||
32 | Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony: Geometric Applications of Davenport-Schinzel Sequences FOCS 1986: 77-86 | |
31 | EE | Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan: Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. Symposium on Computational Geometry 1986: 1-13 |
30 | EE | Shmuel Sifrony, Micha Sharir: A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space. Symposium on Computational Geometry 1986: 178-186 |
29 | EE | Micha Sharir, Avikam Baltsan: On Shortest Paths Amidst Convex Polyhedra. Symposium on Computational Geometry 1986: 193-206 |
28 | Sergiu Hart, Micha Sharir: Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes. Combinatorica 6(2): 151-178 (1986) | |
27 | Klara Kedem, Ron Livne, János Pach, Micha Sharir: On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. Discrete & Computational Geometry 1: 59-70 (1986) | |
26 | Sergiu Hart, Micha Sharir: Probabilistic Propositional Temporal Logics Information and Control 70(2/3): 97-155 (1986) | |
25 | Micha Sharir, Amir Schorr: On Shortest Paths in Polyhedral Spaces. SIAM J. Comput. 15(1): 193-215 (1986) | |
1985 | ||
24 | John H. Reif, Micha Sharir: Motion Planning in the Presence of Moving Obstacles FOCS 1985: 144-154 | |
23 | Micha Sharir, Ron Livne: On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel Sequences FOCS 1985: 312-320 | |
22 | Micha Sharir: Intersection and Closest-Pair Problems for a Set of Planar Discs. SIAM J. Comput. 14(2): 448-468 (1985) | |
21 | Sergiu Hart, Micha Sharir: Concurrent Probabilistic Programs, Or: How to Schedule if You Must. SIAM J. Comput. 14(4): 991-1012 (1985) | |
1984 | ||
20 | Sergiu Hart, Micha Sharir: Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme FOCS 1984: 313-319 | |
19 | Sergiu Hart, Micha Sharir: Probabilistic Temporal Logics for Finite and Bounded Models STOC 1984: 1-13 | |
18 | Micha Sharir, Amir Schorr: On Shortest Paths in Polyhedral Spaces STOC 1984: 144-153 | |
17 | Richard Cole, Micha Sharir, Chee-Keng Yap: On k-hulls and Related Problems STOC 1984: 154-166 | |
16 | Micha Sharir, Amir Pnueli, Sergiu Hart: Verification of Probabilistic Programs. SIAM J. Comput. 13(2): 292-314 (1984) | |
1983 | ||
15 | Sergiu Hart, Micha Sharir: Concurrent Probabilistic Program, or: How to Schedule if You Must. ICALP 1983: 304-318 | |
14 | Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap: Retraction: A New Approach to Motion-Planning (Extended Abstract) STOC 1983: 207-220 | |
13 | EE | Stefan M. Freudenberger, Jacob T. Schwartz, Micha Sharir: Experience with the SETL Optimizer. ACM Trans. Program. Lang. Syst. 5(1): 26-45 (1983) |
12 | EE | Sergiu Hart, Micha Sharir, Amir Pnueli: Termination of Probabilistic Concurrent Program. ACM Trans. Program. Lang. Syst. 5(3): 356-380 (1983) |
1982 | ||
11 | Sergiu Hart, Micha Sharir, Amir Pnueli: Termination of Probabilistic Concurrent Programs. POPL 1982: 1-6 | |
10 | EE | Micha Sharir: Some Observations Concerning Formal Differentiation of Set Theoretic Expressions. ACM Trans. Program. Lang. Syst. 4(2): 196-225 (1982) |
9 | EE | Robert B. K. Dewar, Micha Sharir, Elia Weixelbaum: Transformational Derivation of a Garbage Collection Algorithm. ACM Trans. Program. Lang. Syst. 4(4): 650-667 (1982) |
8 | Robert B. K. Dewar, Susan M. Merritt, Micha Sharir: Some Modified Algorithms for Dijkstra's Longest Upsequence Problem. Acta Inf. 18: 1-15 (1982) | |
7 | Micha Sharir: Fast Composition of Sparse Maps. Inf. Process. Lett. 15(4): 183-185 (1982) | |
1981 | ||
6 | Micha Sharir: Data Flow Analysis of Applicative Programs. ICALP 1981: 98-113 | |
5 | EE | Edmond Schonberg, Jacob T. Schwartz, Micha Sharir: An Automatic Technique for Selection of Data Structures in SETL Programs. ACM Trans. Program. Lang. Syst. 3(2): 126-143 (1981) |
4 | Micha Sharir: Formal Integration: A Program Transformation Technique. Comput. Lang. 6(1): 35-46 (1981) | |
1980 | ||
3 | Micha Sharir: Structural Analysis: A New Approch to Flow Analysis in Optimizing Compilers. Comput. Lang. 5(3): 141-153 (1980) | |
1979 | ||
2 | EE | Edmond Schonberg, Jacob T. Schwartz, Micha Sharir: Automatic Data Structure Selection in SETL. POPL 1979: 197-210 |
1 | EE | Ronald J. Mintz, Gerald A. Fisher, Micha Sharir: The design of a global optimizer. SIGPLAN Symposium on Compiler Construction 1979: 226-234 |