J. Matousek. Derandomization in computational geometry. Journal of Algorithms 20 (1996), 545--580. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Solving some discrepancy problems in NC - Mahajan, Ramos, Subrahmanyam (1997) (3 citations) (Correct)
....some 0 ffl 1, the construction can be performed in time O(log n log r) and work O(n log r) The results for the CRCW PRAM model in [13, 14] can be similarly improved. 11 5. 2 Sampling in gemetric configuration spaces Configuration spaces provide a general framework for geometric sampling [11, 8, 24, 22]. A configuration space is a 4 tuple (X; T ; trig; kill) where: X is a finite set of objects, n = jX j; T is a mapping that assigns to each S X a set T (S) called the regions determined by S, let R(X) S X T (S) trig is a mapping R(X) 2 X indicating for each oe 2 R(X) the set of ....
J. Matousek. Derandomization in computational geometry. Available in the web site: http:// www.ms.mff.cuni.cz/ acad/kam/matousek/ Earlier version appeared in J. Algorithms.
Geometric Set Systems - Matousek (1998) (3 citations) (Correct)
....areas of theoretical computer science. In computational geometry, specific techniques have been obtained, which yield, for most of the randomized algorithms studied there, deterministic algorithms with the same or only slightly larger asymptotic complexity. A detailed survey on this subject is [Mat96a] and here we restrict ourselves to few remarks. A randomized algorithm can be viewed as a deterministic algorithm which is allowed to read a finite sequence x of random bits from some special device. Usually, we know that for an overwhelming majority of sequences x 2 f0; 1g n , the algorithm ....
J. Matousek. Derandomization in computational geometry. J. Algorithms, 20:545-- 580, 1996.
Solving Some Discrepancy Problems in NC - Mahajan, Ramos, Subrahmanyam (1997) (3 citations) (Correct)
....time using O(nr c ) work. If (X; R) is linearizable in IR l , then there is a constant ffl = ffl(l) with 0 ffl 1 such that for r n ffl , the construction can be performed in O(log n log r) time and O(n log r) work. 5. 2 Sampling in Geometric Configuration Spaces Configuration spaces [16, 13, 33, 30] provide a general framework for geometric sampling. A configuration space is a 4 tuple (X; T ; D; K) where: X is a finite set of objects; T is a mapping that assigns to each S X the set T (S) of cells determined by S; D is a mapping C(X) 2 X , where C(X) S S X T (S) indicating for ....
J. Matousek. Derandomization in computational geometry. Journal of Algorithms 20 (1996), 545--580.
I/O-Efficient Construction of Voronoi Diagrams - Kumar, Ramos (2002) (Correct)
No context found.
J. Matousek. Derandomization in computational geometry. Journal of Algorithms 20 (1996), 545--580.
Deterministic Sampling and Range Counting in.. - Bagchi, Chaudhary, .. (2004) (Correct)
No context found.
J. Matousek. Derandomization in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 559--595. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
Deterministic Sampling and Range Counting in.. - Bagchi, Chaudhary, .. (2004) (Correct)
No context found.
J. Matousek. Derandomization in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 559--595. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
Deterministic Sampling and Range Counting in.. - Bagchi, Chaudhary, .. (2004) (Correct)
No context found.
J. Matousek. Derandomization in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 559--595. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
Deterministic Sampling and Range Counting in.. - Bagchi, Chaudhary, .. (2004) (Correct)
No context found.
J. Matousek. Derandomization in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 559--595. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
Efficient Data Reduction with EASE - Brönnimann, Chen, Dash, Haas.. (2003) (Correct)
No context found.
J. Matousek. Derandomization in computational geometry. Journal of Algorithms, 20(3):545--580, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC