Pages that link to "Item:Q1056541"
From MaRDI portal
The following pages link to Sorting in \(c \log n\) parallel steps (Q1056541):
Displaying 50 items.
- Comparator networks for binary heap construction (Q1589657) (← links)
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Cooperative Boolean systems with generically long attractors. II (Q1682372) (← links)
- A note on constructing binary heaps with periodic networks. (Q1853052) (← links)
- Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
- Improved fast integer sorting in linear space (Q1854461) (← links)
- On the negation-limited circuit complexity of merging (Q1861565) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Algorithmic results for ordered median problems (Q1866979) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- Monotone Boolean formulas can approximate monotone linear threshold functions (Q1878411) (← links)
- A unified \(O(\log N)\) and optimal sorting vector algorithm (Q1907067) (← links)
- A framework for automated distributed implementation of component-based models (Q1938379) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- On partial sorting in restricted rounds (Q2013879) (← links)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
- Structured encryption and dynamic leakage suppression (Q2056799) (← links)
- On the complexity of monotone circuits for threshold symmetric Boolean functions (Q2064376) (← links)
- Permutatorial optimization via the permutahedron (Q2083997) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Secure wire shuffling in the probing model (Q2128997) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes (Q2150563) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Bisecting three classes of lines (Q2230403) (← links)
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857) (← links)
- Shift lifts preserving Ramanujan property (Q2361560) (← links)
- Fast periodic correction networks (Q2368972) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← links)
- Constraints, MMSNP and expander relational structures (Q2439829) (← links)
- A note on searching line arrangements and applications (Q2444761) (← links)
- Faster merging networks with a small constant period (Q2629229) (← links)
- Dense expanders and pseudo-random bipartite graphs (Q2640620) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- Representing permutations with few moves (Q2827490) (← links)
- Proofs with monotone cuts (Q2888631) (← links)
- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (Q2922881) (← links)
- Constructing Extended Formulations from Reflection Relations (Q3009770) (← links)
- Generic Constant-Round Oblivious Sorting Algorithm for MPC (Q3092362) (← links)
- A computer-assisted optimal depth lower bound for nine-input sorting networks (Q3210158) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Fast algorithms for bit-serial routing on a hypercube (Q3357513) (← links)
- Single-exception sorting networks and the computational complexity of optimal sorting network verification (Q3357540) (← links)
- On Rearrangement of Items Stored in Stacks (Q3382003) (← links)
- Secure Multi-party Shuffling (Q3460735) (← links)
- Expanders and Diffusers (Q3753504) (← links)
- Diameters and Eigenvalues (Q3834081) (← links)
- A lower bound for sorting networks based on the shuffle permutation (Q4311642) (← links)
