BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × Germany
1 × Israel
1 × Italy
2 × Spain
9 × USA
Collaborated with:
S.Hart L.J.Guibas H.Edelsbrunner B.Aronov J.T.Schwartz B.Chazelle C.Yap A.Schorr ∅ J.Pach E.Ezra V.Koltun D.E.Knuth R.Cole C.Ó'Dúnlaing A.Pnueli E.Schonberg R.J.Mintz G.A.Fisher M.Grigni G.Tardos E.Welzl R.Pollack R.Seidel J.Hershberger J.Snoeyink
Talks about:
applic (4) probabilist (3) program (3) space (3) combinator (2) algorithm (2) problem (2) epsilon (2) concurr (2) motion (2)

Person: Micha Sharir

DBLP DBLP: Sharir:Micha

Contributed to:

STOC 20092009
STOC 20032003
STOC 19931993
ICALP 19911991
ICALP 19901990
ICALP 19891989
STOC 19891989
ICALP 19881988
ICALP 19871987
STOC 19841984
ICALP 19831983
STOC 19831983
POPL 19821982
ICALP 19811981
POPL 19791979
SCC 19791979

Wrote 19 papers:

STOC-2009-AronovES
Small-size epsilon-nets for axis-parallel rectangles and boxes (BA, EE, MS), pp. 639–648.
STOC-2003-AronovKS
Cutting triangular cycles of lines in space (BA, VK, MS), pp. 547–555.
STOC-2003-AronovPST
Distinct distances in three and higher dimensions (BA, JP, MS, GT), pp. 541–546.
STOC-1993-ChazelleEGGSW #bound #set
Improved bounds on weak epsilon-nets for convex sets (BC, HE, MG, LJG, MS, EW), pp. 495–504.
ICALP-1991-ChazelleEGGHSS #using
Ray Shooting in Polygons Using Geodesic Triangulations (BC, HE, MG, LJG, JH, MS, JS), pp. 661–646.
ICALP-1990-GuibasKS #diagrams #incremental #random
Randomized Incremental Construction of Delaunay and Voronoi Diagrams (LJG, DEK, MS), pp. 414–431.
ICALP-1989-ChazelleEGS #algebra
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications (BC, HE, LJG, MS), pp. 179–193.
STOC-1989-ChazelleEGS #algorithm #combinator
Lines in Space-Combinatorics, Algorithms and Applications (BC, HE, LJG, MS), pp. 382–393.
ICALP-1988-EdelsbrunnerGPPSS #algorithm #combinator
Arrangements of Curves in the Plane — Topology, Combinatorics, and Algorithms (HE, LJG, JP, RP, RS, MS), pp. 214–229.
ICALP-1987-SchwartzS #on the #problem
On the Bivariate Function Minimization Problem And Its Applications to Motion Planning (JTS, MS), pp. 357–363.
STOC-1984-ColeSY #on the #problem
On k-hulls and Related Problems (RC, MS, CKY), pp. 154–166.
STOC-1984-HartS #bound #finite #logic #modelling #probability
Probabilistic Temporal Logics for Finite and Bounded Models (SH, MS), pp. 1–13.
STOC-1984-SharirS #on the
On Shortest Paths in Polyhedral Spaces (MS, AS), pp. 144–153.
ICALP-1983-HartS #concurrent #how #probability
Concurrent Probabilistic Program, or: How to Schedule if You Must (SH, MS), pp. 304–318.
STOC-1983-ODunlaingSY #approach #named
Retraction: A New Approach to Motion-Planning (CÓ, MS, CKY), pp. 207–220.
POPL-1982-HartSP #concurrent #probability #source code #termination
Termination of Probabilistic Concurrent Programs (SH, MS, AP), pp. 1–6.
ICALP-1981-Sharir #analysis #data flow #source code
Data Flow Analysis of Applicative Programs (MS), pp. 98–113.
POPL-1979-SchonbergSS #automation #data type
Automatic Data Structure Selection in SETL (ES, JTS, MS), pp. 197–210.
SCC-1979-MintzFS #design
The design of a global optimizer (RJM, GAF, MS), pp. 226–234.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.