Pages that link to "Item:Q1152950"

The following pages link to A time-space tradeoff for sorting on non-oblivious machines (Q1152950):

Displaying 21 items.

• Strictly in-place algorithms for permuting and inverting permutations (Q832874) (← links)
• A note on the decoding complexity of error-correcting codes (Q845843) (← links)
• Two time-space tradeoffs for element distinctness (Q1095660) (← links)
• Upper bounds for time-space trade-offs in sorting and selection (Q1101238) (← links)
• A lower bound for read-once-only branching programs (Q1107323) (← links)
• Time-space tradeoffs for algebraic problems on general sequential machines (Q1176102) (← links)
• Trade-offs between communication and space (Q1201877) (← links)
• The computational complexity of universal hashing (Q1208411) (← links)
• Time-space tradeoffs for set operations (Q1210542) (← links)
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
• Determinism versus nondeterminism for linear time RAMs with memory restrictions (Q1869934) (← links)
• Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
• Approximation in (Poly-) logarithmic space (Q2037114) (← links)
• Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
• Constant work-space algorithms for facility location problems (Q2192101) (← links)
• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
• A time-space tradeoff for language recognition (Q3316594) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
• Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)