Masaki Murakami

Orcid: 0000-0002-2188-6125

According to our database1, Masaki Murakami authored at least 27 papers between 1986 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Experimental Evaluation on Priority-Aware Guaranteed Resource Allocation for Resource Pool Based Reconfigurable Hardware.
IEEE/ACM Trans. Netw., February, 2024

2023
Networking Experiment of Domain-Specific Networking Platform Based on Optically Interconnected Reconfigurable Communication Processors.
IEICE Trans. Commun., August, 2023

2022
Experiment of Nationwide Multi-Route Skew Cancelling for Dynamic Mapping of MAC Signals over SDM/WDM Network Testbed.
Proceedings of the 2022 27th OptoElectronics and Communications Conference (OECC) and 2022 International Conference on Photonics in Switching and Computing (PSC), 2022

2020
Online parameter tuning of the flow classification method in the energy-efficient data center network "HOLST".
JOCN, 2020

2019
First Demonstration of End-to-End Network Slicing with Transport Network Coordination and Edge Cloud Applications in 5G Era.
Proceedings of the 2019 24th OptoElectronics and Communications Conference (OECC) and 2019 International Conference on Photonics in Switching and Computing (PSC), 2019

Experimental Evaluation of Application Triggered Flow Classification Using Operated Data Center Traffic Data.
Proceedings of the 2019 24th OptoElectronics and Communications Conference (OECC) and 2019 International Conference on Photonics in Switching and Computing (PSC), 2019

Experimental Deployment of Dynamic Resource Allocation Using Biological Attractor Selection in Virtual Packet Optical Node.
Proceedings of the 2019 24th OptoElectronics and Communications Conference (OECC) and 2019 International Conference on Photonics in Switching and Computing (PSC), 2019

2018
Flow/Application Triggered SDN control in Hybrid Data-center Network "HOLST".
Proceedings of the Optical Fiber Communications Conference and Exposition, 2018

2013
Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System.
Proceedings of the Seventh International Symposium on Theoretical Aspects of Software Engineering, 2013

2009
On Congruence Property of Scope Equivalence for Concurrent Programs with Higher-Order Communication.
Proceedings of the thirty-second Communicating Process Architectures Conference, 2009

2008
A Graph Rewriting Model of Concurrent Programs with Higher-Order Communication.
Proceedings of the International Conference on Theoretical and Mathematical Foundations of Computer Science, 2008

Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs.
Proceedings of the Theoretical Aspects of Computing, 2008

2007
Compilation of Higher-Order Concurrent Programs into First-Order Programs on Recursive Graph Rewriting Model.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

2006
A formal model of concurrent systems based on bipartite directed acyclic graph.
Sci. Comput. Program., 2006

A Model of Access Control for Data Materials Based on Ambient Calculus.
Proceedings of the International Conference on Software Engineering Research and Practice & Conference on Programming Languages and Compilers, 2006

2005
A calculus for concurrent system with higher-order streaming communication.
Sci. Comput. Program., 2005

Scope Equivalence of Concurrent Systems Based on Bipartite Directed Acyclic Graph.
Proceedings of the International Conference on Software Engineering Research and Practice, 2005

2004
A model of runtime transformation for distributed systems based on directed acyclic graph model.
J. Syst. Archit., 2004

2003
Evolvable concurrent processes.
Comput. Stand. Interfaces, 2003

A Runtime Transformation Method for Distributed Systems.
Proceedings of the International Conference on Software Engineering Research and Practice, 2003

1990
A Declarative Semantics of Flat Guarded Horn Clauses for Programs with Perpetual Processes.
Theor. Comput. Sci., 1990

Nested Guarded Horn Clauses.
Int. J. Found. Comput. Sci., 1990

1988
Unfolding Rules for GHC Programs.
New Gener. Comput., 1988

A Declarative Semantics of Parallel Logic Programs with Perpetual Processes.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

1987
Verification system for freedom from deadlock of communicating sequential processes.
Syst. Comput. Jpn., 1987

Proving Partial Correctness of Guarded Horn Clauses Programs.
Proceedings of the Logic Programming '87, 1987

1986
Verification system for partial correctness of communicating sequential processes.
Syst. Comput. Jpn., 1986


  Loading...