Yaacov Yesha

Available identifiers

zbMath Open yesha.yaacovMaRDI QIDQ751803

List of research outcomes

Publication	Date of Publication	Type
Quantization for distributed estimation using neural networks	2003-06-09	Paper
Computation times of NP sets of different densities	2002-05-13	Paper
On the bisection width of the transposition network	1997-07-23	Paper
https://portal.mardi4nfdi.de/entity/Q4893453	1996-11-20	Paper
On the power of the linear array architecture for performing tree- structured computations	1995-12-13	Paper
Efficient parallel algorithms for bipartite permutation graphs	1993-06-29	Paper
New lower bounds for parallel computation	1992-06-25	Paper
Parallel recognition of the consecutive ones property with applications	1991-01-01	Paper
Resource bounds for parallel computation of threshold and symmetric functions	1991-01-01	Paper
Efficient parallel algorithms for r-dominating set and p-center problems on trees	1990-01-01	Paper
On the power of concurrent-write PRAMs with read-only memory	1989-01-01	Paper
A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs	1988-01-01	Paper
Binary tree algebraic computation and parallel algorithms for simple graphs	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3783554	1987-01-01	Paper
Parallel recognition and decomposition of two terminal series parallel graphs	1987-01-01	Paper
Separation and lower bounds for ROM and nondeterministic models of parallel computation	1987-01-01	Paper
String-matching cannot be done by a two-head one-way deterministic finite automaton	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3801071	1986-01-01	Paper
The generalized Sprague-Grundy function and its invariance under certain mappings	1986-01-01	Paper
Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer	1984-01-01	Paper
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3315500	1983-01-01	Paper
Theory of annihilation games. I	1982-01-01	Paper
Mean flow scheduling and optimal construction of a treelike communication network	1981-01-01	Paper
Complexity of solving algebraic equations	1980-01-01	Paper
Complexity of problems in games, graphs and algebraic equations	1979-01-01	Paper
Three Annihilation Games	1978-01-01	Paper
Theory of annihilation games	1976-01-01	Paper

Research outcomes over time

This page was built for person: Yaacov Yesha