A time-space tradeoff for sorting on non-oblivious machines (Q1152950): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on time-space tradeoffs for computing continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for time-space trade-offs in sorting and selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimality of Some Set Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time trade-offs on the FFT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for computing functions, using connectivity properties of their circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time-space tradeoff for sorting with linear queries / rank
 
Normal rank

Latest revision as of 12:27, 13 June 2024

scientific article
Language Label Description Also known as
English
A time-space tradeoff for sorting on non-oblivious machines
scientific article

    Statements

    Identifiers