Fast and Optimal Extraction for Sparse Equality Graphs

Amir Kafshdar Goharshady, Chun Kit Lam, Lionel Parreaux

Open source

DOI
10.1145/3689801
Published
2024-10-08
Container
Proceedings of the ACM on Programming Languages
Publisher
Association for Computing Machinery (ACM)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1145/3689801,
  title = {Fast and Optimal Extraction for Sparse Equality Graphs},
  author = {Amir Kafshdar Goharshady and Chun Kit Lam and Lionel Parreaux},
  year = {2024},
  journal = {Proceedings of the ACM on Programming Languages},
  doi = {10.1145/3689801},
  url = {https://doi.org/10.1145/3689801}
}

RIS

TY  - JOUR
TI  - Fast and Optimal Extraction for Sparse Equality Graphs
AU  - Amir Kafshdar Goharshady
AU  - Chun Kit Lam
AU  - Lionel Parreaux
PY  - 2024
JO  - Proceedings of the ACM on Programming Languages
DO  - 10.1145/3689801
UR  - https://doi.org/10.1145/3689801
ER  - 

APA

Goharshady, A. K., Lam, C. K., & Parreaux, L. (2024). Fast and Optimal Extraction for Sparse Equality Graphs. Proceedings of the ACM on Programming Languages. https://doi.org/10.1145/3689801

Source records