Obtaining lower bounds using artificial components

Authors:
Prakash Ramanan
Affiliations:
Univ. of California, Santa Barbara, CA
Venue:
Information Processing Letters
Year:
1987

Citing 0
Cited 3

Decision trees: old and new results

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The subtree max gap problem with application to parallel string covering

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Processing an Offline Insertion-Query Sequence with Applications

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics

Quantified Score

Hi-index	0.89

Visualization

Abstract