Finding the Median (Obliviously) with Bounded Space (Q3448777): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121162169 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1505.00090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinism versus nondeterminism for linear time RAMs with memory restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meanders and their applications in lower bounds arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general Sequential Time-Space Tradeoff for Finding Unique Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-off lower bounds for randomized computation of decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / 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: On lower bounds for read-\(k\)-times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison-based time-space lower bounds for selection / 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: Q3002807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection from read-only memory and sorting with minimum data movement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Time-Space Tradeoff for Element Distinctness / rank
 
Normal rank

Latest revision as of 22:46, 10 July 2024

scientific article
Language Label Description Also known as
English
Finding the Median (Obliviously) with Bounded Space
scientific article

    Statements

    Finding the Median (Obliviously) with Bounded Space (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2015
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references