"A reduction architecture for the optimal scheduling of binary trees."

K. Ravikanth et al. (1988)

> Home

Details and statistics

DOI: 10.1016/0167-739X(88)90006-4

access: closed

type: Journal Article

metadata version: 2024-08-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fgcs/RavikanthSRV88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fgcs/RavikanthSRV88
K. Ravikanth, P. S. Sastry, K. R. Ramakrishnan, Y. V. Venkatesh:
A reduction architecture for the optimal scheduling of binary trees. Future Gener. Comput. Syst. 4(3): 225-233 (1988)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.