Pitfalls in computing with pseudorandom determinants

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Pitfalls in computing with pseudorandom determinants

Full text

Pdf (704 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the sixteenth annual symposium on Computational geometry table of contents

Clear Water Bay, Kowloon, Hong Kong

Pages: 148 - 155

Year of Publication: 2000

ISBN:1-58113-224-7

Author

Bernd Gärtner

Institut für Theoretische Informatik, ETH Zürich, ETH Zentrum, CH-8092 Zürich, Switzerland

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 9, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/336154.336195 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	2	Mark de Berg , Marc van Kreveld , Mark Overmars , Otfried Schwarzkopf, Computational geometry: algorithms and applications, Springer-Verlag New York, Inc., Secaucus, NJ, 1997
	3	Olivier Devillers , Franco P. Preparata, A Probabilistic Analysis of the Power of Arithmetic Filters, Brown University, Providence, RI, 1996
	4	J. Edmonds and J.-F. Maurras. Note sur les Q-matrices d'Edmonds. Recherche Opdrationnelle (RAIRO), 31(2):203-209, 1997.
	5	Bernd Gärtner, Exact arithmetic at low cost—a case study in linear programming, Computational Geometry: Theory and Applications, v.13 n.2, p.121-139, June 1999 [doi>10.1016/S0925-7721(99)00012-7 ]
	6	M. GrStschel, L. Lov~z, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin Heidelberg, 1988.
	7	N. Henze. Random triangles in convex regions. J. Appl. Prob., 20:111-125, 1983.
	8	Nicholas J. Higham, Accuracy and Stability of Numerical Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1996
	9	Lutz Kettner , Emo Welzl, One Sided Error Predicates in Geometric Computing, IFIP World Computer Congress on Fundamentals - Foundations of Computer Science, p.13-26, August 31-September 04, 1998
	10	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	11	G. Marsaglia. Regularities in congruential random number generators. Numerische Mathematik, 16:8-10, 1970.
	12	J. R. Shewchuk. Robust adaptive floating-point geometric predicates. Discr. Comput. Geom., 18(3):305-363, 1997.