Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485): Difference between revisions

@@ Property / Wikidata QID @@
+Q114846589
@@ Property / Wikidata QID: Q114846589 / rank @@
+Normal rank
@@ Property / cites work @@
+On the capacity of information networks
@@ Property / cites work: On the capacity of information networks / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting in linear time?
@@ Property / cites work: Sorting in linear time? / rank @@
+Normal rank
@@ Property / cites work @@
+OptORAMa: optimal oblivious RAM
@@ Property / cites work: OptORAMa: optimal oblivious RAM / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting in \(c \log n\) parallel steps
@@ Property / cites work: Sorting in \(c \log n\) parallel steps / rank @@
+Normal rank
@@ Property / cites work @@
+Q5615724
@@ Property / cites work: Q5615724 / rank @@
+Normal rank
@@ Property / cites work @@
+On-Line Algorithms for Path Selection in a Nonblocking Network
+Normal rank
@@ Property / cites work @@
+Q4125778
@@ Property / cites work: Q4125778 / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Network coding in undirected graphs is either very helpful or not helpful at all
+Normal rank
@@ Property / cites work @@
+Fast parallel space allocation, estimation, and integer sorting
+Normal rank
@@ Property / cites work @@
+Is There an Oblivious RAM Lower Bound?
@@ Property / cites work: Is There an Oblivious RAM Lower Bound? / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+Lower bounds for external memory integer sorting via network coding
+Normal rank
@@ Property / cites work @@
+Sorting on a parallel pointer machine with applications to set expression evaluation
+Normal rank
@@ Property / cites work @@
+Zig-zag sort
@@ Property / cites work: Zig-zag sort / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic sorting in O(nloglogn) time and linear space
+Normal rank
@@ Property / cites work @@
+Optimal parallel selection
@@ Property / cites work: Optimal parallel selection / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds for sorting integers on random access machines
+Normal rank
@@ Property / cites work @@
+On probabilistic networks for selection, merging, and sorting
+Normal rank
@@ Property / cites work @@
+Can We Overcome the <i>n</i> log <i>n</i> Barrier for Oblivious Sorting?
+Normal rank
@@ Property / cites work @@
+Data-Oblivious Data Structures
@@ Property / cites work: Data-Oblivious Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Improved sorting networks with O(log N) depth
@@ Property / cites work: Improved sorting networks with O(log N) depth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4201929
@@ Property / cites work: Q4201929 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-routing superconcentrators
@@ Property / cites work: Self-routing superconcentrators / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting networks of logarithmic depth, further simplified
+Normal rank
@@ Property / cites work @@
+Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
+Normal rank
@@ Property / cites work @@
+Parallelism in Comparison Problems
@@ Property / cites work: Parallelism in Comparison Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Expanders that beat the eigenvalue bound: Explicit construction and applications
+Normal rank
@@ Property / cites work @@
+Bounds on Selection Networks
@@ Property / cites work: Bounds on Selection Networks / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3140559833
@@ Property / OpenAlex ID: W3140559833 / rank @@
+Normal rank