Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"e-graphs"”.
-
E-graphs modulo theories - with applications to associative-commutative operators
E-graphs are a data structure for equational theorem proving which provide the basis for equality saturation, a method to automatically derive equational consequences from a starting set of terms, equations, and identities. E-graphs have generated a lot of interest since the publication of the Egg …
-
Oatlog: A high-performance e-graph engine
… represents many program variants using e-graphs and later extracts the optimal representation using a global profitability heuristic. Equality saturation can improve code quality while simplifying compiler development. Despite these advantages, the adoption of e-graphs in compilers and …
-
CHASE OPTIMAL AT SPEED: COMBINATORIAL PROBLEM SOLVING IN COMPUTING SYSTEMS
… Second, it represents circuit fragments as e-graphs to compactly share common sub-expressions across many equivalent forms, enabling global reasoning rather than local pattern matching. Third, it proposes an exact extraction procedure tailored to multi-input, multi-output subcircuits, allowing …
-
Practical and Flexible Equality Saturation
… this work contributes two techniques to make e-graphs, the data structure underlying equality saturation, better suited to the algorithm’s needs. A new amortized invariant restoration technique called rebuilding takes advantage of equality saturation’s distinct workload, providing asymptotic …
-
Novel Algorithms for Computing Nuclear Correlation Functions in Lattice Quantum Chromodynamics
Techniques to attain numerical solutions of Quantum Chromodynamics have developed to the point of beginning to connect aspects of nuclear physics to the underlying degrees of freedom of the Standard Model. There remain deep physical and numerical challenges, including a proliferation of …
-
The Graphs of HU+00E4ggkvist & Hell
This thesis investigates HU+00E4ggkvist & Hell graphs. These graphs are an extension of the idea of Kneser graphs, and as such share many attributes with them. A variety of original results on many different properties of these graphs are given. We begin with an examination of the transitivity and …