| 2007 |
|---|
| 33 | EE | Ahmed Sameh,
Tarek A. El-Ghazawi,
Yaacov Yesha:
Modeling contention of sparse-matrix-vector multiplication (SMV) in three parallel programming paradigms.
WOSP 2007: 46-49 |
| 32 | EE | Mohamed F. Younis,
Amit Sardesai,
Yaacov Yesha:
Optimal dynamic transport selection for wireless portable devices.
Wireless Communications and Mobile Computing 7(1): 9-21 (2007) |
| 2006 |
|---|
| 31 | EE | Avinash Shenoi,
Yelena Yesha,
Yaacov Yesha,
Anupam Joshi:
A framework for specification and performance evaluation of service discovery protocols in mobile ad-hoc networks.
Ad Hoc Networks 4(1): 1-23 (2006) |
| 2004 |
|---|
| 30 | EE | Vadim Okun,
Paul E. Black,
Yaacov Yesha:
Comparison of fault classes in specification-based testing.
Information & Software Technology 46(8): 525-533 (2004) |
| 29 | EE | Vasileios Megalooikonomou,
Yaacov Yesha:
Space efficient quantization for distributed estimation by a multi-sensor fusion system.
Information Fusion 5(4): 299-308 (2004) |
| 2002 |
|---|
| 28 | EE | Vasileios Megalooikonomou,
Yaacov Yesha:
Quantization for distributed estimation using neural networks.
Inf. Sci. 148(1-4): 185-199 (2002) |
| 2000 |
|---|
| 27 | EE | Paul E. Black,
Vadim Okun,
Yaacov Yesha:
Mutation Operators for Specifications.
ASE 2000: 81- |
| 1999 |
|---|
| 26 | EE | Konstantinos Kalpakis,
Yaacov Yesha:
Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays.
Algorithmica 23(2): 159-179 (1999) |
| 1998 |
|---|
| 25 | EE | Yaacov Yesha:
Parameter replacement for CELP coded speech in land mobile radio.
Wireless Networks 4(4): 291-295 (1998) |
| 1997 |
|---|
| 24 | EE | Konstantinos Kalpakis,
Yaacov Yesha:
On the bisection width of the transposition network.
Networks 29(1): 69-76 (1997) |
| 1995 |
|---|
| 23 | | Konstantinos Kalpakis,
Yaacov Yesha:
On the Power of the Linear Array Architecture for Performing Tree-Structured Computations.
J. Comput. Syst. Sci. 50(1): 1-10 (1995) |
| 1992 |
|---|
| 22 | | Ramakrishna Thurimella,
Yaacov Yesha:
A Scheduling Principle for Precedence Graphs with Communication Delay.
ICPP (3) 1992: 229-236 |
| 1991 |
|---|
| 21 | | Dipak Ghosal,
Amar Mukherjee,
Ramakrishna Thurimella,
Yaacov Yesha:
Mapping Task Trees onto a Linear Array.
ICPP (1) 1991: 629-633 |
| 20 | | Lin Chen,
Yaacov Yesha:
Parallel Recognition of the Consecutive Ones Property with Applications.
J. Algorithms 12(3): 375-392 (1991) |
| 19 | | Ming Li,
Yaacov Yesha:
Resource Bounds for Parallel Computation of Threshold and Symmetric Functions.
J. Comput. Syst. Sci. 42(1): 119-137 (1991) |
| 1990 |
|---|
| 18 | | Xin He,
Yaacov Yesha:
Efficient Parallel Algorithms for r-Dominating Set and p-Center Problems on Trees.
Algorithmica 5(1): 129-145 (1990) |
| 1989 |
|---|
| 17 | | Faith E. Fich,
Ming Li,
Prabhakar Ragde,
Yaacov Yesha:
On the Power of Concurrent-Write PRAMs With Read-Only Memory
Inf. Comput. 83(2): 234-244 (1989) |
| 16 | EE | Ming Li,
Yaacov Yesha:
New lower bounds for parallel computation.
J. ACM 36(3): 671-680 (1989) |
| 1988 |
|---|
| 15 | | Xin He,
Yaacov Yesha:
Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs.
J. Algorithms 9(1): 92-113 (1988) |
| 14 | | Xin He,
Yaacov Yesha:
A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs.
SIAM J. Comput. 17(3): 486-491 (1988) |
| 1987 |
|---|
| 13 | | Ming Li,
Yaacov Yesha:
The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions.
ICALP 1987: 326-335 |
| 12 | | Ming Li,
Yaacov Yesha:
Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation
Inf. Comput. 73(2): 102-128 (1987) |
| 11 | | Xin He,
Yaacov Yesha:
Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs
Inf. Comput. 75(1): 15-38 (1987) |
| 1986 |
|---|
| 10 | | Juris Hartmanis,
Ming Li,
Yaacov Yesha:
Containment, Separation, Complete Sets, and Immunity of Complexity Classes.
ICALP 1986: 136-145 |
| 9 | | Ming Li,
Yaacov Yesha:
New Lower Bounds for Parallel Computation
STOC 1986: 177-187 |
| 8 | | Ming Li,
Yaacov Yesha:
String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation.
Inf. Process. Lett. 22(5): 231-235 (1986) |
| 7 | EE | Aviezri S. Fraenkel,
Yaacov Yesha:
The generalized Sprague-Grundy function and its invariance under certain mappings.
J. Comb. Theory, Ser. A 43(2): 165-177 (1986) |
| 1984 |
|---|
| 6 | | Yaacov Yesha:
Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer.
J. Comput. Syst. Sci. 29(2): 183-197 (1984) |
| 5 | | Juris Hartmanis,
Yaacov Yesha:
Computation Times of NP Sets of Different Densities.
Theor. Comput. Sci. 34: 17-32 (1984) |
| 1983 |
|---|
| 4 | | Juris Hartmanis,
Juris Hartmanis,
Yaacov Yesha:
Computation Times of NP Sets of Different Densities.
ICALP 1983: 319-330 |
| 3 | | Yaacov Yesha:
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets.
SIAM J. Comput. 12(3): 411-425 (1983) |
| 1980 |
|---|
| 2 | | Aviezri S. Fraenkel,
Yaacov Yesha:
Complexity of Solving Algebraic Equations.
Inf. Process. Lett. 10(4/5): 178-179 (1980) |
| 1978 |
|---|
| 1 | | Aviezri S. Fraenkel,
M. R. Garey,
David S. Johnson,
T. Schaefer,
Yaacov Yesha:
The Complexity of Checkers on an N * N Board - Preliminary Report
FOCS 1978: 55-64 |
