SIGN IN
SIGN UP
Probabilistic analysis for combinatorial functions of moving points
Full Text:
PDF
Buy this Article
Authors:
Li Zhang
Computer Science Department, Stanford University, Stanford, CA
Harish Devarajan
Computer Science Department, Stanford University, Stanford, CA
Julien Basch
Computer Science Department, Stanford University, Stanford, CA
Piotr Indyk
Computer Science Department, Stanford University, Stanford, CA
1997 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 352
· Citation Count: 1
Published in:
· Proceeding
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Pages 442-444
ACM
New York, NY
, USA
©1997
table of contents
ISBN:0-89791-878-9
doi>
10.1145/262839.263075
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
geometrical problems and computations
probabilistic computation
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder