Edith Cohen | Academic Influence

Edith Cohen's AcademicInfluence.com Rankings

Edith Cohen

Computer Science

#2964

World Rank

#3106

Historical Rank

Database

#7794

World Rank

#8107

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Edith Cohen's Degrees

PhD Computer Science Stanford University
Bachelors Mathematics Tel Aviv University

Similar Degrees You Can Earn

Why Is Edith Cohen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Edith Cohen is an Israeli and American computer scientist specializing in data mining and algorithms for big data. She is also known for her research on peer-to-peer networks. She works for Google in Mountain View, California, and as a visiting professor at Tel Aviv University in Israel.

(See a Problem?)

Edith Cohen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Search and replication in unstructured peer-to-peer networks (2002) (1635)
Replication strategies in unstructured peer-to-peer networks (2002) (838)
Reachability and distance queries via 2-hop labels (2002) (607)
Search and replication in unstructured peer-to-peer networks (2002) (555)
Finding interesting associations without support pruning (2000) (481)
Size-Estimation Framework with Applications to Transitive Closure and Reachability (1997) (384)
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs (2003) (354)
Labeling dynamic XML trees (2002) (275)
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees (2014) (253)
Associative search in peer to peer networks: harnessing latent semantics (2003) (250)
Maintaining time-decaying stream aggregates (2003) (239)
Optimal oblivious routing in polynomial time (2003) (208)
Improving end-to-end performance of the Web using server volumes and proxy filters (1998) (175)
Prefetching the means for document transfer: a new approach for reducing Web latency (2000) (149)
Search and replication in unstructured peer-to-peer networks (2002) (137)
Summarizing data using bottom-k sketches (2007) (129)
Proactive caching of DNS records: addressing a performance bottleneck (2001) (115)
Polylog-time and near-linear work approximation scheme for undirected shortest paths (1994) (102)
All-pairs small-stretch paths (1997) (89)
Approximating matrix multiplication for pattern recognition tasks (1997) (89)
Making Routing Robust to Changing Traffic Demands: Algorithms and Evaluation (2006) (89)
All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis (2013) (86)
Computing classic closeness centrality, at scale (2014) (77)
Efficient algorithms for predicting requests to Web servers (1999) (74)
Refreshment policies for Web content caches (2001) (73)
Coping with network failures: routing strategies for optimal demand oblivious restoration (2004) (72)
Packet classification in large ISPs: design and evaluation of decision tree classifiers (2005) (70)
Tighter estimation using bottom k sketches (2008) (68)
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums (2008) (67)
Learning noisy perceptrons by a perceptron in polynomial time (1997) (65)
Efficient parallel shortest-paths in digraphs with a separator decomposition (1993) (59)
Evaluating Server-Assisted Cache Replacement in the Web (1998) (58)
A short walk in the Blogistan (2006) (56)
Spatially-decaying aggregation over a network: model and algorithms (2004) (54)
Polylog-time and near-linear work approximation scheme for undirected shortest paths (2000) (49)
Aging through cascaded caches: performance issues in the distribution of web content (2001) (46)
NP-Completeness of graph decomposition problems (1991) (45)
A case for associative peer to peer overlays (2003) (44)
Managing TCP Connections Under Persistent HTTP (1999) (44)
Structure Prediction and Computation of Sparse Matrix Products (1998) (43)
Using selective path-doubling for parallel shortest-path computations (1993) (41)
Exploiting regularities in Web traffic patterns for cache replacement (1999) (40)
Spatially-decaying aggregation over a network (2007) (36)
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs (1993) (36)
Estimating the size of the transitive closure in linear time (1994) (34)
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments (2009) (32)
Leveraging discarded samples for tighter estimation of multiple-set aggregates (2009) (30)
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths (2013) (30)
Algorithms and estimators for accurate summarization of internet traffic (2007) (29)
The Age Penalty and Its Effect on Cache Performance (2001) (28)
Restoration by path concatenation: fast recovery of MPLS paths (2001) (28)
What You Can Do with Coordinated Samples (2012) (28)
Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity (2017) (26)
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees (2015) (25)
Approximate max flow on small depth networks (1992) (25)
Predicting and bypassing end-to-end internet service degradations (2002) (24)
Truth, Envy, and Truthful Market Clearing Bundle Pricing (2011) (24)
Bottom-k sketches: better and more efficient estimation of aggregates (2007) (23)
Don't let the negatives bring you down: sampling from streams of signed updates (2012) (23)
Stream Sampling for Frequency Cap Statistics (2015) (22)
Sketching unaggregated data streams for subpopulation-size queries (2007) (22)
Structure-aware sampling on data streams (2011) (20)
Multi-objective Weighted Sampling (2015) (20)
Performance aspects of distributed caches using TTL-based consistency (2001) (20)
Structure-Aware Sampling: Flexible and Accurate Summarization (2011) (19)
Connection caching (1999) (18)
LP-based analysis of greedy-dual-size (1999) (18)
Restoration by path concatenation: fast recovery of MPLS paths (2001) (17)
Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches (2017) (17)
Composable Sketches for Functions of Frequencies: Beyond the Worst Case (2020) (16)
Distance-Based Influence in Networks: Computation and Maximization (2014) (16)
A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators (2021) (15)
Improvise: Interactive Multimedia Process Visualization Environment (1995) (14)
FriendlyCore: Practical Differentially Private Aggregation (2021) (12)
Bootstrapped Graph Diffusions: Exposing the Power of Nonlinearity (2018) (12)
Algorithms and estimators for summarization of unaggregated data streams (2014) (12)
Efficient estimation algorithms for neighborhood variance and other moments (2004) (12)
Connection caching under various models of communication (2000) (12)
On Optimizing Multiplications of Sparse Matrices (1996) (11)
Envy-free makespan approximation: extended abstract (2009) (11)
Estimation for monotone sampling: competitiveness and customization (2012) (10)
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach (2002) (10)
On the Tradeoff between Stability and Fit (2013) (10)
Processing top k queries from samples (2006) (10)
Timed Influence: Computation and Maximization (2014) (10)
Distance queries from sampled data: accurate and efficient (2012) (9)
Competitive Analysis of the LRFU Paging Algorithm (2001) (9)
Stream Sampling Framework and Application for Frequency Cap Statistics (2018) (8)
Get the most out of your sample: optimal unbiased estimators using partial information (2011) (8)
On the Robustness of CountSketch to Adaptive Inputs (2022) (8)
Sample Complexity Bounds for Influence Maximization (2019) (8)
Envy-Free Makespan Approximation (2009) (8)
Variance optimal sampling based estimation of subset sums (2008) (7)
Connection caching: model and algorithms (2003) (7)
Bootstrapped Graph Diffusions (2017) (7)
On the Interplay between Incentive Compatibility and Envy Freeness (2010) (7)
Confident estimation for multistage measurement sampling and aggregation (2008) (7)
A Labeling Approach to Incremental Cycle Detection (2013) (7)
Reverse Ranking by Graph Structure: Model and Scalable Algorithms (2015) (6)
All-Distances Sketches, Revisited: Scalable Estimation of the Distance Distribution and Centralities in Massive Graphs (2013) (6)
Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS (2017) (6)
Sampling Sketches for Concave Sublinear Functions of Frequencies (2019) (6)
Efficient Distinct Heavy Hitters for DNS DDoS Attack Detection (2016) (6)
HyperLogLog Hyperextended: Sketches for Concave Sublinear Frequency Statistics (2016) (5)
Semi-Supervised Learning on Graphs through Reach and Distance Diffusion (2016) (5)
Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets (2009) (5)
Sketch-Based Estimation of Subpopulation-Weight (2008) (5)
Balanced-Replication Algorithms for Distribution Trees (2002) (5)
Processing top-k queries from samples (2008) (5)
Probe scheduling for efficient detection of silent failures (2013) (4)
How to Estimate Change from Samples (2012) (4)
A Case for Customizing Estimators: Coordinated Samples (2012) (4)
WOR and p's: Sketches for 𝓁p-Sampling Without Replacement (2020) (4)
Truth and Envy in Capacitated Allocation Games (2010) (4)
Structure-aware sampling (2011) (3)
Greedy Maximization Framework for Graph-Based Influence Functions (2016) (2)
Competitive Analysis of the LRFU Paging Algorithm (2002) (2)
Differentially Private Weighted Sampling (2020) (2)
Õptimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization (2022) (2)
Estimating Aggregates over Multiple Sets (2008) (2)
Self-similar Epochs: Value in arrangement (2018) (2)
Generalized Private Selection and Testing with High Confidence (2022) (1)
Author retrospective for search and replication in unstructured peer-to-peer networks (2014) (1)
The Time-to-Live Based Consistency Mechanism: (2005) (1)
Variance Competitiveness for Monotone Estimation: Tightening the Bounds (2014) (1)
Clustering over Multi-Objective Samples: The one2all Sample (2017) (1)
Scheduling Subset Tests: One-Time, Continuous, and How They Relate (2013) (1)
Exploiting Regularities in Web Traffic Patterns for Cache Replacement (2002) (1)
`p-SAMPLING WITHOUT REPLACEMENT (2020) (1)
Metric Spaces: High Scalability with Tight Statistical Gua rantees (2015) (0)
Restoration by Path Con atenation : Fast Re overy of MPLS Paths (2001) (0)
Scalable Neighborhood Sketching and Distance Distribution Estimation in Graph Datasets: Revisited, Unified, and Improved (2013) (0)
WOR and $p$'s: Sketches for $\ell_p$-Sampling Without Replacement (2020) (0)
Estimating Frequency Statistics through Distinct Count Measurements (2016) (0)
Estimation from Coordinated Samples: Competitiveness and Customization (2012) (0)
Role of oxidative stress in the vascular dysfunction related to hypertension and aging (2002) (0)
The Target-Charging Technique for Privacy Accounting across Interactive Computations (2023) (0)
Error Bounded Ooset Error Bounded Ooset Error Bounded Ooset Error Bounded Ooset Error Bounded Ooset (0)
Graph Learning with Loss-Guided Training (2020) (0)
Semi-Supervised Learning for Asymmetric Graphs through Reach and Distance Diffusion (2016) (0)
Influence Maximization with Few Simulations (2019) (0)
LSH Microbatches for Stochastic Gradients: Value in Rearrangement (2018) (0)
Error Bounded Oset Error Bounded Oset Error Bounded Oset Error Bounded Oset Error Bounded Oset (0)
Coordinated Weighted Sampling: Estimation of Multiple-Assignment Aggregates (2021) (0)

This paper list is powered by the following services:

Other Resources About Edith Cohen

en.wikipedia.org

What Schools Are Affiliated With Edith Cohen?

Edith Cohen is affiliated with the following schools: