SIGN IN
SIGN UP
Crossing families
Full Text:
PDF
Buy this Article
Authors:
Boris Aronov
Department of Computer Science, Polytechnic University
Paul Erdős
Mathematical Institute of the Hungarian Academy of Sciences
Wayne Goddard
Department of Mathematics, Massachusetts Institute of Technology
Daniel J. Kleitman
Department of Mathematics, Massachusetts Institute of Technology
Michael Klugerman
Department of Mathematics, Massachusetts Institute of Technology
János Pach
Mathematical Institute of the Hungarian Academy of Sciences and Courant Institute, New York University
Leonard J. Schulman
Department of Mathematics, Massachusetts Institute of Technology
1991 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 13
· Downloads (cumulative): 217
· Citation Count: 0
Published in:
· Proceeding
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Pages 351-356
ACM
New York, NY
, USA
©1991
table of contents
ISBN:0-89791-426-0
doi>
10.1145/109648.109687
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
computations on discrete structures
geometrical problems and computations
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