Cynthia A. Phillips

According to our database1, Cynthia A. Phillips authored at least 59 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Virtually the Same: Comparing Physical and Virtual Testbeds.
Proceedings of the International Conference on Computing, Networking and Communications, 2019

2018
Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks.
IEEE Trans. Mob. Comput., 2018

Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Statistical Models of Dengue Fever.
Proceedings of the Data Mining - 16th Australasian Conference, AusDM 2018, Bahrurst, NSW, 2018

2017
Write-Optimized Skip Lists.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

2016
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs.
Statistical Analysis and Data Mining, 2015

New challenges in scheduling theory.
RAIRO - Operations Research, 2015

PEBBL: an object-oriented framework for scalable parallel branch and bound.
Math. Program. Comput., 2015

Geometric Hitting Set for Segments of Few Orientations.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

k-Means Clustering on Two-Level Memory Systems.
Proceedings of the 2015 International Symposium on Memory Systems, 2015

Cooperative Computing for Autonomous Data Centers.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

2014
Sensor Mission Assignment in Rechargeable Wireless Sensor Networks.
TOSN, 2014

Why do simple algorithms for triangle enumeration work in the real world?
Proceedings of the Innovations in Theoretical Computer Science, 2014

Maximizing the value of sensed information in underwater wireless sensor networks via an autonomous underwater vehicle.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013
Best papers, IPDPS 2010.
J. Parallel Distrib. Comput., 2013

k-Edge Failure Resilient Network Design.
Electronic Notes in Discrete Mathematics, 2013

Efficient scheduling to minimize calibrations.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Maintaining connected components for infinite graph streams.
Proceedings of the 2nd International Workshop on Big Data, 2013

2011
Coordinated and controlled mobility of multiple sinks for maximizing the lifetime of wireless sensor networks.
Wireless Networks, 2011

Challenges in streaming graph analysis.
Proceedings of the MILCOM 2011, 2011

2010
Message from the program chair.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water.
Interfaces, 2009

Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.
Algorithmica, 2008

Sleeping on the job: energy-efficient and robust broadcast for radio networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Moving multiple sinks through wireless sensor networks for lifetime maximization.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

2007
Editors Foreword to the Special Issue on Principles of Mobile Communications and Computing.
Algorithmica, 2007

Scheduling DAGs on asynchronous processors.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Limited-Memory Techniques for Sensor Placement in Water Distribution Networks.
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

EXACT: the experimental algorithmics computational toolkit.
Proceedings of the Workshop on Experimental Computer Science, 2007

2006
Robust optimization of contaminant sensor placement for community water systems.
Math. Program., 2006

Massively Parallel Mixed-Integer Programming: Algorithms and Applications.
Proceedings of the Parallel Processing for Scientific Computing, 2006

2005
Communication-Aware Processor Allocation for Supercomputers.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004
Scheduling an Industrial Production Facility.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2002
Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms.
Journal of Intelligent and Robotic Systems, 2002

Optimal Time-Critical Scheduling via Resource Augmentation.
Algorithmica, 2002

Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002

2000
Off-line admission control for general scheduling problems.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Strengthening integrality gaps for capacitated network design and covering problems.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1998
Minimizing average completion time in the presence of release dates.
Math. Program., 1998

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.
J. Comb. Optim., 1998

A cause and effect model of attacks on information systems : Some Analysis Based on That Model, and The Application of that Model for CyberWarfare in CID.
Computers & Security, 1998

A Graph-based System for Network-vulnerability Analysis.
Proceedings of the 1998 Workshop on New Security Paradigms, 1998

1997
Task Scheduling in Networks.
SIAM J. Discrete Math., 1997

Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Beyond islands (extended abstract): runs in clone-probe matrices.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996
Constructing Evolutionary Trees in the Presence of Polymorphic Characters.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Improved Scheduling Algorithms for Minsum Criteria.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages.
Proceedings of the Mathematical Hierarchies and Biology, 1996

The Asymmetric Median Tree - A New model for Building Consensus Trees.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

Constructing Computer Virus Phylogenies.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
Scheduling Jobs that Arrive Over Time (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Minimizing Phylogenetic Number to find Good Evolutionary Trees.
CPM, 1995

1994
Task Scheduling in Networks (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

1993
The network inhibition problem.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Finding minimum-quotient cuts in planar graphs.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993


  Loading...