What is she best known for?
The fields of study she is best known for:
- Algorithm
- Computer network
- Mathematical optimization
Leah Epstein mostly deals with Competitive analysis, Scheduling, Mathematical optimization, Combinatorics and Upper and lower bounds.
Her work focuses on many connections between Competitive analysis and other disciplines, such as Online algorithm, that overlap with her field of interest in Bin packing problem.
Her Scheduling research is multidisciplinary, relying on both Algorithm and Parallel computing.
Her Mathematical optimization research integrates issues from Completion time, Deterministic algorithm and Job shop scheduling.
Her Combinatorics research incorporates elements of Discrete mathematics and Bin.
Her research in Upper and lower bounds intersects with topics in Randomized algorithm and Game theory, Congestion game.
Her most cited work include:
- Virtual Network Embedding with Opportunistic Resource Sharing (87 citations)
- Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model (76 citations)
- Randomized on-line scheduling on two uniform machines (76 citations)
What are the main themes of her work throughout her whole career to date?
Her primary areas of study are Combinatorics, Competitive analysis, Bin packing problem, Mathematical optimization and Upper and lower bounds.
Her work carried out in the field of Combinatorics brings together such families of science as Discrete mathematics and Cardinality.
As a member of one scientific family, Leah Epstein mostly works in the field of Competitive analysis, focusing on Online algorithm and, on occasion, Theoretical computer science.
Bin packing problem is a subfield of Bin that Leah Epstein studies.
Her Mathematical optimization study combines topics from a wide range of disciplines, such as Time complexity, Algorithm and Scheduling, Job shop scheduling.
Leah Epstein has researched Upper and lower bounds in several fields, including Randomized algorithm and Theory of computation.
She most often published in these fields:
- Combinatorics (44.79%)
- Competitive analysis (43.53%)
- Bin packing problem (35.33%)
What were the highlights of her more recent work (between 2016-2021)?
- Bin packing problem (35.33%)
- Combinatorics (44.79%)
- Competitive analysis (43.53%)
In recent papers she was focusing on the following fields of study:
Her main research concerns Bin packing problem, Combinatorics, Competitive analysis, Bin and Upper and lower bounds.
Her Combinatorics study integrates concerns from other disciplines, such as Value and Theory of computation.
Her study in Competitive analysis is interdisciplinary in nature, drawing from both Theoretical computer science, Measure, Current, Online algorithm and Job shop scheduling.
Her Job shop scheduling research is multidisciplinary, incorporating perspectives in Mathematical optimization and Minification.
Her Bin research is multidisciplinary, incorporating elements of Discrete mathematics, Type, Nash equilibrium and Constant.
Her Upper and lower bounds study combines topics in areas such as Cardinality, Sequence and Partition.
Between 2016 and 2021, her most popular works were:
- A new and improved algorithm for online bin packing (31 citations)
- A new lower bound for classic online bin packing. (13 citations)
- Online bin packing with cardinality constraints resolved (10 citations)
In her most recent research, the most cited papers focused on:
- Algorithm
- Computer network
- Combinatorics
Leah Epstein mainly investigates Competitive analysis, Bin packing problem, Upper and lower bounds, Combinatorics and Online algorithm.
She has included themes like Scheduling, Job shop scheduling and Mathematical optimization, Minification in her Competitive analysis study.
Her Bin packing problem research is within the category of Bin.
Leah Epstein interconnects Dimension, Open problem and Cardinality in the investigation of issues within Bin.
Her research investigates the connection between Upper and lower bounds and topics such as Theory of computation that intersect with problems in Value, Rectangle packing, Constant and Sequence.
Her research in Combinatorics tackles topics such as Cardinality which are related to areas like Randomized algorithm, Matching, Enhanced Data Rates for GSM Evolution, Graph and Metric dimension.
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.
