EGRAPHS 2024 Contributors

Filter

Role Type

Contributing to

Number of Roles

Country

Results (44)

B Rafael BarbalhoBarbalho, Rafael Intel Corporation Algorithm-Aware Hardware Optimization using E-Graph Rewriting: how should we marry software and hardware?
Chris BarrettBarrett, Chris University of Oxford Equivalence Hypergraphs: E-Graphs for Monoidal Theories
Nikolaj BjørnerBjørner, Nikolaj Microsoft Research SpEQ: Translation of Sparse Codes using Equivalences
Camille BossutBossut, Camille Georgia Institute of Technology Loop Saturation for Scalable High-Level Synthesis
C Ben CaldwellCaldwell, Ben University of ChicagoUnited States Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs
Alessandro CheliCheli, Alessandro PlantingSpaceItaly Performant Dynamically Typed E-Graphs in Pure Julia
Jianyi ChengCheng, Jianyi University of CambridgeUnited Kingdom Algorithm-Aware Hardware Optimization using E-Graph Rewriting: how should we marry software and hardware?
George A. ConstantinidesConstantinides, George A. Imperial College London, UK Powered by Less: Low Power Circuit Synthesis
Samuel CowardCoward, Samuel Imperial College London, UK / Intel CorporationUnited Kingdom Algorithm-Aware Hardware Optimization using E-Graph Rewriting: how should we marry software and hardware? Powered by Less: Low Power Circuit Synthesis Committee Member in Program Committee within the EGRAPHS-track
D Maryam Mehri DehnaviDehnavi, Maryam Mehri University of TorontoCanada SpEQ: Translation of Sparse Codes using Equivalences
Theo DraneDrane, Theo Intel Corporation, USA Algorithm-Aware Hardware Optimization using E-Graph Rewriting: how should we marry software and hardware? Powered by Less: Low Power Circuit Synthesis
G Dan GhicaGhica, Dan Huawei Research and University of BirminghamUnited Kingdom Equivalence Hypergraphs: E-Graphs for Monoidal Theories
Andrés GoensGoens, Andrés University of Amsterdam Bridging Syntax and Semantics of Lean Expressions in E-Graphs
Marc GourjonGourjon, Marc Hamburg University of Technology and NXP Semiconductors Germany GmbH superVer: Verifying Probabilistic Independence of Systems of Expressions using Equality Saturation
H Cong "Callie" HaoHao, Cong "Callie" Georgia Institute of Technology Loop Saturation for Scalable High-Level Synthesis
Niklas HeimHeim, Niklas Czech Technical University Performant Dynamically Typed E-Graphs in Pure Julia
Joseph M. HellersteinHellerstein, Joseph M. UC BerkeleyUnited States Towards Relational Contextual Equality Saturation
Tyler HouHou, Tyler University of California, BerkeleyUnited States Towards Relational Contextual Equality Saturation
K Thomas KoehlerKoehler, Thomas INRIAFrance Slotted E-Graphs Committee Member in Program Committee within the EGRAPHS-track
L Shadaj LaddadLaddad, Shadaj University of California at BerkeleyUnited States Towards Relational Contextual Equality Saturation
Avery LairdLaird, Avery University of Toronto SpEQ: Translation of Sparse Codes using Equivalences
Adrian LehmannLehmann, Adrian University of Chicago Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs
Bangtian LiuLiu, Bangtian University of TorontoCanada SpEQ: Translation of Sparse Codes using Equivalences
M Emiliano MoriniMorini, Emiliano Intel Corporation Powered by Less: Low Power Circuit Synthesis
N Chandrakana NandiNandi, Chandrakana CertoraUnited States Committee Member in Program Committee within the EGRAPHS-track
O Maximilian OrltOrlt, Maximilian TU Darmstadt superVer: Verifying Probabilistic Independence of Systems of Expressions using Equality Saturation
P Pajam PaulsPauls, Pajam University of Lübeck superVer: Verifying Probabilistic Independence of Systems of Expressions using Equality Saturation
Nadia PolikarpovaPolikarpova, Nadia University of California at San DiegoUnited States Committee Member in Program Committee within the EGRAPHS-track
R Robert RandRand, Robert University of ChicagoUnited States Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs
Sabrina ReisReis, Sabrina Lawrence Livermore National Laboratory EGSTRA: E-Graph-Based Strategy for Test Suite Reduction and Abstraction
John ReppyReppy, John University of Chicago, USA Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs
Marcus RosselRossel, Marcus Technische Universität DresdenGermany Bridging Syntax and Semantics of Lean Expressions in E-Graphs
S Guido SalvaneschiSalvaneschi, Guido University of St. GallenSwitzerland Disequalities in E-Graphs: An Experiment
Rudi SchneiderSchneider, Rudi TU Berlin Slotted E-Graphs
Matthew SottileSottile, Matthew Lawrence Livermore National Laboratory EGSTRA: E-Graph-Based Strategy for Test Suite Reduction and Abstraction
Michel SteuwerSteuwer, Michel Technische Universität BerlinGermany Slotted E-Graphs
T Zachary TatlockTatlock, Zachary University of WashingtonUnited States Committee Member in Program Committee within the EGRAPHS-track
Aleksei TiurinTiurin, Aleksei University of Birmingham Equivalence Hypergraphs: E-Graphs for Monoidal Theories
Alexander TreffTreff, Alexander University of Lübeck superVer: Verifying Probabilistic Independence of Systems of Expressions using Equality Saturation
W Pascal WeisenburgerWeisenburger, Pascal University of St. GallenSwitzerland Disequalities in E-Graphs: An Experiment
Max WillseyWillsey, Max UC BerkeleyUnited States Welcome Committee Member in Program Committee within the EGRAPHS-track Committee Member in Organizing Committee within the EGRAPHS-track
Z George ZakhourZakhour, George University of St. GallenSwitzerland Disequalities in E-Graphs: An Experiment
Qirun ZhangZhang, Qirun Georgia Institute of TechnologyUnited States Loop Saturation for Scalable High-Level Synthesis
Philip ZuckerZucker, Philip DraperUnited States E-graphs and Automated Reasoning: Looking back to look forward