"A New O(n log n) Scheduling Heuristic for Parallel Decomposition of Sparce ..."

Ricardo Telichevesky, Prathima Agrawal, John A. Trotter (1991)

> Home

Details and statistics

DOI: 10.1109/ICCD.1991.139985

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/iccd/TelicheveskyAT91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccd/TelicheveskyAT91
Ricardo Telichevesky, Prathima Agrawal, John A. Trotter:
A New O(n log n) Scheduling Heuristic for Parallel Decomposition of Sparce Matrices. ICCD 1991: 612-616

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.