Masakazu Nakanishi

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 Atsushi Maeda

> Home > Persons > Masakazu Nakanishi

Publications

1996
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/scjapan/TanakaMNM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scjapan/TanakaMNM96
Yoshio Tanaka, Atsushi Maeda, Masakazu Nakanishi, Shogo Matsui:
Performance analysis of parallel garbage collection using partial marking. Syst. Comput. Jpn. 27(8): 29-38 (1996)
1995
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/iwmm/MatsuiTMN95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwmm/MatsuiTMN95
Shogo Matsui, Yoshio Tanaka, Atsushi Maeda, Masakazu Nakanishi:
Complementary Garbage Collector. IWMM 1995: 163-177
1994
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/conpar/TanakaMMN94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/conpar/TanakaMMN94
Yoshio Tanaka, Shogo Matsui, Atsushi Maeda, Masakazu Nakanishi:
Partial Marking GC. CONPAR 1994: 337-348
1987
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/paa/MatsuiKTTMMN87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/paa/MatsuiKTTMMN87
Shogo Matsui, Yoshinobu Kato, Shinsuke Teramura, Tomoyuki Tanaka, Nobuyuki Mohri, Atsushi Maeda, Masakazu Nakanishi:
SYNAPSE: A Multi-Microprocessor Lisp Machine with Parallel Garbage Collector. Parallel Algorithms and Architectures 1987: 131-137

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.