Computing (and Life) Is All about Tradeoffs (Q2848971): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2188557740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardness of Being Private / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a model for backtracking and dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial match retrieval in implicit data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter lower bounds for nearest neighbor search and related problems in the cell probe model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs in resolution / 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: Some trade-off results for polynomial calculus / 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: A Time-Space Tradeoff for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tradeoff between search and update time for the implicit dictionary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-space tradeoff for sorting on non-oblivious machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient synchronous snapshots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards in-place geometric algorithms and data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stronger model of dynamic programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on tradeoffs between randomness and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube / 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: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining Stream Statistics over Sliding Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-space tradeoff for language recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit \(B\)-trees: A new data structure for the dictionary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit dictionaries with <i>O</i>(1) modifications per update and fast search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Data Structures for the Dictionary Problem / 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: The cell probe complexity of succinct data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different Modes of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the virtue of succinct proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parallel Evaluation of Multivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two time-space tradeoffs for element distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for parallel polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673089 / 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: Implicit data structures for fast search and update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounds in Communication Complexity Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebble Games, Proof Complexity, and Time-Space Trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic algorithm for testing primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tradeoff between search and update in dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic simulation of non-deterministic turing machines (Detailed Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum: A Fast Monte-Carlo Test for Primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Time-Space Tradeoff for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252722 / rank
 
Normal rank

Latest revision as of 20:33, 6 July 2024

scientific article
Language Label Description Also known as
English
Computing (and Life) Is All about Tradeoffs
scientific article

    Statements

    Computing (and Life) Is All about Tradeoffs (English)
    0 references
    0 references
    13 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers