default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasaki Murakami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Masaki Murakami
, Takashi Kurimoto, Satoru Okamoto, Naoaki Yamanaka:
Experimental Evaluation on Priority-Aware Guaranteed Resource Allocation for Resource Pool Based Reconfigurable Hardware. IEEE/ACM Trans. Netw. 32(1): 298-307 (2024)- 2023
- [j11]Masaki Murakami, Takashi Kurimoto, Satoru Okamoto, Naoaki Yamanaka, Takayuki Muranaka:
Networking Experiment of Domain-Specific Networking Platform Based on Optically Interconnected Reconfigurable Communication Processors. IEICE Trans. Commun. 106(8): 660-668 (2023) - 2022
- [c16]Masaki Murakami, Yoshihiko Uematsu, Satoru Okamoto, Naoaki Yamanaka, Daiki Soma, Shohei Beppu, Noboru Yoshikane, Takehiro Tsuritani, Takahiro Kodama, Masahiko Jinno:
Experiment of Nationwide Multi-Route Skew Cancelling for Dynamic Mapping of MAC Signals over SDM/WDM Network Testbed. OECC/PSC 2022: 1-3 - 2020
- [j10]Masaki Murakami, Hiroki Kubokawa, Kyosuke Sugiura, Eiji Oki, Satoru Okamoto, Naoaki Yamanaka:
Online parameter tuning of the flow classification method in the energy-efficient data center network "HOLST". JOCN 12(11): 344-354 (2020)
2010 – 2019
- 2019
- [c15]Chiaki Hara, Masaki Murakami, Satoru Okamoto, Naoaki Yamanaka:
Experimental Deployment of Dynamic Resource Allocation Using Biological Attractor Selection in Virtual Packet Optical Node. OECC/PSC 2019: 1-3 - [c14]Masaki Murakami, Masahiro Matsuno, Satoru Okamoto, Naoaki Yamanaka:
Experimental Evaluation of Application Triggered Flow Classification Using Operated Data Center Traffic Data. OECC/PSC 2019: 1-3 - [c13]Shinya Nakamura, Kohei Shiomoto, Hyde Sugiyama, Yusuke Hirota, Noboru Yoshikane, Kentaro Sugawara, Masatake Miyabe, Tomotaka Eguchi, Satoru Okamoto, Masaki Murakami, Takahiro Hirayama, Ikuo Sato, Thomas Roux:
First Demonstration of End-to-End Network Slicing with Transport Network Coordination and Edge Cloud Applications in 5G Era. OECC/PSC 2019: 1-3 - 2018
- [c12]Yukihiro Imakiire, Masayuki Hirono, Masaki Murakami, Satoru Okamoto, Naoaki Yamanaka:
Flow/Application Triggered SDN control in Hybrid Data-center Network "HOLST". OFC 2018: 1-3 - 2013
- [c11]Masaki Murakami:
Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System. TASE 2013: 149-152
2000 – 2009
- 2009
- [c10]Masaki Murakami:
On Congruence Property of Scope Equivalence for Concurrent Programs with Higher-Order Communication. CPA 2009: 49-66 - 2008
- [c9]Masaki Murakami:
Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs. ICTAC 2008: 243-257 - [c8]Masaki Murakami:
A Graph Rewriting Model of Concurrent Programs with Higher-Order Communication. TMFCS 2008: 80-87 - 2007
- [c7]Masaki Murakami:
Compilation of Higher-Order Concurrent Programs into First-Order Programs on Recursive Graph Rewriting Model. FCS 2007: 369- - 2006
- [j9]Masaki Murakami:
A formal model of concurrent systems based on bipartite directed acyclic graph. Sci. Comput. Program. 61(1): 38-47 (2006) - [c6]Masaki Murakami:
A Model of Access Control for Data Materials Based on Ambient Calculus. Software Engineering Research and Practice 2006: 811-820 - 2005
- [j8]Masaki Murakami:
A calculus for concurrent system with higher-order streaming communication. Sci. Comput. Program. 57(1): 61-72 (2005) - [c5]Masaki Murakami:
Scope Equivalence of Concurrent Systems Based on Bipartite Directed Acyclic Graph. Software Engineering Research and Practice 2005: 80-86 - 2004
- [j7]Masaki Murakami:
A model of runtime transformation for distributed systems based on directed acyclic graph model. J. Syst. Archit. 50(7): 417-425 (2004) - [c4]Masaki Murakami:
A Calculus for Concurrent System with Higher-Order Streaming Communication. Software Engineering Research and Practice 2004: 90-96 - 2003
- [j6]Masaki Murakami:
Evolvable concurrent processes. Comput. Stand. Interfaces 25(3): 233-239 (2003) - [c3]Masaki Murakami:
A Runtime Transformation Method for Distributed Systems. Software Engineering Research and Practice 2003: 119-125
1990 – 1999
- 1990
- [j5]Moreno Falaschi, Maurizio Gabbrielli, Giorgio Levi, Masaki Murakami:
Nested Guarded Horn Clauses. Int. J. Found. Comput. Sci. 1(3): 249-264 (1990) - [j4]Masaki Murakami:
A Declarative Semantics of Flat Guarded Horn Clauses for Programs with Perpetual Processes. Theor. Comput. Sci. 75(1&2): 67-83 (1990)
1980 – 1989
- 1988
- [j3]Koichi Furukawa, Akira Okumura, Masaki Murakami:
Unfolding Rules for GHC Programs. New Gener. Comput. 6(2&3): 143-157 (1988) - [c2]Masaki Murakami:
A Declarative Semantics of Parallel Logic Programs with Perpetual Processes. FGCS 1988: 374-381 - 1987
- [j2]Masaki Murakami, Yasuyoshi Inagaki:
Verification system for freedom from deadlock of communicating sequential processes. Syst. Comput. Jpn. 18(4): 1-10 (1987) - [c1]Masaki Murakami:
Proving Partial Correctness of Guarded Horn Clauses Programs. LP 1987: 215-235 - 1986
- [j1]Masaki Murakami, Yasuyoshi Inagaki:
Verification system for partial correctness of communicating sequential processes. Syst. Comput. Jpn. 17(11): 11-20 (1986)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
