dblp.uni-trier.dewww.uni-trier.de

Ephraim Feig

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
18EEEphraim Feig, Vivian Feig: A One-Way Function Based On The Extended Euclidean Algorithm CoRR abs/0801.2187: (2008)
2007
17EEEphraim Feig, Liang-Jie Zhang, Ali Arsanjani, Zhiwei Xu: Services Computing in Action: Services Architectures. ICWS 2007
2006
16EEPat Narendra, Ephraim Feig, David Heit, Quentin Miller, Timo Burns: Mobile Web Services Trend Perspectives. IEEE SCC 2006
15EELing Liu, Carl K. Chang, Ephraim Feig, Hemant K. Jain, Liang-Jie Zhang: Software and Services: Where do they meet? IEEE SCC 2006
2005
14EEEphraim Feig: Experiences with Service Computing--A View from the Business World. ICWS 2005
13EEEphraim Feig: Five Years of Software as a Service: The Good, the Bad, and the Ugly. ICWS 2005
12EEEphraim Feig, Ali Arsanjani, Cesar A. Gonzales, Zhiwei Xu: Experiences with Service Computing - A view from the Business World. IEEE SCC 2005
11EEEphraim Feig: Five Years of Software as a Service: The Good, the Bad and the Ugly. IEEE SCC 2005
2004
10EEEphraim Feig: Going Public with Software-as-a-Service. ICWS 2004
1994
9 Bowen Alpern, Larry Carter, Ephraim Feig, Ted Selker: The Uniform Memory Hierarchy Model of Computation. Algorithmica 12(2/3): 72-109 (1994)
1992
8 Ephraim Feig, Shmuel Winograd: On the multiplicative complexity of discrete cosine transforms. IEEE Transactions on Information Theory 38(4): 1387- (1992)
1990
7 Bowen Alpern, Larry Carter, Ephraim Feig: Uniform Memory Hierarchies FOCS 1990: 600-608
1988
6 Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari: A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. SIAM J. Comput. 17(6): 1081-1092 (1988)
1986
5 Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari: A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots STOC 1986: 340-349
1983
4 Ephraim Feig: Minimal Algorithms for Bilinear Forms May Have Divisions. J. Algorithms 4(1): 81-84 (1983)
3 Ephraim Feig: Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic. J. Algorithms 4(2): 137-149 (1983)
1981
2 Ephraim Feig, Shmuel Winograd: On the Direct Sum Conjecture (Extended Summary) FOCS 1981: 91-94
1 Ephraim Feig: On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear. J. Algorithms 2(3): 261-281 (1981)

Coauthor Index

1Bowen Alpern [7] [9]
2Ali Arsanjani [12] [17]
3Michael Ben-Or [5] [6]
4Timo Burns [16]
5Larry Carter [7] [9]
6Carl K. Chang [15]
7Vivian Feig [18]
8Cesar A. Gonzales [12]
9David Heit [16]
10Hemant K. Jain [15]
11Dexter Kozen [5] [6]
12Ling Liu [15]
13Quentin Miller [16]
14Pat Narendra [16]
15Ted Selker [9]
16Prasoon Tiwari [5] [6]
17Shmuel Winograd [2] [8]
18Zhiwei Xu [12] [17]
19Liang-Jie Zhang [15] [17]

Colors in the list of coauthors

Copyright © Wed May 28 02:56:03 2008 by Michael Ley (ley@uni-trier.de)