Travelled to:1 × Croatia
1 × Denmark
1 × Finland
1 × Germany
1 × Greece
4 × USA
Collaborated with:J.Zhang C.Lund S.Kannan ∅ C.H.Papadimitriou S.Shenker L.Cowen J.A.Kahn M.Abadi J.Kilian A.Condon P.W.Shor A.McGregor S.Suri Y.Ishai T.Malkin K.Nissim M.Strauss R.N.Wright
Talks about:approxim (2) probabilist (1) multiparti (1) muliticast (1) transmiss (1) framework (1) algorithm (1) function (1) checkabl (1) support (1)
Person: Joan Feigenbaum
DBLP: Feigenbaum:Joan
Facilitated 1 volumes:
EdContributed to:
2012
2006
20042001200019961993
19911987Wrote 9 papers:
- LICS-2012-Feigenbaum #privacy
- Privacy, Anonymity, and Accountability in Ad-Supported Services (JF), pp. 9–10.
- CIKM-2006-ZhangF #correlation
- Finding highly correlated pairs efficiently with powerful pruning (JZ, JF), pp. 152–161.
- ICALP-2004-FeigenbaumKMSZ #graph #on the #problem
- On Graph Problems in a Semi-streaming Model (JF, SK, AM, SS, JZ), pp. 531–543.
- ICALP-2001-FeigenbaumIMNSW #approximate #multi
- Secure Multiparty Computation of Approximations (JF, YI, TM, KN, MS, RNW), pp. 927–938.
- STOC-2000-FeigenbaumPS #cost analysis #low cost
- Sharing the cost of muliticast transmissions (JF, CHP, SS), pp. 218–227.
- ICALP-1996-CowenFK #framework #heuristic #source code
- A Formal Framework for Evaluating Heuristic Programs (LC, JF, SK), pp. 634–645.
- STOC-1993-CondonFLS #algorithm #approximate
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (AC, JF, CL, PWS), pp. 305–314.
- CAV-1991-FeigenbaumKL #complexity
- Complexity Results for POMSET Languages (JF, JAK, CL), pp. 343–353.
- STOC-1987-AbadiFK #on the
- On Hiding Information from an Oracle (MA, JF, JK), pp. 195–203.