A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq (Q3638257): Difference between revisions

@@ Property / describes a project that uses @@
+Coq
@@ Property / describes a project that uses: Coq / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Quicksort
@@ Property / describes a project that uses: Quicksort / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1537838026
@@ Property / OpenAlex ID: W1537838026 / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
+Normal rank
@@ Property / cites work @@
+The analysis of Quicksort programs
@@ Property / cites work: The analysis of Quicksort programs / rank @@
+Normal rank
@@ Property / cites work @@
+Subset Coercions in Coq
@@ Property / cites work: Subset Coercions in Coq / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs of Randomized Algorithms in Coq
@@ Property / cites work: Proofs of Randomized Algorithms in Coq / rank @@
+Normal rank
@@ Property / cites work @@
+Q4484343
@@ Property / cites work: Q4484343 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3638257