The following pages link to Yaacov Yesha (Q751803):
Displayed 29 items.
- Item:Q751803 (redirect page) (← links)
- On the power of concurrent-write PRAMs with read-only memory (Q582089) (← links)
- Resource bounds for parallel computation of threshold and symmetric functions (Q751804) (← links)
- Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer (Q1065546) (← links)
- String-matching cannot be done by a two-head one-way deterministic finite automaton (Q1075776) (← links)
- The generalized Sprague-Grundy function and its invariance under certain mappings (Q1090685) (← links)
- Parallel recognition and decomposition of two terminal series parallel graphs (Q1098313) (← links)
- Separation and lower bounds for ROM and nondeterministic models of parallel computation (Q1098633) (← links)
- Complexity of problems in games, graphs and algebraic equations (Q1137948) (← links)
- Complexity of solving algebraic equations (Q1165578) (← links)
- Theory of annihilation games. I (Q1168901) (← links)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- Computation times of NP sets of different densities (Q1348523) (← links)
- Quantization for distributed estimation using neural networks (Q1810455) (← links)
- On the power of the linear array architecture for performing tree- structured computations (Q1892200) (← links)
- Three Annihilation Games (Q3048640) (← links)
- (Q3315500) (← links)
- On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets (Q3335768) (← links)
- Parallel recognition of the consecutive ones property with applications (Q3348413) (← links)
- (Q3783554) (← links)
- Binary tree algebraic computation and parallel algorithms for simple graphs (Q3792255) (← links)
- A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs (Q3798262) (← links)
- (Q3801071) (← links)
- Mean flow scheduling and optimal construction of a treelike communication network (Q3909997) (← links)
- Theory of annihilation games (Q4097317) (← links)
- (Q4345575) (← links)
- New lower bounds for parallel computation (Q4710687) (← links)
- (Q4893453) (← links)
- Efficient parallel algorithms for bipartite permutation graphs (Q5285476) (← links)