SIGN IN
SIGN UP
Global value numbers and redundant computations
Full Text:
PDF
Buy this Article
Authors:
B. K. Rosen
IBM Thomas J. Watson Research Center, Yorktown Heights, NY
M. N. Wegman
IBM Thomas J. Watson Research Center, Yorktown Heights, NY
F. K. Zadeck
Department of Computer Science, Brown University, Providence, RI
Published in:
· Proceeding
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pages 12-27
ACM
New York, NY
, USA
©1988
table of contents
ISBN:0-89791-252-7
doi>
10.1145/73560.73562
1988 Article
Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 105
· Downloads (cumulative): 1,228
· Citation Count: 116
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
POPL '14
Share:
|
Tags:
algorithms
computations on discrete structures
graph algorithms
optimization
performance
recurrences and difference equations
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