SIGN IN
SIGN UP
Counting is easy
Full Text:
PDF
Buy this Article
Authors:
Joel I. Seiferas
Univ. of Rochester, Rochester, NY
Paul M. B. Vitányi
Centre for Mathematics and Computer Science, Amsterdam, The Netherlands
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 35 Issue 4, Oct. 1988
Pages 985-1000
ACM
New York, NY
, USA
table of contents
doi>
10.1145/48014.63141
1988 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 310
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
bounded-action devices
combinatorial algorithms
contiguous representations
design
relations between models
sequencing and scheduling
theory
verification
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