SIGN IN
SIGN UP
Incremental evaluation of computational circuits
Full Text:
PDF
Buy this Article
Authors:
Bowen Alpern
Mathematical Sciences Dept., IBM Research Division, P.O. Box 218, Yorktown Heights, NY
Roger Hoover
Computer Sciences Dept., IBM Research Division, P.O. Box 704, Yorktown Heights, NY
Barry K. Rosen
Mathematical Sciences Dept., IBM Research Division, P.O. Box 218, Yorktown Heights, NY
Peter F. Sweeney
Computer Sciences Dept., University of Wisconsin, 1210 W. Dayton St., Madison, WI
F. Kenneth Zadeck
Computer Science Dept., Brown University, P.O. Box 1910, Providence, RI
1990 Article
Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 43
· Downloads (cumulative): 439
· Citation Count: 44
Published in:
· Proceeding
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Pages 32-42
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1990
table of contents
ISBN:0-89871-251-3
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
graph algorithms
path and circuit problems
performance
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