Round Compression for Parallel Matching Algorithms

doi 10.1145/3188745.3188764
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Analysis of String Matching Compression Algorithms

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2008English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

Parallel Maximum Matching Algorithms in Interval Graphs

International Journal of Foundations of Computer Science
Computer Science
1999English

Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems

SIAM Journal on Computing
MathematicsComputer Science
1992English

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2000English

Parallel String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Vector Algorithms for Approximate String Matching

International Journal of Foundations of Computer Science
Computer Science
2002English

Algorithms for Parallel Polygon Rendering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Fast Algorithms for Parallel Architectures

1990English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy