When can we sort in \(o(n\log n)\) time? (Q1356890): Difference between revisions

@@ Property / DOI @@
-.1006/jcss.1997.1474
@@ Property / DOI: 10.1006/jcss.1997.1474 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcss.1997.1474
+Normal rank
@@ Property / OpenAlex ID @@
+W1964765091
@@ Property / OpenAlex ID: W1964765091 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Hash functions for priority queues
@@ Property / cites work: Hash functions for priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Organization and maintenance of large ordered indexes
+Normal rank
@@ Property / cites work @@
+On pointers versus addresses
@@ Property / cites work: On pointers versus addresses / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of functions for random access machines
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+Upper bounds for sorting integers on random access machines
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+On parallel hashing and integer sorting
@@ Property / cites work: On parallel hashing and integer sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Q3940846
@@ Property / cites work: Q3940846 / rank @@
+Normal rank
@@ Property / DOI @@
+.1006/JCSS.1997.1474
@@ Property / DOI: 10.1006/JCSS.1997.1474 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1356890