2016 - SIAM Fellow For contributions to the theory and applications of combinatorial optimization.
2015 - ACM Distinguished Member
Her main research concerns Mathematical optimization, Integer programming, Algorithm, Pre-play attack and Theoretical computer science. Her Mathematical optimization study which covers Fair-share scheduling that intersects with Flow shop scheduling. Cynthia A. Phillips has researched Integer programming in several fields, including Facility location problem and Fraction.
Her Algorithm study frequently draws connections between adjacent fields such as Water supply. The various areas that Cynthia A. Phillips examines in her Theoretical computer science study include Graph theory, Computer network, Computer virus and Corollary. Her Graph research is multidisciplinary, incorporating elements of Intrusion detection system, Subset and superset and Systems analysis.
Her primary areas of study are Mathematical optimization, Theoretical computer science, Distributed computing, Approximation algorithm and Integer programming. Cynthia A. Phillips studied Mathematical optimization and Integer that intersect with Set. The concepts of her Theoretical computer science study are interwoven with issues in Graph theory, Graph and Graph.
Graph is connected with Timing attack and Pre-play attack in her research. Her Approximation algorithm research incorporates themes from Linear programming, Scheduling and Discrete mathematics, Time complexity. The Integer programming study combines topics in areas such as Heuristics and Massively parallel.
Her primary scientific interests are in Distributed computing, Algorithm, Theoretical computer science, Graph and Neuromorphic engineering. Her study looks at the relationship between Distributed computing and fields such as Host, as well as how they intersect with chemical problems. Her research in Algorithm intersects with topics in Vertex, Graph, Scalability and Auxiliary memory.
Her work in Theoretical computer science tackles topics such as Algorithmics which are related to areas like Data mining. Graph is closely attributed to Dynamic programming in her research. Her Neuromorphic engineering study incorporates themes from Computation, Leverage, Models of neural computation and Computer engineering.
Her primary areas of investigation include Distributed computing, Neuromorphic engineering, Artificial neural network, Human–computer interaction and Dynamic programming. Her Distributed computing research is multidisciplinary, incorporating elements of Cache, High Bandwidth Memory, Approximation algorithm, Paging and Scheduling. Her Neuromorphic engineering research incorporates themes from Logic gate, Matrix multiplication, Arithmetic, Computation and Models of neural computation.
Cynthia A. Phillips incorporates Artificial neural network and Constant in her studies. Her study in Graph extends to Dynamic programming with its themes.
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.
A graph-based system for network-vulnerability analysis
Cynthia Phillips;Laura Painton Swiler.
new security paradigms workshop (1998)
The battle of the water sensor networks (BWSN): A design challenge for engineers and algorithms
Avi Ostfeld;James G. Uber;Elad Salomons;Jonathan W. Berry.
Journal of Water Resources Planning and Management (2008)
Optimal time-critical scheduling via resource augmentation
C.A. Phillips;C. Stein;E. Torng;J. Wein.
29. annual ACM symposium on the interface: computing science and statistics, El Paso, TX (United States), 4-17 May 1997 (1997)
Computer-attack graph generation tool
L.P. Swiler;C. Phillips;D. Ellis;S. Chakerian.
darpa information survivability conference and exposition (2001)
Sensor Placement in Municipal Water Networks
Jonathan W. Berry;Jonathan W. Berry;Lisa Fleischer;Lisa Fleischer;William E. Hart;William E. Hart;Cynthia A. Phillips;Cynthia A. Phillips.
Journal of Water Resources Planning and Management (2005)
Sensor Placement in Municipal Water Networks with Temporal Integer Programming Models
Jonathan Berry;William E. Hart;Cynthia A. Phillips;James G. Uber.
Journal of Water Resources Planning and Management (2006)
Strengthening integrality gaps for capacitated network design and covering problems
Robert D. Carr;Lisa K. Fleischer;Vitus J. Leung;Cynthia A. Phillips.
symposium on discrete algorithms (2000)
The network inhibition problem
Cynthia A. Phillips.
symposium on the theory of computing (1993)
Optimal time-critical scheduling via resource augmentation (extended abstract)
Cynthia A. Phillips;Cliff Stein;Eric Torng;Joel Wein.
symposium on the theory of computing (1997)
Minimizing average completion time in the presence of release dates
Cynthia A. Phillips;Clifford Stein;Joel Wein.
Mathematical Programming (1998)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: