Implementing Binary Search Trees in GP 2 (Extended Abstract)

Documenti analoghi

• Space-Efficient Hierholzer: Eulerian Cycles in $\mathrm{O}(m)$ Time and $\mathrm{O}(n)$ Space
  di: Alaoui, Ziad Ismaili, et al.
  Pubblicazione: (2025)
• Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
  di: Alaoui, Ziad Ismaili, et al.
  Pubblicazione: (2025)
• Linear-Time Graph Programs without Preconditions
  di: Alaoui, Ziad Ismaili, et al.
  Pubblicazione: (2025)
• Succinct Preferential Attachment Graphs
  di: Alaoui, Ziad Ismaili, et al.
  Pubblicazione: (2025)
• Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
  di: Alaoui, Ziad Ismaili, et al.
  Pubblicazione: (2026)