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.
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← links)
- Merging almost sorted sequences yields a 24-sorter (Q344521) (← links)
- On the complexity of min-max sorting networks (Q454886) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- Picture-hanging puzzles (Q489745) (← links)
- Highly linked tournaments (Q491002) (← links)
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- The generalized packet routing problem (Q580964) (← links)
- Graphs whose every transitive orientation contains almost every relation (Q581415) (← links)
- Improved sorting networks with O(log N) depth (Q582098) (← links)
- Optimal merging and sorting on the EREW PRAM (Q582111) (← links)
- A note on adaptive parallel sorting (Q582114) (← links)
- Constructing sorting networks from k-sorters (Q582119) (← links)
- Parametric search made practical (Q598230) (← links)
- A sorting network in bounded arithmetic (Q638498) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- Negation-limited circuit complexity of symmetric functions (Q671626) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Highly symmetric expanders (Q700158) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Smallest compact formulation for the permutahedron (Q745678) (← links)
- On O(Tlog T) reduction from RAM computations to satisfiability (Q758197) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators (Q800384) (← links)
- Finding Euler tours in parallel (Q801686) (← links)
- On parallel integer sorting (Q805234) (← links)
- Parallel comparison merging of many-ordered lists (Q807015) (← links)
- Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
- Accelerating certain outputs of merging and sorting networks (Q837163) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Sorting roughly sorted sequences in parallel (Q909454) (← links)
- Bounds on the size of test sets for sorting and related networks (Q910215) (← links)
- A new scheme for the deterministic simulation of PRAMs in VLSI (Q911777) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Parallel selection (Q913517) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- Comment on Kochol's paper ``Efficient monotone circuits for threshold functions'' (Q918706) (← links)
- The unpredictable deviousness of models (Q959796) (← links)
- An efficient counting network (Q986532) (← links)
- Improving the average delay of sorting (Q1007244) (← links)
- Sorting networks of logarithmic depth, further simplified (Q1024784) (← links)
- Hamiltonian paths in Cayley graphs (Q1044918) (← links)
- On the complexity of slice functions (Q1066866) (← links)
- More on the complexity of slice functions (Q1079365) (← links)
- On efficient parallel strong orientation (Q1082819) (← links)
- Distributed algorithms in synchronous broadcasting networks (Q1088398) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
