SIGN IN
SIGN UP
The complexity of (un)folding
Full Text:
PDF
Buy this Article
Authors:
Helmut Alt
Freie Universitat Berlin, Takustraaye 9, D--14195 Berlin, Germany
Christian Knauer
Freie Universitat Berlin, Takustraaye 9, D--14195 Berlin, Germany
Günter Rote
Freie Universitat Berlin, Takustraaye 9, D--14195 Berlin, Germany
Sue Whitesides
McGill University, Montreal, Canada
2003 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 17
· Downloads (cumulative): 310
· Citation Count: 4
Published in:
· Proceeding
SCG '03
Proceedings of the nineteenth annual symposium on Computational geometry
Pages 164-170
ACM
New York, NY
, USA
©2003
table of contents
ISBN:1-58113-663-3
doi>
10.1145/777792.777818
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
computational geometry
geometrical problems and computations
linkage reconfiguration
pspace-completeness
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