Internally Deterministic Parallel Algorithms Can Be Fast

ACM SIGPLAN Notices - United States
doi 10.1145/2370036.2145840
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Fast Parallel Permutation Algorithms

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
1995English

Fast Algorithms for Parallel Architectures

1990English

On Fast Heuristic Non-Deterministic Algorithms and Short Heuristic Proofs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2014English

Can Turbulent Reconnection Be Fast in 2D?

Proceedings of the International Astronomical Union
AstrophysicsAstronomyPlanetary ScienceSpace
2010English

Discharge After TAVI: It Can Be Fast

EuroIntervention
MedicineCardiovascular MedicineCardiology
2019English

Fast Parallel Algorithms for Matrix Reduction to Normal Forms

Applicable Algebra in Engineering, Communications and Computing
Applied MathematicsNumber TheoryAlgebra
1997English

Can Deterministic Replay Be an Enabling Tool for Mobile Computing?

2011English

Can Routine Be as Fast as Emergency?

JALA: Journal of the Association for Laboratory Automation
2000English

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation Over Finite Fields

SIAM Journal on Computing
MathematicsComputer Science
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy