Sorting Short Keys in Circuits of Size {o(n \log n)}
From MaRDI portal
Publication:5080485
Recommendations
Cites work
- Bounds on Selection Networks
- Can we overcome the n n barrier for oblivious sorting?
- Data-oblivious data structures
- Deterministic sorting in O(nloglogn) time and linear space
- Expanders that beat the eigenvalue bound: Explicit construction and applications
- Fast parallel space allocation, estimation, and integer sorting
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3551902 (Why is no real title available?)
- scientific article; zbMATH DE number 403945 (Why is no real title available?)
- scientific article; zbMATH DE number 3338920 (Why is no real title available?)
- Improved sorting networks with O(log N) depth
- Is there an oblivious RAM lower bound?
- Lower bounds for external memory integer sorting via network coding
- Network coding in undirected graphs is either very helpful or not helpful at all
- On probabilistic networks for selection, merging, and sorting
- On the capacity of information networks
- On-Line Algorithms for Path Selection in a Nonblocking Network
- Optimal parallel selection
- OptORAMa: optimal oblivious RAM
- Parallelism in Comparison Problems
- Randomized Sorting in O(nloglogn) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
- Self-routing superconcentrators
- Sorting in \(c \log n\) parallel steps
- Sorting in linear time?
- Sorting networks of logarithmic depth, further simplified
- Sorting on a parallel pointer machine with applications to set expression evaluation
- Time bounds for selection
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Upper bounds for sorting integers on random access machines
- Zig-zag sort
This page was built for publication: Sorting Short Keys in Circuits of Size ${o(n \log n)}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080485)
