The following pages link to A. Wigderson (Q178716):
Displaying 50 items.
- Towards a Study of Low-Complexity Graphs (Q3638029) (← links)
- Rectilinear Graphs and Their Embeddings (Q3684138) (← links)
- Trade-Offs between Depth and Width in Parallel Computation (Q3691060) (← links)
- (Q3725558) (← links)
- (Q3745272) (← links)
- Improving the performance guarantee for approximate graph coloring (Q3763600) (← links)
- How to share memory in a distributed system (Q3766836) (← links)
- A fast parallel algorithm for the maximal independent set problem (Q3771607) (← links)
- A Time-Space Tradeoff for Element Distinctness (Q3776617) (← links)
- The Complexity of Parallel Sorting (Q3776649) (← links)
- (Q3777937) (← links)
- The Discrete Logarithm Hides $O(\log n)$ Bits (Q3787919) (← links)
- Relations between Concurrent-Write Models of Parallel Computation (Q3798244) (← links)
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (Q3802607) (← links)
- (Q3804186) (← links)
- On computations with integer division (Q3816971) (← links)
- (Q4011254) (← links)
- Rounds in Communication Complexity Revisited (Q4037694) (← links)
- (Q4228516) (← links)
- Undirected connectivity in \(O(\log^{1. 5} n)\) space (Q4230323) (← links)
- (Q4230353) (← links)
- (Q4231906) (← links)
- (Q4234056) (← links)
- (Q4234123) (← links)
- Techniques for bounding the convergence rate of genetic algorithms (Q4238438) (← links)
- (Q4284631) (← links)
- (Q4287360) (← links)
- Constructing Small Sets that are Uniform in Arithmetic Progressions (Q4290101) (← links)
- Monotone circuits for matching require linear depth (Q4302809) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- (Q4343445) (← links)
- Tiny families of functions with random properties: A quality-size trade-off for hashing (Q4372785) (← links)
- On the Power of Finite Automata with both Nondeterministic and Probabilistic States (Q4388897) (← links)
- Short proofs are narrow—resolution made simple (Q4406287) (← links)
- (Q4440431) (← links)
- (Q4440439) (← links)
- The Quantum Communication Complexity of Sampling (Q4441894) (← links)
- (Q4526985) (← links)
- (Q4526986) (← links)
- (Q4527004) (← links)
- (Q4527043) (← links)
- (Q4535028) (← links)
- (Q4542521) (← links)
- (Q4542587) (← links)
- Mathematics and Computation (Q4554784) (← links)
- Towards Optimal Deterministic Coding for Interactive Communication (Q4575719) (← links)
- (Q4591373) (← links)
- On randomness extraction in \({\mathcal{AC}}^0\) (Q4601849) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- (Q4650567) (← links)
