The following pages link to Parallel Processing Letters (Q2842649):
Displayed 50 items.
- MATHEMATICAL FACTS IN A PHYSICALIST ONTOLOGY (Q2842650) (← links)
- CLOSED TIMELIKE CURVES IN RELATIVISTIC COMPUTATION (Q2842651) (← links)
- DECIDABILITY, UNDECIDABILITY, AND GÖDEL'S INCOMPLETENESS IN RELATIVITY THEORIES (Q2842652) (← links)
- THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' (Q2842654) (← links)
- HIGH PRECISION INTEGER ADDITION, SUBTRACTION AND MULTIPLICATION WITH A GRAPHICS PROCESSING UNIT (Q3144909) (← links)
- ON THE FAULT-TOLERANCE AND SIZE OF WDM OPTICAL NETWORKS (Q3144911) (← links)
- A PRODUCT FORM SOLUTION FOR TREE NETWORKS WITH DIVISIBLE LOADS (Q3144912) (← links)
- TWO ATTACKS ON A TWO-FACTOR USER AUTHENTICATION IN WIRELESS SENSOR NETWORKS (Q3144914) (← links)
- THE TRANSITIVE CLOSURE AND RELATED ALGORITHMS OF DIGRAPH ON THE RECONFIGURABLE ARCHITECTURE (Q3144916) (← links)
- ON THE SURFACE AREAS AND AVERAGE DISTANCES OF MESHES AND TORI (Q3144917) (← links)
- A BATCH VERIFICATION FOR MULTIPLE PROXY SIGNATURE (Q3144918) (← links)
- HIERARCHICAL MAPPING FOR HPC APPLICATIONS (Q3144920) (← links)
- PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE (Q3144924) (← links)
- HIGH PRECISION INTEGER MULTIPLICATION WITH A GPU USING STRASSEN'S ALGORITHM WITH MULTIPLE FFT SIZES (Q3144925) (← links)
- ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS (Q3144927) (← links)
- LOCAL COMMUNITY IDENTIFICATION IN SOCIAL NETWORKS (Q3144929) (← links)
- RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS (Q3144930) (← links)
- ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES (Q3144931) (← links)
- MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES (Q3144934) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- The Relation Between Diamond Tiling and Hexagonal Tiling (Q3457839) (← links)
- Guest Editors' Note — Special Issue: First International Conference on the Theory and Practice of Natural Computing, TPNC 2012 (Q3458190) (← links)
- DNA Codeword Design: Theory and Applications (Q3458191) (← links)
- Neural Networks Solving Free and Fixed Final Time Optimal Control Problems (Q3458192) (← links)
- On the Influence of Technology on Learning Processes (Q3458194) (← links)
- Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator (Q3458203) (← links)
- Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge (Q3458205) (← links)
- GUEST EDITORS' NOTE: SPECIAL ISSUE ON CLUSTERS, CLOUDS, AND DATA FOR SCIENTIFIC COMPUTING (Q3458239) (← links)
- SPEEDUP-AWARE CO-SCHEDULES FOR EFFICIENT WORKLOAD MANAGEMENT (Q3458241) (← links)
- ASSESSING THE PERFORMANCE OF ENERGY-AWARE MAPPINGS (Q3458242) (← links)
- ROBUST SCALABLE VISUALIZED CLUSTERING IN VECTOR AND NON VECTOR SEMI-METRIC SPACES (Q3458243) (← links)
- Guest Editors' Note (Q4598888) (← links)
- Biomolecular Computing Realized in Parallel Flow Systems: Enzyme-Based Double Feynman Logic Gate (Q4598892) (← links)
- Delay Line as a Chemical Reaction Network (Q4598893) (← links)
- Calculating Voronoi Diagrams Using Simple Chemical Reactions (Q4598894) (← links)
- Mechanisms Inducing Parallel Computation in a Model of <i>Physarum polycephalum</i> Transport Networks (Q4598895) (← links)
- <i>Physarum</i>-Inspired Applications in Graph-Optimization Problems (Q4598896) (← links)
- Hardware Acceleration of Cellular Automata <i>Physarum polycephalum</i> Model (Q4598898) (← links)
- Uncertainty in Time (Q4598899) (← links)
- Towards Context-Based Concurrent Formal Theories (Q4598900) (← links)
- Work-Competitive Scheduling on Task Dependency Graphs (Q4598901) (← links)
- Parallel Associative Classification Data Mining Frameworks Based MapReduce (Q4598903) (← links)
- New Dynamic Orderings for the Parallel One–Sided Block-Jacobi SVD Algorithm (Q4598904) (← links)
- Distributed Queuing in Dynamic Networks (Q4598905) (← links)
- Linearly Many Edge-Faults in 2-Bijective Connection Networks (Q4598907) (← links)
- A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees (Q4598908) (← links)
- Simpler Sequential and Parallel Biconnectivity Augmentation in Trees (Q4598909) (← links)
- Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph (Q4598911) (← links)
- Approximation Algorithms for Energy, Reliability, and Makespan Optimization Problems (Q4598912) (← links)
- Tolerating Random Byzantine Failures in an Unbounded Network (Q4598913) (← links)