Yaacov Yesha

From MaRDI portal
Revision as of 08:10, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Yaacov Yesha to Yaacov Yesha: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:751803

Available identifiers

zbMath Open yesha.yaacovMaRDI QIDQ751803

List of research outcomes

PublicationDate of PublicationType
Quantization for distributed estimation using neural networks2003-06-09Paper
Computation times of NP sets of different densities2002-05-13Paper
On the bisection width of the transposition network1997-07-23Paper
https://portal.mardi4nfdi.de/entity/Q48934531996-11-20Paper
On the power of the linear array architecture for performing tree- structured computations1995-12-13Paper
Efficient parallel algorithms for bipartite permutation graphs1993-06-29Paper
New lower bounds for parallel computation1992-06-25Paper
Resource bounds for parallel computation of threshold and symmetric functions1991-01-01Paper
Parallel recognition of the consecutive ones property with applications1991-01-01Paper
Efficient parallel algorithms for r-dominating set and p-center problems on trees1990-01-01Paper
On the power of concurrent-write PRAMs with read-only memory1989-01-01Paper
Binary tree algebraic computation and parallel algorithms for simple graphs1988-01-01Paper
A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs1988-01-01Paper
Parallel recognition and decomposition of two terminal series parallel graphs1987-01-01Paper
Separation and lower bounds for ROM and nondeterministic models of parallel computation1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835541987-01-01Paper
String-matching cannot be done by a two-head one-way deterministic finite automaton1986-01-01Paper
The generalized Sprague-Grundy function and its invariance under certain mappings1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38010711986-01-01Paper
Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33155001983-01-01Paper
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets1983-01-01Paper
Theory of annihilation games. I1982-01-01Paper
Mean flow scheduling and optimal construction of a treelike communication network1981-01-01Paper
Complexity of solving algebraic equations1980-01-01Paper
Complexity of problems in games, graphs and algebraic equations1979-01-01Paper
Three Annihilation Games1978-01-01Paper
Theory of annihilation games1976-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Yaacov Yesha