Sanjay Goil

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ibraheem Al-Furaih

> Home > Persons > Sanjay Goil

Publications

2000
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tpds/Al-furaihAGR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/Al-furaihAGR00
Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka:
Parallel Construction of Multidimensional Binary Search Trees. IEEE Trans. Parallel Distributed Syst. 11(2): 136-148 (2000)
1997
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tpds/Al-furiahAGR97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/Al-furiahAGR97
Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka:
Practical Algorithms for Selection on Coarse-Grained Parallel Computers. IEEE Trans. Parallel Distributed Syst. 8(8): 813-824 (1997)
1996
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/ics/Al-FuraihAGR96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ics/Al-FuraihAGR96
Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka:
Parallel Construction of Multidimensional Binary Search Trees. International Conference on Supercomputing 1996: 205-212
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/Al-FuraihAGR96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/Al-FuraihAGR96
Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka:
Practical Algorithms for Selection on Coarse-Grained Parallel Computers. IPPS 1996: 309-313

a service of

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.