Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Nicholas Knight
Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays - Part 1
S-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid
Related publications
Lower Bounds for Monotone Span Programs
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Superpolynomial Lower Bounds for Monotone Span Programs
Combinatorica
Combinatorics
Computational Mathematics
Discrete Mathematics
Efficient Algorithms and Lower Bounds for Robust Linear Regression
Hexagonal Grid Drawings: Algorithms and Lower Bounds
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation
Optimal Lower Bounds for Quantum Automata and Random Access Codes
Primary-Backup Protocols: Lower Bounds and Optimal Implementations
Dependable Computing and Fault-Tolerant Systems
