The following pages link to Radu Nicolescu (Q256433):
Displaying 38 items.
- New solutions for disjoint paths in P systems (Q256435) (← links)
- P system implementation of dynamic programming stereo (Q385332) (← links)
- A sublinear Sudoku solution in cP systems and its formal verification (Q821319) (← links)
- P systems and the Byzantine agreement (Q987968) (← links)
- An introduction to \(\mathrm{cP}\) systems (Q1709914) (← links)
- Most common words -- a cP systems solution (Q1749170) (← links)
- Faster synchronization in P systems (Q1761716) (← links)
- Formal verification of cP systems using PAT3 and ProB (Q1982961) (← links)
- Membrane computing with water (Q1982966) (← links)
- Solving a PSPACE-complete problem with cP systems (Q1982985) (← links)
- Turing completeness of water computing (Q2152298) (← links)
- An efficient labelled nested multiset unification algorithm (Q2152299) (← links)
- Formal verification of cP systems using Coq (Q2152300) (← links)
- Alternative representations of P systems solutions to the graph colouring problem (Q2299885) (← links)
- Actor-like cP systems (Q2328326) (← links)
- Structured Grid Algorithms Modelled with Complex Objects (Q2789145) (← links)
- Parallel and Distributed Algorithms in P Systems (Q2890281) (← links)
- An Adaptive Algorithm for P System Synchronization (Q2890287) (← links)
- Revising the Membrane Computing Model for Byzantine Agreement (Q2975922) (← links)
- BFS Solution for Disjoint Paths in P Systems (Q3007713) (← links)
- A Faster P Solution for the Byzantine Agreement Problem (Q3067490) (← links)
- Parallel Thinning with Complex Objects and Actors (Q3454901) (← links)
- Synchronization in P Modules (Q3575216) (← links)
- (Q4043072) (← links)
- (Q4071216) (← links)
- (Q4520529) (← links)
- (Q4542631) (← links)
- (Q4681318) (← links)
- (Q4902290) (← links)
- Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs (Q4913839) (← links)
- The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems (Q5379885) (← links)
- Programming P Systems with Complex Objects (Q5404858) (← links)
- Regularising Ill-posed Discrete Optimisation: Quests with P Systems (Q5415291) (← links)
- Discovering the Membrane Topology of Hyperdag P Systems (Q5851922) (← links)
- Sublinear P system solutions to NP-complete problems (Q6038691) (← links)
- Neighbourhood message passing computation on a lattice with cP systems (Q6135714) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)
- Programmable and parallel water computing (Q6177125) (← links)
