The following pages link to (Q3940846):
Displaying 22 items.
- Arbitrary sequence RAMs (Q477622) (← links)
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- Improved nonconservative sequential and parallel integer sorting (Q917274) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Lower bound arguments with ``inaccessible'' numbers (Q1107308) (← links)
- Establishing order in planar subdivisions (Q1115185) (← links)
- A lower bound for the integer element distinctness problem (Q1175947) (← links)
- Lower bounds for arithmetic problems (Q1178201) (← links)
- Sorting in linear time? (Q1273863) (← links)
- Fusion trees can be implemented with \(AC^0\) instructions only (Q1287094) (← links)
- When can we sort in \(o(n\log n)\) time? (Q1356890) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Constant-time sorting (Q2252525) (← links)
- New algorithms for binary jumbled pattern matching (Q2444765) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- Practical algorithms for transposition-invariant string-matching (Q2569401) (← links)
- Maintaining discrete probability distributions optimally (Q4630265) (← links)
- Sorting and searching revisted (Q5054812) (← links)
- OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
