What is she best known for?
The fields of study she is best known for:
- Statistics
- Computer network
- Algorithm
Edith Cohen mainly investigates Discrete mathematics, Computer network, Theoretical computer science, Algorithm and Transitive closure.
The Time complexity research she does as part of her general Discrete mathematics study is frequently linked to other disciplines of science, such as Ellipsoid method, therefore creating a link between diverse domains of science.
Edith Cohen combines subjects such as Web server, Data placement, Database and Random graph with her study of Computer network.
The Transitive closure study combines topics in areas such as Reachability and Floyd–Warshall algorithm.
Her Combinatorics study which covers Computation that intersects with Data mining.
Her research investigates the link between The Internet and topics such as Distributed computing that cross with problems in Replicate, Flooding and Random walk.
Her most cited work include:
- Search and replication in unstructured peer-to-peer networks (1662 citations)
- Replication strategies in unstructured peer-to-peer networks (686 citations)
- Size-Estimation Framework with Applications to Transitive Closure and Reachability (366 citations)
What are the main themes of her work throughout her whole career to date?
The scientist’s investigation covers issues in Algorithm, Computer network, Combinatorics, Data mining and Theoretical computer science.
Edith Cohen has researched Algorithm in several fields, including Node, Graph theory, Pattern recognition and Graph.
Her biological study spans a wide range of topics, including Web server and Operating system.
In her study, which falls under the umbrella issue of Combinatorics, Floyd–Warshall algorithm is strongly linked to Discrete mathematics.
Her Theoretical computer science study combines topics from a wide range of disciplines, such as Structure, Node and Aggregate.
Her Cache research focuses on Competitive analysis and how it connects with Distributed computing.
She most often published in these fields:
- Algorithm (24.44%)
- Computer network (22.96%)
- Combinatorics (20.00%)
What were the highlights of her more recent work (between 2011-2018)?
- Algorithm (24.44%)
- Theoretical computer science (15.56%)
- Combinatorics (20.00%)
In recent papers she was focusing on the following fields of study:
Her primary scientific interests are in Algorithm, Theoretical computer science, Combinatorics, Maximization and Computation.
Her study deals with a combination of Algorithm and Continuous testing.
She has included themes like Semi-supervised learning, Centrality, Node, Closeness and Similarity in her Theoretical computer science study.
The various areas that Edith Cohen examines in her Semi-supervised learning study include Random walk and Spectral method.
Edith Cohen works mostly in the field of Combinatorics, limiting it down to topics relating to Sequence and, in certain cases, Time complexity, Binary logarithm, Directed acyclic graph and Cycle detection, as a part of the same area of interest.
Her studies deal with areas such as Reachability and Computational problem as well as Maximization.
Between 2011 and 2018, her most popular works were:
- Sketch-based Influence Maximization and Computation: Scaling up with Guarantees (177 citations)
- Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths (38 citations)
- Don't let the negatives bring you down: sampling from streams of signed updates (23 citations)
In her most recent research, the most cited papers focused on:
- Statistics
- Algorithm
- Computer network
Theoretical computer science, Maximization, Algorithm, Combinatorics and Computational problem are her primary areas of study.
Her Theoretical computer science research incorporates elements of Similarity, Closeness, Node and Data mining.
Her work focuses on many connections between Maximization and other disciplines, such as Centrality, that overlap with her field of interest in Computation, Node, Measure and Reachability.
Her work on Greedy algorithm as part of her general Algorithm study is frequently connected to Node, thereby bridging the divide between different branches of science.
When carried out as part of a general Combinatorics research project, her work on Multiple edges, Line graph, Directed graph and Strength of a graph is frequently linked to work in Butterfly graph, therefore connecting diverse disciplines of study.
Her Computational problem research includes themes of Function, Sequence and Network formation.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
