Name
Affiliation
Papers
AKIHIRO FUJIWARA
NARA INST SCI & TECHNOL,GRAD SCH INFORMAT SCI,8916-5 TAKAYAMA,NARA 63001,JAPAN
55
Collaborators
Citations 
PageRank 
81
122
27.25
Referers 
Referees 
References 
204
248
270
Search Limit
100248
Title
Citations
PageRank
Year
P systems with branch and bound for solving two hard graph problems.00.342020
An Asynchronous P System Using Branch and Bound for Minimum Graph Coloring00.342019
An Asynchronous P System with Branch and Bound for Solving Hamiltonian Cycle Problem00.342019
Strawberry Optimization for Multi-Objective Knapsack Problem00.342019
Introduction to APDCM 2018.00.342018
An asynchronous P system with branch and bound for solving the satisfiability problem.00.342018
A Firefly Optimization For A Connected Dominating Set In A Sensor Network00.342017
Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2015.00.342017
An Asynchronous P System Using Branch and Bound for the Satisfiability Problem00.342017
An Asynchronous P System For Max-Sat00.342016
Solving Subset Sum Problem Using EN P System with Active Membranes.00.342016
On TSV array defect detection method using two ring-oscillators considering signal transitions at adjacent TSVs00.342015
Asynchronous P Systems for a Compare-and-Exchange Operation and Sorting.00.342015
Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2014.00.342015
APDCM Introduction and Committees00.342014
Asynchronous P systems for hard graph problems.20.392014
Asynchronous P Systems for the Maximum Independent Set and Related Graph Problems00.342013
Centralized Algorithms for the Connected Target Coverage in Wireless Sensor Networks10.412012
Asynchronous SN P Systems for Sorting00.342012
Asynchronous P Systems for Graph Coloring Problems00.342012
Arithmetic Operations and Factorization using Asynchronous P Systems.10.362012
Solving Sat And Hamiltonian Cycle Problem Using Asynchronous P Systems110.702012
Logic And Arithmetic Operations With A Constant Number Of Steps In Membrane Computing80.652011
Asynchronous P Systems for Arithmetic Operations and Factorization30.462011
Asynchronous P systems for SAT and Hamiltonian cycle problem00.342010
Distributed Algorithms for 2-Connected Sensor Cover in Sensor Network10.412010
Computation with a constant number of steps in membrane computing.00.342009
Special issue on Advances in Parallel and Distributed Computational Models00.342009
Procedures for Floating Point Operations with DNA Molecules00.342009
Dictionary Operations in Membrane Computing00.342009
An Access Point Selection Algorithm for Heterogeneous Stations00.342008
10th workshop on Advances in Parallel and Distributed Computational Models - APDCM'0800.342008
Special Section on Parallel/Distributed Processing and Systems00.342007
Access point selection algorithms for maximizing throughputs in wireless LAN environment80.702007
Procedures For Computing The Maximum With Dna00.342007
Data structures for storing binary numbers in DNA computing00.342007
Procedures for multiplication and division in DNA computing10.422006
A Cost Optimal Parallel Algorithm For Patience Sorting40.422006
A Procedure for Max-SAT with DNA Strands00.342006
Procedures For Multiple Input Functions With Dna Molecules00.342005
A Scheduling Algorithm With Static Partition For Total Exchange00.342005
Sorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands00.342005
A Procedure for Computing 0-1 Integer Programming with DNA Strands00.342005
Procedures For Logic And Arithmetic Operations With Dna Molecules111.932004
Procedures for Multiple Input Functions with DNA Strands00.342004
Addressable Procedures for Logic and Arithmetic Operations with DNA Strands50.522003
Multipath interference canceller for high-speed packet transmission with adaptive modulation and coding scheme in W-CDMA forward link293.342002
Parallel algorithms for selection on the BSP and BSP* models10.362002
Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM00.342001
Parallelizability of Some P-Complete Problems20.382000
  • 1
  • 2