The following pages link to Parallel Processing Letters (Q2842649):
Displaying 32 items.
- <i>Physarum</i>-Inspired Applications in Graph-Optimization Problems (Q4598896) (← links)
- Hardware Acceleration of Cellular Automata <i>Physarum polycephalum</i> Model (Q4598898) (← links)
- Exhaustive Community Enumeration in Parallel (Q4598918) (← links)
- On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm (Q5087090) (← links)
- Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees (Q5087837) (← links)
- INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM (Q5408361) (← links)
- A short note on the surface area of star graphs (Q6483520) (← links)
- Locating the median of a tree in real time (Q6483521) (← links)
- An 11-step sorting network for 18 elements (Q6483523) (← links)
- Developing proximity graphs by \textit{Physarum polycephalum}: does the plasmodium follow the Toussaint hierarchy? (Q6483524) (← links)
- Improved communication schedules with buffers (Q6483525) (← links)
- Selfish routing in the presence of network uncertainty (Q6483527) (← links)
- Scatter of robots (Q6483528) (← links)
- Distributed learning of equilibria in a routing game (Q6483529) (← links)
- Parallelization of reversible ripple-carry adders (Q6483530) (← links)
- A new universal cellular automaton on the pentagrid (Q6483531) (← links)
- Computations and decidability of iterative arrays with restricted communication (Q6483532) (← links)
- How far is it to the next recurrent configuration? An NP-complete problem in the sandpile model (Q6483533) (← links)
- Cellular automata encryption: the reverse algorithm, Z-parameter and chain-rules (Q6483534) (← links)
- A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays (Q6483535) (← links)
- A 1D cellular automaton that moves particles until regular spatial placement (Q6483536) (← links)
- Time-relaxed 1-fault tolerant broadcast networks (Q6483537) (← links)
- Scheduling sensors by tiling lattices (Q6483538) (← links)
- Optimal subcube embeddability in hypercubes with additional dimensions (Q6483540) (← links)
- Sorting and routing on OTIS-mesh of trees (Q6483541) (← links)
- Dynamic maintenance of support coverage in sensor networks (Q6483543) (← links)
- Self-stabilizing vertex cover in anonymous networks with optimal approximation ratio (Q6483544) (← links)
- Coping with decoherence: parallelizing the quantum Fourier transform (Q6483545) (← links)
- Entanglement verification with an application to quantum key distribution protocols (Q6483546) (← links)
- Key distribution versus key enhancement in quantum cryptography (Q6483547) (← links)
- A quantum cryptographic solution to the problem of access control in a hierarchy (Q6483548) (← links)
- One-time pads without prior encounter (Q6483549) (← links)
