Eliezer Dekel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2012

2011

Special Issue on Cloud ComputingGregory Chockler, Eliezer Dekel, Joseph JáJá, Jimmy Lin. jpdc, 71(6):731, 2011. [doi]

2010

A Contract-based Event Driven Model for Collaborative Security in Financial Information SystemsRoberto Baldoni, Giorgia Lodi, Gregory Chockler, Eliezer Dekel, Barry P. Mulcahy, Giuseppe Martufi. ICEIS 2010: 147-152

2009

2008

Data as a cloud service-challenges and opportunitiesEliezer Dekel. autonomics 2008: 18 [doi]

2004

ITRA: Inter-Tier Relationship Architecture for End-to-end QoSEliezer Dekel, Gera Goft. tjs, 28(1):43-70, 2004. [doi]

2003

Easy: Engineering High Availability QoS in wServicesEliezer Dekel, Oleg Frenkel, Gera Goft, Yosef Moatti. srds 2003: 157-166 [doi]

2000

Guest Editor s Introduction: Special Issue on Java on ClustersEliezer Dekel. jpdc, 60(10):1155-1158, 2000. [doi]

1995

Edge Coloring Series Parallel GraphsYuval Caspi, Eliezer Dekel. jal, 18(2):296-321, 1995.

1994

Parallel Pruning Decomposition (PDS) and Biconnected Components of GraphsEliezer Dekel, Jie Hu. ciac 1994: 91-108

A Parallel Algorithm for Finding Minimum Cutsets in Reducible GraphsEliezer Dekel, Jie Hu. jpdc, 20(1):43-55, 1994.

1993

Parallel Dynamic st-numbering and ApplicationsEliezer Dekel, Jie Hu. ipps 1993: 576-580

1992

A Near-Optimal Parallel Algorithm for Edge-Coloring Outerplanar GraphsYuval Caspi, Eliezer Dekel. ipps 1992: 262-266

A New Framework for Designing Parallel Algorithms on Series Parallel GraphsYuval Caspi, Eliezer Dekel. spdp 1992: 168-175

An Efficient Parallel Algorithm for Finding Compact SetsEliezer Dekel, Jie Hu, Wen Ouyang. icpp 1992: 331-337

An Optimal Algorithm for Finding Compact SetsEliezer Dekel, Jie Hu, Wen Ouyang. ipl, 44(5):285-289, 1992.

1989

Parallel External MergingEliezer Dekel, Istvan Ozsvath. jpdc, 6(3):623-635, 1989.

1987

Compression Trees and Their ApplicationsEliezer Dekel, Simeon C. Ntafos, Shietung Peng. icpp 1987: 132-139

1986

1984

A parallel matching algorithm for convex bipartite graphs and applications to schedulingEliezer Dekel, Sartaj Sahni. jpdc, 1(2):185-205, 1984. [doi]

1983

Parallel Generation of Postfix and Tree FormsEliezer Dekel, Sartaj Sahni. TOPLAS, 5(3):300-317, 1983. [doi]

Binary Trees and Parallel Scheduling AlgorithmsEliezer Dekel, Sartaj Sahni. TC, 32(3):307-315, 1983.

Parallel Scheduling AlgorithmsEliezer Dekel, Sartaj Sahni. ior, 31(1):24-49, 1983. [doi]

1982

Parallel generation of the postfix formEliezer Dekel, Sartaj Sahni. icpp 1982: 171-177

A parallel matching algorithm for convex bipartite graphsEliezer Dekel, Sartaj Sahni. icpp 1982: 178-184

1981

Parallel Matrix and Graph AlgorithmsEliezer Dekel, David Nassimi, Sartaj Sahni. SICOMP, 10(4):657-675, 1981.

Binary trees and parallel scheduling algorithmsEliezer Dekel, Sartaj Sahni. conpar 1981: 480-492

Sign in or sign up to see more results.

runs on WebDSL