Travelled to:1 × Austria
1 × Canada
5 × USA
Collaborated with:O.Schwarzkopf R.Seidel P.K.Agarwal ∅ T.Asano T.Tokuyama M.Adler J.Edmonds M.d.Berg C.Lo W.L.Steiger M.Cadek M.Krcál L.Vokrínek U.Wagner
Talks about:algorithm (2) optim (2) probabilist (1) determinist (1) trisector (1) intersect (1) dimension (1) sandwich (1) polynomi (1) piecewis (1)
Person: Jirí Matousek
DBLP: Matousek:Jir=iacute=
Contributed to:
2013200620051993
199219921991Wrote 9 papers:
- STOC-2013-CadekKMVW
- Extending continuous maps: polynomiality and undecidability (MC, MK, JM, LV, UW), pp. 595–604.
- STOC-2006-AsanoMT #distance
- The distance trisector curve (TA, JM, TT), pp. 336–343.
- STOC-2005-AdlerEM #probability #towards
- Towards asymptotic optimality in probabilistic packet marking (MA, JE, JM), pp. 450–459.
- STOC-1993-BergMS #linear
- Piecewise linear paths among convex obstacles (MdB, JM, OS), pp. 505–514.
- STOC-1993-MatousekS #3d #algorithm #problem
- A deterministic algorithm for the three-dimensional diameter problem (JM, OS), pp. 478–484.
- ICALP-1992-MatousekS #algorithm
- A Tail Estimate for Mulmuley’s Segment Intersection Algorithm (JM, RS), pp. 427–438.
- STOC-1992-AgarwalM #parametricity
- Ray Shooting and Parametric Search (PKA, JM), pp. 517–526.
- STOC-1992-LoMS
- Ham-Sandwich Cuts in R^d (CYL, JM, WLS), pp. 539–545.
- STOC-1991-Matousek #approximate #divide and conquer #geometry
- Approximations and Optimal Geometric Divide-And-Conquer (JM), pp. 505–511.