SIGN IN
SIGN UP
An incremental algorithm for maintaining the dominator tree of a reducible flowgraph
Full Text:
PDF
Buy this Article
Authors:
G. Ramalingam
IBM T.J. Watson Research Center, Yorktown Heights, NY
Thomas Reps
University of Wisconsin-Madison, 1210 W. Dayton Street, Madison, WI
Published in:
· Proceeding
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pages 287-296
ACM
New York, NY
, USA
©1994
table of contents
ISBN:0-89791-636-0
doi>
10.1145/174675.177905
1994 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 22
· Downloads (cumulative): 431
· Citation Count: 11
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
processors
theory
trees
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