| 2008 |
|---|
| 23 | EE | Eliezer Dekel:
Data as a cloud service-challenges and opportunities.
Autonomics 2008: 18 |
| 2004 |
|---|
| 22 | EE | Eliezer Dekel,
Gera Goft:
ITRA: Inter-Tier Relationship Architecture for End-to-end QoS.
The Journal of Supercomputing 28(1): 43-70 (2004) |
| 2003 |
|---|
| 21 | EE | Eliezer Dekel,
Oleg Frenkel,
Gera Goft,
Yosef Moatti:
Easy: Engineering High Availability QoS in wServices.
SRDS 2003: 157-166 |
| 2000 |
|---|
| 20 | EE | Eliezer Dekel:
Guest Editor's Introduction: Special Issue on Java on Clusters.
J. Parallel Distrib. Comput. 60(10): 1155-1158 (2000) |
| 1995 |
|---|
| 19 | | Yuval Caspi,
Eliezer Dekel:
Edge Coloring Series Parallel Graphs.
J. Algorithms 18(2): 296-321 (1995) |
| 1994 |
|---|
| 18 | | Eliezer Dekel,
Jie Hu:
Parallel Pruning Decomposition (PDS) and Biconnected Components of Graphs.
CIAC 1994: 91-108 |
| 17 | | Eliezer Dekel,
Jie Hu:
A Parallel Algorithm for Finding Minimum Cutsets in Reducible Graphs.
J. Parallel Distrib. Comput. 20(1): 43-55 (1994) |
| 1993 |
|---|
| 16 | | Eliezer Dekel,
Jie Hu:
Parallel Dynamic st-numbering and Applications.
IPPS 1993: 576-580 |
| 1992 |
|---|
| 15 | | Eliezer Dekel,
Jie Hu,
Wen Ouyang:
An Efficient Parallel Algorithm for Finding Compact Sets.
ICPP (3) 1992: 331-337 |
| 14 | | Yuval Caspi,
Eliezer Dekel:
A Near-Optimal Parallel Algorithm for Edge-Coloring Outerplanar Graphs.
IPPS 1992: 262-266 |
| 13 | | Yuval Caspi,
Eliezer Dekel:
A New Framework for Designing Parallel Algorithms on Series Parallel Graphs.
SPDP 1992: 168-175 |
| 12 | | Eliezer Dekel,
Jie Hu,
Wen Ouyang:
An Optimal Algorithm for Finding Compact Sets.
Inf. Process. Lett. 44(5): 285-289 (1992) |
| 1989 |
|---|
| 11 | | Eliezer Dekel,
Istvan Ozsvath:
Parallel External Merging.
J. Parallel Distrib. Comput. 6(3): 623-635 (1989) |
| 1987 |
|---|
| 10 | | Eliezer Dekel,
Simeon C. Ntafos,
Shietung Peng:
Compression Trees and Their Applications.
ICPP 1987: 132-139 |
| 1986 |
|---|
| 9 | | Eliezer Dekel,
Simeon C. Ntafos,
Shietung Peng:
Parallel Tree Techniques and Code Optimization.
Aegean Workshop on Computing 1986: 205-216 |
| 8 | | Eliezer Dekel,
Shietung Peng,
Shietung Iyengar:
Optimal Parallel Algorithms for Constructing Balanced m-Way Search Tree.
ICPP 1986: 1010-1012 |
| 7 | | Eliezer Dekel,
Istvan Ozsvath:
Parallel External Merging.
ICPP 1986: 921-923 |
| 1983 |
|---|
| 6 | EE | Eliezer Dekel,
Sartaj Sahni:
Parallel Generation of Postfix and Tree Forms.
ACM Trans. Program. Lang. Syst. 5(3): 300-317 (1983) |
| 5 | | Eliezer Dekel,
Sartaj Sahni:
Binary Trees and Parallel Scheduling Algorithms.
IEEE Trans. Computers 32(3): 307-315 (1983) |
| 1982 |
|---|
| 4 | | Eliezer Dekel,
Sartaj Sahni:
Parallel generation of the postfix form.
ICPP 1982: 171-177 |
| 3 | | Eliezer Dekel,
Sartaj Sahni:
A parallel matching algorithm for convex bipartite graphs.
ICPP 1982: 178-184 |
| 1981 |
|---|
| 2 | | Eliezer Dekel,
Sartaj Sahni:
Binary trees and parallel scheduling algorithms.
CONPAR 1981: 480-492 |
| 1 | | Eliezer Dekel,
David Nassimi,
Sartaj Sahni:
Parallel Matrix and Graph Algorithms.
SIAM J. Comput. 10(4): 657-675 (1981) |
