Carlos R. P. Hartmann

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 Ramachandran Vaidyanathan

> Home > Persons > Carlos R. P. Hartmann

Publications

1995
[j39]
- view
  authority control:
- export record
  dblp key:
  - journals/acta/VaidyanathanHV95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/VaidyanathanHV95
Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney:
Parallel Integer Sorting Using Small Operations. Acta Informatica 32(1): 79-92 (1995)
1993
[j38]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/VaidyanathanHV93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/VaidyanathanHV93
Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney:
Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors. Inf. Process. Lett. 46(1): 31-36 (1993)
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/VaidyanathanHV93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/VaidyanathanHV93
Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney:
Towards Optimal Parallel Radix Sorting. IPPS 1993: 193-197
1992
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/VaidyanathanHV92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/VaidyanathanHV92
Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney:
PRAMs with Variable Word-Size. Inf. Process. Lett. 42(4): 217-222 (1992)

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.