Travelled to:1 × China
1 × Denmark
1 × Sweden
2 × Canada
2 × USA
Collaborated with:M.Yannakakis N.G.Duffield M.Thorup J.Feigenbaum M.Bellare S.Goldwasser U.Feige E.Cohen H.Kaplan J.A.Kahn N.Alon A.Russell A.Russeli A.Condon P.W.Shor
Talks about:approxim (5) probabilist (3) checkabl (3) hard (3) unaggreg (2) problem (2) effici (2) applic (2) proof (2) data (2)
Person: Carsten Lund
DBLP: Lund:Carsten
Contributed to:
2009
20072005
1994
199319931992
1991Wrote 10 papers:
- VLDB-2009-CohenDKLT #composition #scalability #set #summary
- Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets (EC, NGD, HK, CL, MT), pp. 431–442.
- PODS-2007-CohenDKLT #data type #query #sketching
- Sketching unaggregated data streams for subpopulation-size queries (EC, NGD, HK, CL, MT), pp. 253–262.
- PODS-2005-AlonDLT #set
- Estimating arbitrary subset sums with few probes (NA, NGD, CL, MT), pp. 317–325.
- STOC-1994-BellareGLR #approximate #performance #probability #proving
- Efficient probabilistic checkable proofs and applications to approximation (MB, SG, CL, AR), p. 820.
- ICALP-1993-LundY #approximate #problem
- The Approximation of Maximum Subgraph Problems (CL, MY), pp. 40–51.
- STOC-1993-BellareGLR #approximate #performance #proving
- Efficient probabilistically checkable proofs and applications to approximations (MB, SG, CL, AR), pp. 294–304.
- STOC-1993-CondonFLS #algorithm #approximate
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (AC, JF, CL, PWS), pp. 305–314.
- STOC-1993-LundY #approximate #on the #problem
- On the hardness of approximating minimization problems (CL, MY), pp. 286–293.
- STOC-1992-FeigeL #matrix #on the #random
- On the Hardness of Computing the Permanent of Random Matrices (UF, CL), pp. 643–654.
- CAV-1991-FeigenbaumKL #complexity
- Complexity Results for POMSET Languages (JF, JAK, CL), pp. 343–353.