wiki_research

commit 1fc63f3744b35cac594a5d6c2e1f98b0e89eecbb
parent 97ab8c645a03cc9d2889f3ace81d3181c61bc2d3
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Wed, 20 May 2026 17:20:39 +0200

commit with codex

Diffstat:
enumeration_techniques
 | 
2
++
lawler_murty
 | 
11
+++++++++++

2 files changed, 13 insertions(+), 0 deletions(-)
diff --git a/enumeration_techniques b/enumeration_techniques
@@ -1,5 +1,7 @@
 # Enumeration techniques
 
+for a [survey], cf [capelli2026enumeration]
+
 - [union_trick] by [arnaud_durand] and [yann_strozecki]
   - cf [berkholz2020constantb] Theorem 2.1
 - [proximity_search], enumeration framework (cf [wepa_2022])
diff --git a/lawler_murty b/lawler_murty
@@ -0,0 +1,11 @@
+# Lawler-Murty procedure
+
+An [enumeration_technique], described in [lawler1972procedure]
+
+cf slide 30 of <https://northeastern-datalab.github.io/topk-join-tutorial/slides/Anyk-Tutorial-Part3-RankedEnumeration.pdf>
+
+See also: [flashlight_search]
+
+Up: [enumeration_technique]
+
+Aliases: Lawler Murty procedure, Lawler-Murty procedure, Lawler-Murty