Weichang Du

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

◁ ▶ single authored publications

> Home > Persons > Weichang Du

Publications

2018
[c53]
- view
  authority control:
- export record
  dblp key:
  - conf/skg/Du18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/skg/Du18
Weichang Du:
Toward Semantic Social Network Analysis for Business Big Data. SKG 2018: 1-8
2011
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/skg/Du11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/skg/Du11
Weichang Du:
Towards Intelligent Distributed Applications Based on Distributed Semantics and Reasoning. SKG 2011: 172-174
1993
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ieeecc/Du93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieeecc/Du93
Weichang Du:
An intentional approach to parallel programming. IEEE Parallel Distributed Technol. Syst. Appl. 1(3): 22-32 (1993)
[c3]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/icci/Du93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icci/Du93
Weichang Du:
Context Parallelism in an Indexical Programming Language. ICCI 1993: 235-239
1991
[b1]
- view
  - electronic edition @ uvic.ca
  - no references & citations available
- export record
  dblp key:
  - phd/ca/Du91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/ca/Du91
Weichang Du:
Indexical parallel programming. University of Victoria, Canada, 1991

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.