Search for Author All Reviews
	Pawagi, Shaunak     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 2 of 2 reviews       On the conversion of indirect to direct recursion Kaser O., Ramakrishnan C., Pawagi S. ACM Letters on Programming Languages and Systems 2(1-4): 151-164, 1993.  Type: Article Inline expansion replaces a call to a procedure with the procedure’s body. Inline expansion, among other benefits, eliminates procedure call overhead and improves addressing locality. Recursion presents a problem, since a rec...... May 1 1995     Maximum weight independent set in trees Pawagi S. BIT 27(2): 170-180, 1987.  Type: Article Consider an undirected graph whose vertices are weighted. Finding an independent vertex set maximizing the sum of the weights is in general NP-hard. The problem remains NP-hard for planar graphs but is tractable in chordal graphs and...... May 1 1988
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy