Catalytic communication
From MaRDI portal
Cites work
- A new proof of the graph removal lemma
- A note on amortized branching program complexity
- Amortized circuit complexity, formal complexity measures, and catalytic algorithms
- Catalytic approaches to the tree evaluation problem
- Catalytic space: non-determinism and hierarchy
- Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach
- Communication Complexity
- Communication memento: memoryless communication complexity
- Computing with a full memory: catalytic space
- Derandomizing logspace with a small shared hard drive
- Error reduction for weighted PRGs against read once branching programs
- Graph Theory and Additive Combinatorics
- Hidden permutations to the rescue: multi-pass streaming lower bounds for approximate matchings
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 7053293 (Why is no real title available?)
- scientific article; zbMATH DE number 7650313 (Why is no real title available?)
- scientific article; zbMATH DE number 7788450 (Why is no real title available?)
- Monotonicity testing over general poset domains
- Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs
- On a problem of K. Zarankiewicz
- On graphs decomposable into induced matchings of linear sizes
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On the communication complexity of high-dimensional permutations
- On the existence of triangulated spheres in 3-graphs, and related problems
- On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels
- Optimal numberings and isoperimetric problems on graphs
- Pseudodistributions that beat all pseudorandom generators (extended abstract)
- Pseudorandom generators for regular branching programs
- Pseudorandom generators for space-bounded computation
- Pseudorandomness for network algorithms
- Simple analysis of graph tests for linearity and PCP
- Space-bounded communication complexity
- The coin problem and pseudorandomness for branching programs
- The coin problem with applications to data streams
- The garden-hose model
- Tight space complexity of the coin problem
- Trading time and space in catalytic branching programs
This page was built for publication: Catalytic communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296726)
