The following pages link to Edith Cohen (Q878693):
Displaying 50 items.
- Associative search in peer to peer networks: Harnessing latent semantics (Q878694) (← links)
- Spatially-decaying aggregation over a network (Q878748) (← links)
- Processing top-\(k\) queries from samples (Q948026) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- Structure prediction and computation of sparse matrix products (Q1288468) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- New algorithms for generalized network flows (Q1332311) (← links)
- Caching documents with variable sizes and fetching costs: an LP-based approach (Q1348944) (← links)
- Size-estimation framework with applications to transitive closure and reachability (Q1384531) (← links)
- Proactive caching of DNS records: Addressing a performance bottleneck. (Q1400391) (← links)
- Connection caching: Model and algorithms. (Q1401982) (← links)
- (Q1600990) (redirect page) (← links)
- Exploiting regularities in web traffic patterns for cache replacement (Q1600991) (← links)
- Performance aspects of distributed caches using TTL-based consistency (Q1770426) (← links)
- Competitive analysis of the LRFU paging algorithm (Q1849588) (← links)
- Algorithms and estimators for summarization of unaggregated data streams (Q2453543) (← links)
- A short walk in the blogistan (Q2494757) (← links)
- All-Pairs Small-Stretch Paths (Q2729642) (← links)
- (Q2743984) (← links)
- Restoration by path concatenation (Q2787666) (← links)
- Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q2817594) (← links)
- Exploiting regularities in Web traffic patterns for cache replacement (Q2819539) (← links)
- Connection caching (Q2819591) (← links)
- Scheduling Subset Tests: One-Time, Continuous, and How They Relate (Q2851850) (← links)
- What You Can Do with Coordinated Samples (Q2851877) (← links)
- Envy-Free Makespan Approximation (Q2884571) (← links)
- Estimation for monotone sampling (Q2943617) (← links)
- Labeling Dynamic XML Trees (Q3053159) (← links)
- Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums (Q3115872) (← links)
- Using Selective Path-Doubling for Parallel Shortest-Path Computations (Q3125218) (← links)
- (Q3138946) (← links)
- (Q3974963) (← links)
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Q4210144) (← links)
- (Q4228439) (← links)
- Approximating Matrix Multiplication for Pattern Recognition Tasks (Q4238529) (← links)
- (Q4252388) (← links)
- Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs (Q4271085) (← links)
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality (Q4327426) (← links)
- Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q4406310) (← links)
- (Q4411367) (← links)
- Reachability and Distance Queries via 2-Hop Labels (Q4429688) (← links)
- (Q4471366) (← links)
- (Q4535061) (← links)
- Stream Sampling Framework and Application for Frequency Cap Statistics (Q4629966) (← links)
- (Q4633941) (← links)
- On optimizing multiplications of sparse matrices (Q4645925) (← links)
- Balanced-Replication Algorithms for Distribution Trees (Q4651532) (← links)
- (Q4778550) (← links)
- (Q4829033) (← links)
- Approximate Max-Flow on Small Depth Networks (Q4842122) (← links)
