Search the dblp DataBase
Ephraim Feig :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Bowen Alpern , Larry Carter , Ephraim Feig Uniform Memory Hierarchies [Citation Graph (1, 0)][DBLP ] FOCS, 1990, pp:600-608 [Conf ] Bowen Alpern , Larry Carter , Ephraim Feig , Ted Selker The Uniform Memory Hierarchy Model of Computation. [Citation Graph (1, 0)][DBLP ] Algorithmica, 1994, v:12, n:2/3, pp:72-109 [Journal ] Ephraim Feig Five Years of Software as a Service: The Good, the Bad and the Ugly. [Citation Graph (0, 0)][DBLP ] IEEE SCC, 2005, pp:- [Conf ] Ephraim Feig , Ali Arsanjani , Cesar A. Gonzales , Zhiwei Xu Experiences with Service Computing - A view from the Business World. [Citation Graph (0, 0)][DBLP ] IEEE SCC, 2005, pp:- [Conf ] Pat Narendra , Ephraim Feig , David Heit , Quentin Miller , Timo Burns Mobile Web Services Trend Perspectives. [Citation Graph (0, 0)][DBLP ] IEEE SCC, 2006, pp:- [Conf ] Ling Liu , Carl K. Chang , Ephraim Feig , Hemant K. Jain , Liang-Jie Zhang Software and Services: Where do they meet? [Citation Graph (0, 0)][DBLP ] IEEE SCC, 2006, pp:- [Conf ] Ephraim Feig , Shmuel Winograd On the Direct Sum Conjecture (Extended Summary) [Citation Graph (0, 0)][DBLP ] FOCS, 1981, pp:91-94 [Conf ] Ephraim Feig Going Public with Software-as-a-Service. [Citation Graph (0, 0)][DBLP ] ICWS, 2004, pp:- [Conf ] Ephraim Feig Five Years of Software as a Service: The Good, the Bad, and the Ugly. [Citation Graph (0, 0)][DBLP ] ICWS, 2005, pp:- [Conf ] Ephraim Feig Experiences with Service Computing--A View from the Business World. [Citation Graph (0, 0)][DBLP ] ICWS, 2005, pp:- [Conf ] Michael Ben-Or , Ephraim Feig , Dexter Kozen , Prasoon Tiwari A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots [Citation Graph (0, 0)][DBLP ] STOC, 1986, pp:340-349 [Conf ] Ephraim Feig On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1981, v:2, n:3, pp:261-281 [Journal ] Ephraim Feig Minimal Algorithms for Bilinear Forms May Have Divisions. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1983, v:4, n:1, pp:81-84 [Journal ] Ephraim Feig Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1983, v:4, n:2, pp:137-149 [Journal ] Michael Ben-Or , Ephraim Feig , Dexter Kozen , Prasoon Tiwari A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:6, pp:1081-1092 [Journal ] Ephraim Feig , Shmuel Winograd On the multiplicative complexity of discrete cosine transforms. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1387-0 [Journal ] Ephraim Feig , Liang-Jie Zhang , Ali Arsanjani , Zhiwei Xu Services Computing in Action: Services Architectures. [Citation Graph (0, 0)][DBLP ] ICWS, 2007, pp:- [Conf ] Smarter SOA. [Citation Graph (, )][DBLP ] A One-Way Function Based On The Extended Euclidean Algorithm [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.007secs