The following pages link to Carstent Lund (Q2453542):
Displayed 36 items.
- Item:Q2453542 (redirect page) (← links)
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- Interactive proof systems and alternating time-space complexity (Q685437) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- Addendum to: Non-deterministic exponential time has two-prower interactive protocols (Q1210334) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Paging against a distribution and IP networking (Q1305939) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- On the hardness of computing the permanent of random matrices (Q1355377) (← links)
- Algorithms and estimators for summarization of unaggregated data streams (Q2453543) (← links)
- Efficient probabilistic checkable proofs and applications to approximation (Q2817678) (← links)
- Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums (Q3115872) (← links)
- (Q3128899) (← links)
- (Q3135849) (← links)
- Complexity Results for POMSET Languages (Q3136615) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- (Q3358224) (← links)
- Priority sampling for estimation of arbitrary subset sums (Q3546350) (← links)
- Learn More, Sample Less: Control of Volume and Variance in Network Measurement (Q3546821) (← links)
- (Q3549243) (← links)
- (Q4035675) (← links)
- Competitive On-Line Algorithms for Distributed Data Management (Q4229425) (← links)
- (Q4230322) (← links)
- (Q4259979) (← links)
- Algebraic methods for interactive proof systems (Q4302792) (← links)
- On the hardness of approximating minimization problems (Q4323730) (← links)
- On Bounded Queries and Approximation (Q4337440) (← links)
- Random Debaters and the Hardness of Approximating Stochastic Functions (Q4337648) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- (Q4633941) (← links)
- On the Tradeoff between Stability and Fit (Q4962643) (← links)
- On the hardness of approximating minimization problems (Q5248497) (← links)
- Efficient probabilistically checkable proofs and applications to approximations (Q5248498) (← links)
- Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (Q5248499) (← links)
- Alternation in interaction (Q5946704) (← links)