iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/18/1807.rss
dblp: Cynthia A. Phillips https://dblp.org/pid/18/1807.html dblp person page RSS feed Thu, 24 Oct 2024 20:29:09 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Cynthia A. Phillipshttps://dblp.org/pid/18/1807.html14451 Shortest path network interdiction with asymmetric uncertainty.https://doi.org/10.1002/net.22208, , , , :
Shortest path network interdiction with asymmetric uncertainty. Networks 83(3): 605-623 ()]]>https://dblp.org/rec/journals/networks/PunlaGreenMGHP24Mon, 01 Apr 2024 01:00:00 +0200 Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs.https://doi.org/10.1016/j.disopt.2022.100746, , :
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. Discret. Optim. 47: 100746 ()]]>https://dblp.org/rec/journals/disopt/CarrHP23Wed, 01 Feb 2023 00:00:00 +0100 Partitioning Communication Streams Into Graph Snapshots.https://doi.org/10.1109/TNSE.2022.3223614, , , , , , :
Partitioning Communication Streams Into Graph Snapshots. IEEE Trans. Netw. Sci. Eng. 10(2): 809-826 ()]]>https://dblp.org/rec/journals/tnse/WendtFPPWSB23Wed, 01 Mar 2023 00:00:00 +0100 Using advanced data structures to enable responsive security monitoring.https://doi.org/10.1007/s10586-021-03463-5, , , , , , , , :
Using advanced data structures to enable responsive security monitoring. Clust. Comput. 25(4): 2893-2914 ()]]>https://dblp.org/rec/journals/cluster/VorobyevaDBFPP022Sat, 01 Jan 2022 00:00:00 +0100 Automatic HBM Management: Models and Algorithms.https://doi.org/10.1145/3490148.3538570, , , , , , , :
Automatic HBM Management: Models and Algorithms. SPAA : 147-159]]>https://dblp.org/rec/conf/spaa/DeLayoZABBDMP22Sat, 01 Jan 2022 00:00:00 +0100 Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022.https://doi.org/10.1137/1.9781611977042, :
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022. SIAM , ISBN 978-1-61197-704-2 [contents]]]>https://dblp.org/rec/conf/alenex/2022Sat, 01 Jan 2022 00:00:00 +0100 Timely Reporting of Heavy Hitters Using External Memory.https://doi.org/10.1145/3472392, , , , , , , :
Timely Reporting of Heavy Hitters Using External Memory. ACM Trans. Database Syst. 46(4): 14:1-14:35 ()]]>https://dblp.org/rec/journals/tods/SinghPBBFJKP21Fri, 01 Jan 2021 00:00:00 +0100 Provable Advantages for Graph Algorithms in Spiking Neural Networks.https://doi.org/10.1145/3409964.3461813, , , , , , :
Provable Advantages for Graph Algorithms in Spiking Neural Networks. SPAA : 35-47]]>https://dblp.org/rec/conf/spaa/AimoneHPPPSW21Fri, 01 Jan 2021 00:00:00 +0100 Connected Components for Infinite Graph Streams: Theory and Practice.https://arxiv.org/abs/2112.00098, , :
Connected Components for Infinite Graph Streams: Theory and Practice. CoRR abs/2112.00098 ()]]>https://dblp.org/rec/journals/corr/abs-2112-00098Fri, 01 Jan 2021 00:00:00 +0100 Timely Reporting of Heavy Hitters using External Memory.https://doi.org/10.1145/3318464.3380598, , , , , , , :
Timely Reporting of Heavy Hitters using External Memory. SIGMOD Conference : 1431-1446]]>https://dblp.org/rec/conf/sigmod/Pandey0BBFJKP20Wed, 01 Jan 2020 00:00:00 +0100 How to Manage High-Bandwidth Memory Automatically.https://doi.org/10.1145/3350755.3400233, , , , , :
How to Manage High-Bandwidth Memory Automatically. SPAA : 187-199]]>https://dblp.org/rec/conf/spaa/DasABBMP20Wed, 01 Jan 2020 00:00:00 +0100 Provable Neuromorphic Advantages for Computing Shortest Paths.https://doi.org/10.1145/3350755.3400258, , , , , , :
Provable Neuromorphic Advantages for Computing Shortest Paths. SPAA : 497-499]]>https://dblp.org/rec/conf/spaa/AimoneHPPPSW20Wed, 01 Jan 2020 00:00:00 +0100 Probing a Set of Trajectories to Maximize Captured Information.https://doi.org/10.4230/LIPIcs.SEA.2020.5, , , , , , :
Probing a Set of Trajectories to Maximize Captured Information. SEA : 5:1-5:14]]>https://dblp.org/rec/conf/wea/FeketeHKMMPP20Wed, 01 Jan 2020 00:00:00 +0100 Probing a Set of Trajectories to Maximize Captured Information.https://arxiv.org/abs/2004.03486, , , , , , :
Probing a Set of Trajectories to Maximize Captured Information. CoRR abs/2004.03486 ()]]>https://dblp.org/rec/journals/corr/abs-2004-03486Wed, 01 Jan 2020 00:00:00 +0100 Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs.https://arxiv.org/abs/2006.06957, , :
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs. CoRR abs/2006.06957 ()]]>https://dblp.org/rec/journals/corr/abs-2006-06957Wed, 01 Jan 2020 00:00:00 +0100 Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication.https://arxiv.org/abs/2006.14652, , , :
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication. CoRR abs/2006.14652 ()]]>https://dblp.org/rec/journals/corr/abs-2006-14652Wed, 01 Jan 2020 00:00:00 +0100 Making social networks more human: A topological approach.https://doi.org/10.1002/sam.11420, , :
Making social networks more human: A topological approach. Stat. Anal. Data Min. 12(6): 449-464 ()]]>https://dblp.org/rec/journals/sadm/BerryPS19Tue, 01 Jan 2019 00:00:00 +0100 Virtually the Same: Comparing Physical and Virtual Testbeds.https://doi.org/10.1109/ICCNC.2019.8685630, , , :
Virtually the Same: Comparing Physical and Virtual Testbeds. ICNC : 847-853]]>https://dblp.org/rec/conf/iccnc/CrussellKBP19Tue, 01 Jan 2019 00:00:00 +0100 Dynamic Programming with Spiking Neural Computing.https://doi.org/10.1145/3354265.3354285, , , , , :
Dynamic Programming with Spiking Neural Computing. ICONS : 20:1-20:9]]>https://dblp.org/rec/conf/icons2/AimonePPPSX19Tue, 01 Jan 2019 00:00:00 +0100 PDSEC-19 Keynote.https://doi.org/10.1109/IPDPSW.2019.00114:
PDSEC-19 Keynote. IPDPS Workshops : 675]]>https://dblp.org/rec/conf/ipps/Phillips19Tue, 01 Jan 2019 00:00:00 +0100 Enabling Onboard Detection of Events of Scientific Interest for the Europa Clipper Spacecraft.https://doi.org/10.1145/3292500.3330656, , , , , , , :
Enabling Onboard Detection of Events of Scientific Interest for the Europa Clipper Spacecraft. KDD : 2191-2201]]>https://dblp.org/rec/conf/kdd/WagstaffDDACCDP19Tue, 01 Jan 2019 00:00:00 +0100 Scalable generation of graphs for benchmarking HPC community-detection algorithms.https://doi.org/10.1145/3295500.3356206, , , , , :
Scalable generation of graphs for benchmarking HPC community-detection algorithms. SC : 73:1-73:14]]>https://dblp.org/rec/conf/sc/SlotaBHOPR19Tue, 01 Jan 2019 00:00:00 +0100 Lessons Learned from 10k Experiments to Compare Virtual and Physical Testbeds.https://www.usenix.org/conference/cset19/presentation/crussell, , , , :
Lessons Learned from 10k Experiments to Compare Virtual and Physical Testbeds. CSET @ USENIX Security Symposium ]]>https://dblp.org/rec/conf/uss/CrussellKKBP19Tue, 01 Jan 2019 00:00:00 +0100 Virtually the Same: Comparing Physical and Virtual Testbeds.http://arxiv.org/abs/1902.01937, , , :
Virtually the Same: Comparing Physical and Virtual Testbeds. CoRR abs/1902.01937 ()]]>https://dblp.org/rec/journals/corr/abs-1902-01937Tue, 01 Jan 2019 00:00:00 +0100 Geometric Hitting Set for Segments of Few Orientations.https://doi.org/10.1007/s00224-016-9744-7, , , , :
Geometric Hitting Set for Segments of Few Orientations. Theory Comput. Syst. 62(2): 268-303 ()]]>https://dblp.org/rec/journals/mst/FeketeHMPP18Mon, 01 Jan 2018 00:00:00 +0100 Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks.https://doi.org/10.1109/TMC.2017.2706689, , , , , :
Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks. IEEE Trans. Mob. Comput. 17(2): 404-418 ()]]>https://dblp.org/rec/journals/tmc/GjanciPBPBT18Mon, 01 Jan 2018 00:00:00 +0100 Statistical Models of Dengue Fever.https://doi.org/10.1007/978-981-13-6661-1_14, , , , , :
Statistical Models of Dengue Fever. AusDM : 175-186]]>https://dblp.org/rec/conf/ausdm/LinkRLBPS18Mon, 01 Jan 2018 00:00:00 +0100 Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication.https://doi.org/10.1145/3210377.3210410, , , :
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication. SPAA : 67-76]]>https://dblp.org/rec/conf/spaa/ParekhPJA18Mon, 01 Jan 2018 00:00:00 +0100 The Online Event-Detection Problem.http://arxiv.org/abs/1812.09824, , , , , , , :
The Online Event-Detection Problem. CoRR abs/1812.09824 ()]]>https://dblp.org/rec/journals/corr/abs-1812-09824Mon, 01 Jan 2018 00:00:00 +0100 Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation.https://doi.org/10.1016/j.jpdc.2016.12.009, , , , , , , , , :
Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation. J. Parallel Distributed Comput. 102: 213-228 ()]]>https://dblp.org/rec/journals/jpdc/BenderBHHMMMPRR17Sun, 01 Jan 2017 00:00:00 +0100 Write-Optimized Skip Lists.https://doi.org/10.1145/3034786.3056117, , , , , , :
Write-Optimized Skip Lists. PODS : 69-78]]>https://dblp.org/rec/conf/pods/BenderFJMMPX17Sun, 01 Jan 2017 00:00:00 +0100 Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries.https://doi.org/10.1145/2902251.2902276, , , , , , , , :
Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries. PODS : 289-302]]>https://dblp.org/rec/conf/pods/BenderBJKMPSSZ16Fri, 01 Jan 2016 00:00:00 +0100 Geometric Hitting Set for Segments of Few Orientations.http://arxiv.org/abs/1603.06077, , , , :
Geometric Hitting Set for Segments of Few Orientations. CoRR abs/1603.06077 ()]]>https://dblp.org/rec/journals/corr/FeketeHMPP16Fri, 01 Jan 2016 00:00:00 +0100 Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?https://doi.org/10.1080/15427951.2015.1037030, , , , , :
Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? Internet Math. 11(6): 555-571 ()]]>https://dblp.org/rec/journals/im/BerryFNPSW15Thu, 01 Jan 2015 00:00:00 +0100 PEBBL: an object-oriented framework for scalable parallel branch and bound.https://doi.org/10.1007/s12532-015-0087-1, , :
PEBBL: an object-oriented framework for scalable parallel branch and bound. Math. Program. Comput. 7(4): 429-469 ()]]>https://dblp.org/rec/journals/mpc/EcksteinHP15Thu, 01 Jan 2015 00:00:00 +0100 New challenges in scheduling theory.https://doi.org/10.1051/ro/2014047, , , , :
New challenges in scheduling theory. RAIRO Oper. Res. 49(2): 335-337 ()]]>https://dblp.org/rec/journals/rairo/BlazewiczPPTZ15Thu, 01 Jan 2015 00:00:00 +0100 Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs.https://doi.org/10.1002/sam.11294, , , , , :
Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs. Stat. Anal. Data Min. 8(5-6): 340-352 ()]]>https://dblp.org/rec/journals/sadm/StracuzziBPRWW15Thu, 01 Jan 2015 00:00:00 +0100 Cooperative Computing for Autonomous Data Centers.https://doi.org/10.1109/IPDPS.2015.109, , , , , :
Cooperative Computing for Autonomous Data Centers. IPDPS : 38-47]]>https://dblp.org/rec/conf/ipps/Berry0KPSS15Thu, 01 Jan 2015 00:00:00 +0100 Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation.https://doi.org/10.1109/IPDPS.2015.94, , , , , , , , , :
Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation. IPDPS : 835-846]]>https://dblp.org/rec/conf/ipps/BenderBHHMMMPRR15Thu, 01 Jan 2015 00:00:00 +0100 k-Means Clustering on Two-Level Memory Systems.https://doi.org/10.1145/2818950.2818977, , , , , :
k-Means Clustering on Two-Level Memory Systems. MEMSYS : 197-205]]>https://dblp.org/rec/conf/memsys/BenderBHMMP15Thu, 01 Jan 2015 00:00:00 +0100 Geometric Hitting Set for Segments of Few Orientations.https://doi.org/10.1007/978-3-319-28684-6_13, , , , :
Geometric Hitting Set for Segments of Few Orientations. WAOA : 145-157]]>https://dblp.org/rec/conf/waoa/FeketeHMPP15Thu, 01 Jan 2015 00:00:00 +0100 Sensor Mission Assignment in Rechargeable Wireless Sensor Networks.https://doi.org/10.1145/2594791, , , :
Sensor Mission Assignment in Rechargeable Wireless Sensor Networks. ACM Trans. Sens. Networks 10(4): 60:1-60:39 ()]]>https://dblp.org/rec/journals/tosn/PortaPPS14Wed, 01 Jan 2014 00:00:00 +0100 Maximizing the value of sensed information in underwater wireless sensor networks via an autonomous underwater vehicle.https://doi.org/10.1109/INFOCOM.2014.6848028, , , , , :
Maximizing the value of sensed information in underwater wireless sensor networks via an autonomous underwater vehicle. INFOCOM : 988-996]]>https://dblp.org/rec/conf/infocom/BasagniBGPPT14Wed, 01 Jan 2014 00:00:00 +0100 Why do simple algorithms for triangle enumeration work in the real world?https://doi.org/10.1145/2554797.2554819, , , , , :
Why do simple algorithms for triangle enumeration work in the real world? ITCS : 225-234]]>https://dblp.org/rec/conf/innovations/BerryFNPSW14Wed, 01 Jan 2014 00:00:00 +0100 Why do simple algorithms for triangle enumeration work in the real world?http://arxiv.org/abs/1407.1116, , , , , :
Why do simple algorithms for triangle enumeration work in the real world? CoRR abs/1407.1116 ()]]>https://dblp.org/rec/journals/corr/BerryFNPSW14Wed, 01 Jan 2014 00:00:00 +0100 k-Edge Failure Resilient Network Design.https://doi.org/10.1016/j.endm.2013.05.115, :
k-Edge Failure Resilient Network Design. Electron. Notes Discret. Math. 41: 375-382 ()]]>https://dblp.org/rec/journals/endm/ChenP13Tue, 01 Jan 2013 00:00:00 +0100 Best papers, IPDPS 2010.https://doi.org/10.1016/j.jpdc.2013.05.002:
Best papers, IPDPS 2010. J. Parallel Distributed Comput. 73(7): 897 ()]]>https://dblp.org/rec/journals/jpdc/Phillips13Tue, 01 Jan 2013 00:00:00 +0100 Maintaining connected components for infinite graph streams.https://doi.org/10.1145/2501221.2501234, , , , :
Maintaining connected components for infinite graph streams. BigMine : 95-102]]>https://dblp.org/rec/conf/kdd/BerryOPPS13Tue, 01 Jan 2013 00:00:00 +0100 Efficient scheduling to minimize calibrations.https://doi.org/10.1145/2486159.2486193, , , , :
Efficient scheduling to minimize calibrations. SPAA : 280-287]]>https://dblp.org/rec/conf/spaa/BenderBLMP13Tue, 01 Jan 2013 00:00:00 +0100 Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks.https://doi.org/10.1007/s00453-010-9422-0, , , :
Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks. Algorithmica 61(3): 518-554 ()]]>https://dblp.org/rec/journals/algorithmica/KingPSY11Sat, 01 Jan 2011 00:00:00 +0100 Coordinated and controlled mobility of multiple sinks for maximizing the lifetime of wireless sensor networks.https://doi.org/10.1007/s11276-010-0313-8, , , :
Coordinated and controlled mobility of multiple sinks for maximizing the lifetime of wireless sensor networks. Wirel. Networks 17(3): 759-778 ()]]>https://dblp.org/rec/journals/winet/BasagniCPP11Sat, 01 Jan 2011 00:00:00 +0100 Challenges in streaming graph analysis.https://doi.org/10.1109/MILCOM.2011.6127489, , , :
Challenges in streaming graph analysis. MILCOM : 1338]]>https://dblp.org/rec/conf/milcom/BerryOPP11Sat, 01 Jan 2011 00:00:00 +0100 Message from the program chair.https://doi.org/10.1109/IPDPS.2010.5470382:
Message from the program chair. IPDPS : 1-2]]>https://dblp.org/rec/conf/ipps/Phillips10Fri, 01 Jan 2010 00:00:00 +0100 SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010.https://doi.org/10.1145/1810479, :
SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010. ACM , ISBN 978-1-4503-0079-7 [contents]]]>https://dblp.org/rec/conf/spaa/2010Fri, 01 Jan 2010 00:00:00 +0100 US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water.https://doi.org/10.1287/inte.1080.0415, , , , , , , , , , , , , , :
US Environmental Protection Agency Uses Operations Research to Reduce Contamination Risks in Drinking Water. Interfaces 39(1): 57-68 ()]]>https://dblp.org/rec/journals/interfaces/MurrayHPBBCRWHHJGTUM09Thu, 01 Jan 2009 00:00:00 +0100 Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory.https://doi.org/10.1145/1583991.1584039, , , , , , , :
Brief announcement: the impact of classical electronics constraints on a solid-state logical qubit memory. SPAA : 166-168]]>https://dblp.org/rec/conf/spaa/LevyGPHLGCC09Thu, 01 Jan 2009 00:00:00 +0100 Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.https://doi.org/10.1007/s00453-007-9037-2, , , , , , :
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. Algorithmica 50(2): 279-298 ()]]>https://dblp.org/rec/journals/algorithmica/BenderBDFLMP08Tue, 01 Jan 2008 00:00:00 +0100 Moving multiple sinks through wireless sensor networks for lifetime maximization.https://doi.org/10.1109/MAHSS.2008.4660067, , , :
Moving multiple sinks through wireless sensor networks for lifetime maximization. MASS : 523-526]]>https://dblp.org/rec/conf/mass/BasagniCPP08Tue, 01 Jan 2008 00:00:00 +0100 Sleeping on the job: energy-efficient and robust broadcast for radio networks.https://doi.org/10.1145/1400751.1400784, , , :
Sleeping on the job: energy-efficient and robust broadcast for radio networks. PODC : 243-252]]>https://dblp.org/rec/conf/podc/KingPSY08Tue, 01 Jan 2008 00:00:00 +0100 Editors Foreword to the Special Issue on Principles of Mobile Communications and Computing.https://doi.org/10.1007/s00453-007-9031-8, :
Editors Foreword to the Special Issue on Principles of Mobile Communications and Computing. Algorithmica 49(4): 259-263 ()]]>https://dblp.org/rec/journals/algorithmica/BasagniP07Mon, 01 Jan 2007 00:00:00 +0100 EXACT: the experimental algorithmics computational toolkit.https://doi.org/10.1145/1281700.1281714, , , :
EXACT: the experimental algorithmics computational toolkit. Experimental Computer Science : 14]]>https://dblp.org/rec/conf/expcs/HartBHP07Mon, 01 Jan 2007 00:00:00 +0100 Limited-Memory Techniques for Sensor Placement in Water Distribution Networks.https://doi.org/10.1007/978-3-540-92695-5_10, , , , , :
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks. LION : 125-137]]>https://dblp.org/rec/conf/lion/HartBBPRW07Mon, 01 Jan 2007 00:00:00 +0100 Scheduling DAGs on asynchronous processors.https://doi.org/10.1145/1248377.1248384, :
Scheduling DAGs on asynchronous processors. SPAA : 35-45]]>https://dblp.org/rec/conf/spaa/BenderP07Mon, 01 Jan 2007 00:00:00 +0100 Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks.http://arxiv.org/abs/0710.2532, , , :
Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks. CoRR abs/0710.2532 ()]]>https://dblp.org/rec/journals/corr/abs-0710-2532Mon, 01 Jan 2007 00:00:00 +0100 Robust optimization of contaminant sensor placement for community water systems.https://doi.org/10.1007/s10107-005-0689-x, , , , , , , :
Robust optimization of contaminant sensor placement for community water systems. Math. Program. 107(1-2): 337-356 ()]]>https://dblp.org/rec/journals/mp/CarrGHKLLMP06Sun, 01 Jan 2006 00:00:00 +0100 Massively Parallel Mixed-Integer Programming: Algorithms and Applications.https://doi.org/10.1137/1.9780898718133.ch17, , :
Massively Parallel Mixed-Integer Programming: Algorithms and Applications. Parallel Processing for Scientific Computing : 323-340]]>https://dblp.org/rec/books/siam/06/PhillipsEH06Sun, 01 Jan 2006 00:00:00 +0100 Communication-Aware Processor Allocation for Supercomputers.https://doi.org/10.1007/11534273_16, , , , , , :
Communication-Aware Processor Allocation for Supercomputers. WADS : 169-181]]>https://dblp.org/rec/conf/wads/BenderBDFLMP05Sat, 01 Jan 2005 00:00:00 +0100 Scheduling an Industrial Production Facility.https://doi.org/10.1007/978-3-540-25960-2_9, , , , , :
Scheduling an Industrial Production Facility. IPCO : 116-131]]>https://dblp.org/rec/conf/ipco/AsgeirssonBPPSW04Thu, 01 Jan 2004 00:00:00 +0100 Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, October 1, 2004.https://dblp.org/pid/18/1807.html, :
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, October 1, 2004. ACM , ISBN 1-58113-921-7 [contents]]]>https://dblp.org/rec/conf/dialm/2004Thu, 01 Jan 2004 00:00:00 +0100 Communication-Aware Processor Allocation for Supercomputers.http://arxiv.org/abs/cs.DS/0407058, , , , , , :
Communication-Aware Processor Allocation for Supercomputers. CoRR cs.DS/0407058 ()]]>https://dblp.org/rec/journals/corr/cs-DS-0407058Thu, 01 Jan 2004 00:00:00 +0100 Optimal Time-Critical Scheduling via Resource Augmentation.https://doi.org/10.1007/s00453-001-0068-9, , , :
Optimal Time-Critical Scheduling via Resource Augmentation. Algorithmica 32(2): 163-200 ()]]>https://dblp.org/rec/journals/algorithmica/PhillipsSTW02Tue, 01 Jan 2002 00:00:00 +0100 Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms.https://doi.org/10.1023/A:1020238115592, , , :
Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms. J. Intell. Robotic Syst. 35(1): 111-122 ()]]>https://dblp.org/rec/journals/jirs/KwokDPT02Tue, 01 Jan 2002 00:00:00 +0100 Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.https://doi.org/10.1109/CLUSTR.2002.1137758, , , , , , , , :
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies. CLUSTER : 296-304]]>https://dblp.org/rec/conf/cluster/LeungABBJLMPS02Tue, 01 Jan 2002 00:00:00 +0100 Strengthening integrality gaps for capacitated network design and covering problems.http://dl.acm.org/citation.cfm?id=338219.338241, , , :
Strengthening integrality gaps for capacitated network design and covering problems. SODA : 106-115]]>https://dblp.org/rec/conf/soda/CarrFLP00Sat, 01 Jan 2000 00:00:00 +0100 Off-line admission control for general scheduling problems.http://dl.acm.org/citation.cfm?id=338219.338654, , :
Off-line admission control for general scheduling problems. SODA : 879-888]]>https://dblp.org/rec/conf/soda/PhillipsUW00Sat, 01 Jan 2000 00:00:00 +0100 Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem.https://doi.org/10.1007/PL00008280, , :
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. Algorithmica 25(2-3): 311-329 ()]]>https://dblp.org/rec/journals/algorithmica/CryanGP99Fri, 01 Jan 1999 00:00:00 +0100 Constructing Evolutionary Trees in the Presence of Polymorphic Characters.https://doi.org/10.1137/S0097539796324636, , , :
Constructing Evolutionary Trees in the Presence of Polymorphic Characters. SIAM J. Comput. 29(1): 103-131 ()]]>https://dblp.org/rec/journals/siamcomp/BonetPWY99Fri, 01 Jan 1999 00:00:00 +0100 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.https://doi.org/10.1016/S0167-4048(98)80312-X, , , , , , :
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. Comput. Secur. 17(3): 211-221 ()]]>https://dblp.org/rec/journals/compsec/CohenPSGLRI98Thu, 01 Jan 1998 00:00:00 +0100 Constructing Computer Virus Phylogenies.https://doi.org/10.1006/jagm.1997.0897, , , :
Constructing Computer Virus Phylogenies. J. Algorithms 26(1): 188-208 ()]]>https://dblp.org/rec/journals/jal/GoldbergGPS98Thu, 01 Jan 1998 00:00:00 +0100 Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.https://doi.org/10.1023/A:1009750913529, , , , :
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. J. Comb. Optim. 1(4): 413-426 ()]]>https://dblp.org/rec/journals/jco/PhillipsSSSW98Thu, 01 Jan 1998 00:00:00 +0100 Minimizing average completion time in the presence of release dates.https://doi.org/10.1007/BF01585872, , :
Minimizing average completion time in the presence of release dates. Math. Program. 82: 199-223 ()]]>https://dblp.org/rec/journals/mp/PhillipsSW98Thu, 01 Jan 1998 00:00:00 +0100 A Graph-based System for Network-vulnerability Analysis.https://doi.org/10.1145/310889.310919, :
A Graph-based System for Network-vulnerability Analysis. Workshop on New Security Paradigms : 71-79]]>https://dblp.org/rec/conf/nspw/PhillipsS98Thu, 01 Jan 1998 00:00:00 +0100 Task Scheduling in Networks.https://doi.org/10.1137/S0895480194279057, , :
Task Scheduling in Networks. SIAM J. Discret. Math. 10(4): 573-598 ()]]>https://dblp.org/rec/journals/siamdm/PhillipsSW97Wed, 01 Jan 1997 00:00:00 +0100 Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem.https://doi.org/10.1007/3-540-63220-4_56, , :
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem. CPM : 130-149]]>https://dblp.org/rec/conf/cpm/CryanGP97Wed, 01 Jan 1997 00:00:00 +0100 Beyond islands (extended abstract): runs in clone-probe matrices.https://doi.org/10.1145/267521.267891, , :
Beyond islands (extended abstract): runs in clone-probe matrices. RECOMB : 320-329]]>https://dblp.org/rec/conf/recomb/WilsonGP97Wed, 01 Jan 1997 00:00:00 +0100 Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract).https://doi.org/10.1145/258533.258570, , , :
Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract). STOC : 140-149]]>https://dblp.org/rec/conf/stoc/PhillipsSTW97Wed, 01 Jan 1997 00:00:00 +0100 Minimizing Phylogenetic Number To Find Good Evolutionary Trees.https://doi.org/10.1016/S0166-218X(96)00060-1, , , , :
Minimizing Phylogenetic Number To Find Good Evolutionary Trees. Discret. Appl. Math. 71(1-3): 111-136 ()]]>https://dblp.org/rec/journals/dam/GoldbergGPSW96Mon, 01 Jan 1996 00:00:00 +0100 The Asymmetric Median Tree - A New Model for Building Consensus Trees.https://doi.org/10.1016/S0166-218X(96)00071-6, :
The Asymmetric Median Tree - A New Model for Building Consensus Trees. Discret. Appl. Math. 71(1-3): 311-335 ()]]>https://dblp.org/rec/journals/dam/PhillipsW96Mon, 01 Jan 1996 00:00:00 +0100 The Asymmetric Median Tree - A New model for Building Consensus Trees.https://doi.org/10.1007/3-540-61258-0_18, :
The Asymmetric Median Tree - A New model for Building Consensus Trees. CPM : 234-252]]>https://dblp.org/rec/conf/cpm/PhillipsW96Mon, 01 Jan 1996 00:00:00 +0100 Constructing Computer Virus Phylogenies.https://doi.org/10.1007/3-540-61258-0_19, , , :
Constructing Computer Virus Phylogenies. CPM : 253-270]]>https://dblp.org/rec/conf/cpm/GoldbergGPS96Mon, 01 Jan 1996 00:00:00 +0100 Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages.https://doi.org/10.1090/dimacs/037/03, , , :
Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages. Mathematical Hierarchies and Biology : 43-56]]>https://dblp.org/rec/conf/dimacs/BonetPWY96Mon, 01 Jan 1996 00:00:00 +0100 Improved Scheduling Algorithms for Minsum Criteria.https://doi.org/10.1007/3-540-61440-0_166, , , , , :
Improved Scheduling Algorithms for Minsum Criteria. ICALP : 646-657]]>https://dblp.org/rec/conf/icalp/ChakrabartiPSSSW96Mon, 01 Jan 1996 00:00:00 +0100 Constructing Evolutionary Trees in the Presence of Polymorphic Characters.https://doi.org/10.1145/237814.237867, , , :
Constructing Evolutionary Trees in the Presence of Polymorphic Characters. STOC : 220-229]]>https://dblp.org/rec/conf/stoc/BonetPWY96Mon, 01 Jan 1996 00:00:00 +0100 Minimizing Phylogenetic Number to find Good Evolutionary Trees.https://doi.org/10.1007/3-540-60044-2_38, , , , :
Minimizing Phylogenetic Number to find Good Evolutionary Trees. CPM : 102-127]]>https://dblp.org/rec/conf/cpm/GoldbergGPSW95Sun, 01 Jan 1995 00:00:00 +0100 Scheduling Jobs that Arrive Over Time (Extended Abstract).https://doi.org/10.1007/3-540-60220-8_53, , :
Scheduling Jobs that Arrive Over Time (Extended Abstract). WADS : 86-97]]>https://dblp.org/rec/conf/wads/PhillipsSW95Sun, 01 Jan 1995 00:00:00 +0100 Task Scheduling in Networks (Extended Abstract).https://doi.org/10.1007/3-540-58218-5_27, , :
Task Scheduling in Networks (Extended Abstract). SWAT : 290-301]]>https://dblp.org/rec/conf/swat/PhillipsSW94Sat, 01 Jan 1994 00:00:00 +0100 Finding minimum-quotient cuts in planar graphs.https://doi.org/10.1145/167088.167284, :
Finding minimum-quotient cuts in planar graphs. STOC : 766-775]]>https://dblp.org/rec/conf/stoc/ParkP93Fri, 01 Jan 1993 00:00:00 +0100 The network inhibition problem.https://doi.org/10.1145/167088.167286:
The network inhibition problem. STOC : 776-785]]>https://dblp.org/rec/conf/stoc/Phillips93Fri, 01 Jan 1993 00:00:00 +0100