A Sound and Complete Abstraction for Reasoning About Parallel Prefix Sums

doi 10.1145/2535838.2535882
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

A Complete Finite Prefix for Process Algebra

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

A Complete Equational Axiomatization for Prefix Iteration With Silent Steps

BRICS Report Series
1995English

A Sound and Complete Logic for Algebraic Effects

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

A Logic for Reasoning About Counterfactual Emotions

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2011English

Bilateral Shorted Operators and Parallel Sums

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2006English

Farms, Pipes, Streams and Reforestation: Reasoning About Structured Parallel Processes Using Types and Hylomorphisms

ACM SIGPLAN Notices
Computer Science
2016English

Design of Parallel Prefix Adders Using FPGAs

IOSR journal of VLSI and Signal Processing
2014English

Design and Implementation of Parallel Prefix Adders Using FPGAs

IOSR Journal of Electronics and Communication Engineering
2013English

Fast Modular Multiplication Using Parallel Prefix Adder

International Journal of Trend in Scientific Research and Development
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy