default search action
BibTeX records: Clifford Stein 0001
@article{DBLP:journals/mst/BalkanskiOSW25,
author = {Eric Balkanski and
Tingting Ou and
Clifford Stein and
Hao{-}Ting Wei},
title = {Scheduling with Speed Predictions},
journal = {Theory Comput. Syst.},
volume = {69},
number = {1},
pages = {16},
year = {2025},
url = {https://doi.org/10.1007/s00224-024-10200-z},
doi = {10.1007/S00224-024-10200-Z},
timestamp = {Mon, 07 Apr 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BalkanskiOSW25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/LipeKSETT25,
author = {Ellie Lipe and
Neel Karia and
Clifford Stein and
Connor Espenshade and
Olivier Tardieu and
Asser N. Tantawi},
title = {Energy Efficient Scheduling of {AI/ML} Workloads on Multi-Instance
GPUs with Dynamic Repartitioning},
booktitle = {2025 {IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2025 - Workshops, Milano, Italy, June 3-7, 2025},
pages = {1266--1268},
publisher = {{IEEE}},
year = {2025},
url = {https://doi.org/10.1109/IPDPSW66978.2025.00207},
doi = {10.1109/IPDPSW66978.2025.00207},
timestamp = {Mon, 08 Sep 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipps/LipeKSETT25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/MaM025,
author = {Will Ma and
Calum MacRury and
Cliff Stein},
editor = {Itai Ashlagi and
Aaron Roth},
title = {Forward-backward Contention Resolution Schemes for Fair Rationing},
booktitle = {Proceedings of the 26th {ACM} Conference on Economics and Computation,
{EC} 2025, Stanford University, Stanford, CA, USA, July 7-10, 2025},
pages = {945},
publisher = {{ACM}},
year = {2025},
url = {https://doi.org/10.1145/3736252.3742654},
doi = {10.1145/3736252.3742654},
timestamp = {Sat, 09 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/MaM025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/EfronP025,
author = {Yuval Efron and
Shyamal Patel and
Cliff Stein},
editor = {Ioana Oriana Bercea and
Rasmus Pagh},
title = {A Simple Algorithm for Dynamic Carpooling with Recourse},
booktitle = {2025 Symposium on Simplicity in Algorithms, {SOSA} 2025, New Orleans,
LA, USA, January 13-15, 2025},
pages = {196--201},
publisher = {{SIAM}},
year = {2025},
url = {https://doi.org/10.1137/1.9781611978315.15},
doi = {10.1137/1.9781611978315.15},
timestamp = {Mon, 10 Mar 2025 16:06:30 +0100},
biburl = {https://dblp.org/rec/conf/sosa/EfronP025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/0001BPM025,
author = {Kunal Agrawal and
Michael A. Bender and
Kirk Pruhs and
Benjamin Moseley and
Clifford Stein},
title = {Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full
paper only)},
booktitle = {Proceedings of the 37th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2025, Portland, OR, USA, 28 July 2025 -
1 August 2025},
pages = {171--180},
publisher = {{ACM}},
year = {2025},
url = {https://doi.org/10.1145/3694906.3743336},
doi = {10.1145/3694906.3743336},
timestamp = {Sat, 09 Aug 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/0001BPM025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2502-09521,
author = {Will Ma and
Calum MacRury and
Cliff Stein},
title = {Forward-backward Contention Resolution Schemes for Fair Rationing},
journal = {CoRR},
volume = {abs/2502.09521},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2502.09521},
doi = {10.48550/ARXIV.2502.09521},
eprinttype = {arXiv},
eprint = {2502.09521},
timestamp = {Wed, 12 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2502-09521.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2507-12822,
author = {Ya{-}Chun Liang and
Meng{-}Hsi Li and
Chung{-}Shou Liao and
Clifford Stein},
title = {Waiting is worth it and can be improved with predictions},
journal = {CoRR},
volume = {abs/2507.12822},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2507.12822},
doi = {10.48550/ARXIV.2507.12822},
eprinttype = {arXiv},
eprint = {2507.12822},
timestamp = {Mon, 01 Sep 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2507-12822.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MoseleyPSZ24,
author = {Benjamin Moseley and
Kirk Pruhs and
Clifford Stein and
Rudy Zhou},
title = {A competitive algorithm for throughput maximization on identical machines},
journal = {Math. Program.},
volume = {206},
number = {1},
pages = {497--514},
year = {2024},
url = {https://doi.org/10.1007/s10107-023-02045-0},
doi = {10.1007/S10107-023-02045-0},
timestamp = {Fri, 02 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MoseleyPSZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KrishnaswamyNPS24,
author = {Ravishankar Krishnaswamy and
Viswanath Nagarajan and
Kirk Pruhs and
Clifford Stein},
title = {Cluster Before You Hallucinate: Node-Capacitated Network Design and
Energy Efficient Routing},
journal = {{SIAM} J. Comput.},
volume = {53},
number = {3},
pages = {588--623},
year = {2024},
url = {https://doi.org/10.1137/20m1360645},
doi = {10.1137/20M1360645},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KrishnaswamyNPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/forc/ChuangH024,
author = {Gabriel Chuang and
Oussama Hanguir and
Clifford Stein},
editor = {Guy N. Rothblum},
title = {Drawing Competitive Districts in Redistricting},
booktitle = {5th Symposium on Foundations of Responsible Computing, {FORC} 2024,
June 12-14, 2024, Harvard University, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {295},
pages = {7:1--7:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.FORC.2024.7},
doi = {10.4230/LIPICS.FORC.2024.7},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/forc/ChuangH024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FaenzaSW24,
author = {Yuri Faenza and
Cliff Stein and
Jia Wan},
editor = {Jens Vygen and
Jaroslaw Byrka},
title = {Von Neumann-Morgenstern Stability and Internal Closedness in Matching
Theory},
booktitle = {Integer Programming and Combinatorial Optimization - 25th International
Conference, {IPCO} 2024, Wroc{\l}aw, Poland, July 3-5, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14679},
pages = {168--181},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-59835-7\_13},
doi = {10.1007/978-3-031-59835-7\_13},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FaenzaSW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaeuplerPR0Z24,
author = {Bernhard Haeupler and
Shyamal Patel and
Antti Roeyskoe and
Cliff Stein and
Goran Zuzic},
editor = {Bojan Mohar and
Igor Shinkar and
Ryan O'Donnell},
title = {Polylog-Competitive Deterministic Local Routing and Scheduling},
booktitle = {Proceedings of the 56th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2024, Vancouver, BC, Canada, June 24-28, 2024},
pages = {812--822},
publisher = {{ACM}},
year = {2024},
url = {https://doi.org/10.1145/3618260.3649678},
doi = {10.1145/3618260.3649678},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HaeuplerPR0Z24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-17143,
author = {Eric Balkanski and
No{\'{e}}mie P{\'{e}}rivier and
Clifford Stein and
Hao{-}Ting Wei},
title = {Energy-Efficient Scheduling with Predictions},
journal = {CoRR},
volume = {abs/2402.17143},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.17143},
doi = {10.48550/ARXIV.2402.17143},
eprinttype = {arXiv},
eprint = {2402.17143},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-17143.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-07410,
author = {Bernhard Haeupler and
Shyamal Patel and
Antti Roeyskoe and
Cliff Stein and
Goran Zuzic},
title = {Polylog-Competitive Deterministic Local Routing and Scheduling},
journal = {CoRR},
volume = {abs/2403.07410},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.07410},
doi = {10.48550/ARXIV.2403.07410},
eprinttype = {arXiv},
eprint = {2403.07410},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-07410.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-10964,
author = {Gabriel Chuang and
Oussama Hanguir and
Clifford Stein},
title = {Drawing Competitive Districts in Redistricting},
journal = {CoRR},
volume = {abs/2404.10964},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.10964},
doi = {10.48550/ARXIV.2404.10964},
eprinttype = {arXiv},
eprint = {2404.10964},
timestamp = {Wed, 22 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-10964.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2411-07553,
author = {Yuval Efron and
Shyamal Patel and
Clifford Stein},
title = {A Simple Algorithm for Dynamic Carpooling with Recourse},
journal = {CoRR},
volume = {abs/2411.07553},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2411.07553},
doi = {10.48550/ARXIV.2411.07553},
eprinttype = {arXiv},
eprint = {2411.07553},
timestamp = {Wed, 01 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2411-07553.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KalyanasundaramPS23,
author = {Bala Kalyanasundaram and
Kirk Pruhs and
Clifford Stein},
title = {A randomized algorithm for online metric b-matching},
journal = {Oper. Res. Lett.},
volume = {51},
number = {6},
pages = {591--594},
year = {2023},
url = {https://doi.org/10.1016/j.orl.2023.09.002},
doi = {10.1016/J.ORL.2023.09.002},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KalyanasundaramPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BalkanskiP0W23,
author = {Eric Balkanski and
No{\'{e}}mie P{\'{e}}rivier and
Clifford Stein and
Hao{-}Ting Wei},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Energy-Efficient Scheduling with Predictions},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/f99bb39502f09c4825e89760b4e1ad04-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BalkanskiP0W23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BalkanskiOSW23,
author = {Eric Balkanski and
Tingting Ou and
Clifford Stein and
Hao{-}Ting Wei},
editor = {Jaroslaw Byrka and
Andreas Wiese},
title = {Scheduling with Speed Predictions},
booktitle = {Approximation and Online Algorithms - 21st International Workshop,
{WAOA} 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14297},
pages = {74--89},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49815-2\_6},
doi = {10.1007/978-3-031-49815-2\_6},
timestamp = {Thu, 11 Jan 2024 22:28:02 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BalkanskiOSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-07164,
author = {Clifford Stein and
Hao{-}Ting Wei},
title = {Learning-Augmented Online Packet Scheduling with Deadlines},
journal = {CoRR},
volume = {abs/2305.07164},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.07164},
doi = {10.48550/ARXIV.2305.07164},
eprinttype = {arXiv},
eprint = {2305.07164},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-07164.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniNS022,
author = {Alexandr Andoni and
Negev Shekel Nosatzki and
Sandip Sinha and
Clifford Stein},
title = {Estimating the Longest Increasing Subsequence in Nearly Optimal Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {708--719},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00073},
doi = {10.1109/FOCS54457.2022.00073},
timestamp = {Tue, 08 Jul 2025 16:39:27 +0200},
biburl = {https://dblp.org/rec/conf/focs/AndoniNS022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MoseleyPSZ22,
author = {Benjamin Moseley and
Kirk Pruhs and
Clifford Stein and
Rudy Zhou},
editor = {Karen I. Aardal and
Laura Sanit{\`{a}}},
title = {A Competitive Algorithm for Throughput Maximization on Identical Machines},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International
Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13265},
pages = {402--414},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06901-7\_30},
doi = {10.1007/978-3-031-06901-7\_30},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MoseleyPSZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-01247,
author = {Eric Balkanski and
Tingting Ou and
Clifford Stein and
Hao{-}Ting Wei},
title = {Scheduling with Speed Predictions},
journal = {CoRR},
volume = {abs/2205.01247},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.01247},
doi = {10.48550/ARXIV.2205.01247},
eprinttype = {arXiv},
eprint = {2205.01247},
timestamp = {Thu, 05 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-01247.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-17050,
author = {Yuri Faenza and
Clifford Stein and
Jia Wan},
title = {Internal Closedness and von Neumann-Morgenstern Stability in Matching
Theory: Structures and Complexity},
journal = {CoRR},
volume = {abs/2211.17050},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.17050},
doi = {10.48550/ARXIV.2211.17050},
eprinttype = {arXiv},
eprint = {2211.17050},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-17050.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HousniGH021,
author = {Omar El Housni and
Vineet Goyal and
Oussama Hanguir and
Clifford Stein},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Matching Drivers to Riders: {A} Two-Stage Robust Approach},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {12:1--12:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.12},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.12},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/HousniGH021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BenderKKP021,
author = {Michael A. Bender and
Tsvi Kopelowitz and
William Kuszmaul and
Ely Porat and
Clifford Stein},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Incremental Edge Orientation in Forests},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {12:1--12:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.12},
doi = {10.4230/LIPICS.ESA.2021.12},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BenderKKP021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-02318,
author = {Michael A. Bender and
Tsvi Kopelowitz and
William Kuszmaul and
Ely Porat and
Clifford Stein},
title = {Incremental Edge Orientation in Forests},
journal = {CoRR},
volume = {abs/2107.02318},
year = {2021},
url = {https://arxiv.org/abs/2107.02318},
eprinttype = {arXiv},
eprint = {2107.02318},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-02318.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-06564,
author = {Benjamin Moseley and
Kirk Pruhs and
Clifford Stein and
Rudy Zhou},
title = {A Competitive Algorithm for Throughout Maximization on Identical Machines},
journal = {CoRR},
volume = {abs/2111.06564},
year = {2021},
url = {https://arxiv.org/abs/2111.06564},
eprinttype = {arXiv},
eprint = {2111.06564},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-06564.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-05106,
author = {Alexandr Andoni and
Negev Shekel Nosatzki and
Sandip Sinha and
Clifford Stein},
title = {Estimating the Longest Increasing Subsequence in Nearly Optimal Time},
journal = {CoRR},
volume = {abs/2112.05106},
year = {2021},
url = {https://arxiv.org/abs/2112.05106},
eprinttype = {arXiv},
eprint = {2112.05106},
timestamp = {Mon, 13 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-05106.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/SteinTW20,
author = {Clifford Stein and
Van{-}Anh Truong and
Xinshang Wang},
title = {Advance Service Reservations with Heterogeneous Customers},
journal = {Manag. Sci.},
volume = {66},
number = {7},
pages = {2929--2950},
year = {2020},
url = {https://doi.org/10.1287/mnsc.2019.3364},
doi = {10.1287/MNSC.2019.3364},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mansci/SteinTW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChenEMSS20,
author = {Lin Chen and
Franziska Eberle and
Nicole Megow and
Kevin Schewior and
Clifford Stein},
title = {A general framework for handling commitment in online throughput maximization},
journal = {Math. Program.},
volume = {183},
number = {1},
pages = {215--247},
year = {2020},
url = {https://doi.org/10.1007/s10107-020-01469-2},
doi = {10.1007/S10107-020-01469-2},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ChenEMSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AntoniadisIKMNP20,
author = {Antonios Antoniadis and
Sungjin Im and
Ravishankar Krishnaswamy and
Benjamin Moseley and
Viswanath Nagarajan and
Kirk Pruhs and
Clifford Stein},
title = {Hallucination Helps: Energy Efficient Virtual Circuit Routing},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {1},
pages = {37--66},
year = {2020},
url = {https://doi.org/10.1137/18M1228591},
doi = {10.1137/18M1228591},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AntoniadisIKMNP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SteinZ20,
author = {Clifford Stein and
Mingxian Zhong},
title = {Scheduling When You Do Not Know the Number of Machines},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {1},
pages = {9:1--9:20},
year = {2020},
url = {https://doi.org/10.1145/3340320},
doi = {10.1145/3340320},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/SteinZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AndoniSZ20,
author = {Alexandr Andoni and
Clifford Stein and
Peilin Zhong},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Parallel approximate undirected shortest paths via low hop emulators},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {322--335},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384321},
doi = {10.1145/3357713.3384321},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AndoniSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HanguirS20,
author = {Oussama Hanguir and
Clifford Stein},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {Distributed Algorithms for Matching in Hypergraphs},
booktitle = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
pages = {30--46},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_3},
doi = {10.1007/978-3-030-80879-2\_3},
timestamp = {Tue, 20 Jul 2021 15:29:23 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HanguirS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-09605,
author = {Oussama Hanguir and
Clifford Stein},
title = {Distributed Algorithms for Matching in Hypergraphs},
journal = {CoRR},
volume = {abs/2009.09605},
year = {2020},
url = {https://arxiv.org/abs/2009.09605},
eprinttype = {arXiv},
eprint = {2009.09605},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-09605.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BehnezhadDHSS19,
author = {Soheil Behnezhad and
Mahsa Derakhshan and
MohammadTaghi Hajiaghayi and
Cliff Stein and
Madhu Sudan},
editor = {David Zuckerman},
title = {Fully Dynamic Maximal Independent Set with Polylogarithmic Update
Time},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {382--405},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00032},
doi = {10.1109/FOCS.2019.00032},
timestamp = {Tue, 08 Jul 2025 16:38:52 +0200},
biburl = {https://dblp.org/rec/conf/focs/BehnezhadDHSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AndoniSZ19,
author = {Alexandr Andoni and
Clifford Stein and
Peilin Zhong},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {14:1--14:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.14},
doi = {10.4230/LIPICS.ICALP.2019.14},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AndoniSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001SS19,
author = {Shipra Agrawal and
Mohammad Shadravan and
Cliff Stein},
editor = {Avrim Blum},
title = {Submodular Secretary Problem with Shortlists},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {1:1--1:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.1},
doi = {10.4230/LIPICS.ITCS.2019.1},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/0001SS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/0009EMSS19,
author = {Lin Chen and
Franziska Eberle and
Nicole Megow and
Kevin Schewior and
Cliff Stein},
editor = {Andrea Lodi and
Viswanath Nagarajan},
title = {A General Framework for Handling Commitment in Online Throughput Maximization},
booktitle = {Integer Programming and Combinatorial Optimization - 20th International
Conference, {IPCO} 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11480},
pages = {141--154},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17953-3\_11},
doi = {10.1007/978-3-030-17953-3\_11},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/0009EMSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiBBMS19,
author = {Sepehr Assadi and
MohammadHossein Bateni and
Aaron Bernstein and
Vahab S. Mirrokni and
Cliff Stein},
editor = {Timothy M. Chan},
title = {Coresets Meet {EDCS:} Algorithms for Matching and Vertex Cover on
Massive Graphs},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1616--1635},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.98},
doi = {10.1137/1.9781611975482.98},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AssadiBBMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00850,
author = {Alexandr Andoni and
Clifford Stein and
Peilin Zhong},
title = {Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity},
journal = {CoRR},
volume = {abs/1905.00850},
year = {2019},
url = {http://arxiv.org/abs/1905.00850},
eprinttype = {arXiv},
eprint = {1905.00850},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-01748,
author = {MohammadTaghi Hajiaghayi and
Silvio Lattanzi and
Saeed Seddighin and
Cliff Stein},
title = {MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for
APSP, Matrix Multiplication, 3-SUM, and Beyond},
journal = {CoRR},
volume = {abs/1905.01748},
year = {2019},
url = {http://arxiv.org/abs/1905.01748},
eprinttype = {arXiv},
eprint = {1905.01748},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-01748.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-03478,
author = {Soheil Behnezhad and
Mahsa Derakhshan and
MohammadTaghi Hajiaghayi and
Cliff Stein and
Madhu Sudan},
title = {Fully Dynamic Maximal Independent Set with Polylogarithmic Update
Time},
journal = {CoRR},
volume = {abs/1909.03478},
year = {2019},
url = {http://arxiv.org/abs/1909.03478},
eprinttype = {arXiv},
eprint = {1909.03478},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-03478.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01956,
author = {Alexandr Andoni and
Clifford Stein and
Peilin Zhong},
title = {Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators},
journal = {CoRR},
volume = {abs/1911.01956},
year = {2019},
url = {http://arxiv.org/abs/1911.01956},
eprinttype = {arXiv},
eprint = {1911.01956},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01956.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/CarrascoIS18,
author = {Rodrigo A. Carrasco and
Garud Iyengar and
Cliff Stein},
title = {Resource cost aware scheduling},
journal = {Eur. J. Oper. Res.},
volume = {269},
number = {2},
pages = {621--632},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2018.02.059},
doi = {10.1016/J.EJOR.2018.02.059},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/CarrascoIS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniSSWZ18,
author = {Alexandr Andoni and
Zhao Song and
Clifford Stein and
Zhengyu Wang and
Peilin Zhong},
editor = {Mikkel Thorup},
title = {Parallel Graph Connectivity in Log Diameter Rounds},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {674--685},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00070},
doi = {10.1109/FOCS.2018.00070},
timestamp = {Tue, 08 Jul 2025 16:38:40 +0200},
biburl = {https://dblp.org/rec/conf/focs/AndoniSSWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ArarCCSW18,
author = {Moab Arar and
Shiri Chechik and
Sarel Cohen and
Cliff Stein and
David Wajc},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal
Fractional Algorithms},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {7:1--7:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.7},
doi = {10.4230/LIPICS.ICALP.2018.7},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ArarCCSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Stein18,
author = {Clifford Stein},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Approximate Matchings in Massive Graphs via Local Structure (Invited
Talk)},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.2},
doi = {10.4230/LIPICS.ISAAC.2018.2},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Stein18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CarrascoPSV18,
author = {Rodrigo A. Carrasco and
Kirk Pruhs and
Cliff Stein and
Jos{\'{e}} Verschae},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {The Online Set Aggregation Problem},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {245--259},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_19},
doi = {10.1007/978-3-319-77404-6\_19},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/CarrascoPSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SteinZ18,
author = {Clifford Stein and
Mingxian Zhong},
editor = {Artur Czumaj},
title = {Scheduling When You Don't Know the Number of Machines},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1261--1273},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.82},
doi = {10.1137/1.9781611975031.82},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/SteinZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BateniHSS18,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
Saeed Seddighin and
Cliff Stein},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Fast algorithms for knapsack via convolution and prediction},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {1269--1282},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188876},
doi = {10.1145/3188745.3188876},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BateniHSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-03055,
author = {Alexandr Andoni and
Clifford Stein and
Zhao Song and
Zhengyu Wang and
Peilin Zhong},
title = {Parallel Graph Connectivity in Log Diameter Rounds},
journal = {CoRR},
volume = {abs/1805.03055},
year = {2018},
url = {http://arxiv.org/abs/1805.03055},
eprinttype = {arXiv},
eprint = {1805.03055},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-03055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-05082,
author = {Shipra Agrawal and
Mohammad Shadravan and
Cliff Stein},
title = {Submodular Secretary Problem with Shortlists},
journal = {CoRR},
volume = {abs/1809.05082},
year = {2018},
url = {http://arxiv.org/abs/1809.05082},
eprinttype = {arXiv},
eprint = {1809.05082},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-05082.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-08238,
author = {Lin Chen and
Franziska Eberle and
Nicole Megow and
Kevin Schewior and
Cliff Stein},
title = {A general framework for handling commitment in online throughput maximization},
journal = {CoRR},
volume = {abs/1811.08238},
year = {2018},
url = {http://arxiv.org/abs/1811.08238},
eprinttype = {arXiv},
eprint = {1811.08238},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-08238.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-12554,
author = {MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
Saeed Seddighin and
Cliff Stein},
title = {Fast Algorithms for Knapsack via Convolution and Prediction},
journal = {CoRR},
volume = {abs/1811.12554},
year = {2018},
url = {http://arxiv.org/abs/1811.12554},
eprinttype = {arXiv},
eprint = {1811.12554},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-12554.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/HalldorssonMS18,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Nicole Megow and
Clifford Stein},
title = {Scheduling (Dagstuhl Seminar 18101)},
journal = {Dagstuhl Reports},
volume = {8},
number = {3},
pages = {1--20},
year = {2018},
url = {https://doi.org/10.4230/DagRep.8.3.1},
doi = {10.4230/DAGREP.8.3.1},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/HalldorssonMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MarasevicSZ17,
author = {Jelena Marasevic and
Clifford Stein and
Gil Zussman},
title = {Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks:
Algorithmic Analysis},
journal = {Algorithmica},
volume = {78},
number = {2},
pages = {521--557},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0171-6},
doi = {10.1007/S00453-016-0171-6},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MarasevicSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ImMPS17,
author = {Sungjin Im and
Benjamin Moseley and
Kirk Pruhs and
Clifford Stein},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Minimizing Maximum Flow Time on Related Machines via Dynamic Posted
Pricing},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {51:1--51:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.51},
doi = {10.4230/LIPICS.ESA.2017.51},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ImMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BernsteinKPPS17,
author = {Aaron Bernstein and
Tsvi Kopelowitz and
Seth Pettie and
Ely Porat and
Clifford Stein},
editor = {Christos H. Papadimitriou},
title = {Simultaneously Load Balancing for Every p-norm, With Reassignments},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
2017, January 9-11, 2017, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {67},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.51},
doi = {10.4230/LIPICS.ITCS.2017.51},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BernsteinKPPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rtss/ImMPS17,
author = {Sungjin Im and
Benjamin Moseley and
Kirk Pruhs and
Clifford Stein},
title = {An O(Log Log m)-Competitive Algorithm for Online Machine Minimization},
booktitle = {2017 {IEEE} Real-Time Systems Symposium, {RTSS} 2017, Paris, France,
December 5-8, 2017},
pages = {343--350},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/RTSS.2017.00039},
doi = {10.1109/RTSS.2017.00039},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/rtss/ImMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/HuangS17,
author = {Michael Huang and
Clifford Stein},
editor = {Costas S. Iliopoulos and
Solon P. Pissis and
Simon J. Puglisi and
Rajeev Raman},
title = {Extending Search Phases in the Micali-Vazirani Algorithm},
booktitle = {16th International Symposium on Experimental Algorithms, {SEA} 2017,
June 21-23, 2017, London, {UK}},
series = {LIPIcs},
volume = {75},
pages = {10:1--10:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.SEA.2017.10},
doi = {10.4230/LIPICS.SEA.2017.10},
timestamp = {Fri, 03 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/HuangS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-09046,
author = {Sungjin Im and
Benjamin Moseley and
Kirk Pruhs and
Clifford Stein},
title = {An O(log log m)-competitive Algorithm for Online Machine Minimization},
journal = {CoRR},
volume = {abs/1708.09046},
year = {2017},
url = {http://arxiv.org/abs/1708.09046},
eprinttype = {arXiv},
eprint = {1708.09046},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-09046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03076,
author = {Sepehr Assadi and
MohammadHossein Bateni and
Aaron Bernstein and
Vahab S. Mirrokni and
Cliff Stein},
title = {Coresets Meet {EDCS:} Algorithms for Matching and Vertex Cover on
Massive Graphs},
journal = {CoRR},
volume = {abs/1711.03076},
year = {2017},
url = {http://arxiv.org/abs/1711.03076},
eprinttype = {arXiv},
eprint = {1711.03076},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-06625,
author = {Moab Arar and
Shiri Chechik and
Sarel Cohen and
Cliff Stein and
David Wajc},
title = {Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal
Fractional Algorithms},
journal = {CoRR},
volume = {abs/1711.06625},
year = {2017},
url = {http://arxiv.org/abs/1711.06625},
eprinttype = {arXiv},
eprint = {1711.06625},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-06625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/emnlp/SimionCS16,
author = {Andrei Simion and
Michael Collins and
Cliff Stein},
editor = {Jian Su and
Xavier Carreras and
Kevin Duh},
title = {Towards a Convex {HMM} Surrogate for Word Alignment},
booktitle = {Proceedings of the 2016 Conference on Empirical Methods in Natural
Language Processing, {EMNLP} 2016, Austin, Texas, USA, November 1-4,
2016},
pages = {531--540},
publisher = {The Association for Computational Linguistics},
year = {2016},
url = {https://doi.org/10.18653/v1/d16-1051},
doi = {10.18653/V1/D16-1051},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/emnlp/SimionCS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MarasevicSZ16,
author = {Jelena Marasevic and
Clifford Stein and
Gil Zussman},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {54:1--54:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.54},
doi = {10.4230/LIPICS.ICALP.2016.54},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MarasevicSZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinS16,
author = {Aaron Bernstein and
Cliff Stein},
editor = {Robert Krauthgamer},
title = {Faster Fully Dynamic Matchings with Small Approximation Ratios},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {692--711},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch50},
doi = {10.1137/1.9781611974331.CH50},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/QiuSZ16,
author = {Zhen Qiu and
Clifford Stein and
Yuan Zhong},
editor = {Andrew V. Goldberg and
Alexander S. Kulikov},
title = {Experimental Analysis of Algorithms for Coflow Scheduling},
booktitle = {Experimental Algorithms - 15th International Symposium, {SEA} 2016,
St. Petersburg, Russia, June 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9685},
pages = {262--277},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-38851-9\_18},
doi = {10.1007/978-3-319-38851-9\_18},
timestamp = {Thu, 06 Feb 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/QiuSZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/SakrS16,
author = {Nourhan Sakr and
Cliff Stein},
editor = {Andrew V. Goldberg and
Alexander S. Kulikov},
title = {An Empirical Study of Online Packet Scheduling Algorithms},
booktitle = {Experimental Algorithms - 15th International Symposium, {SEA} 2016,
St. Petersburg, Russia, June 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9685},
pages = {278--293},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-38851-9\_19},
doi = {10.1007/978-3-319-38851-9\_19},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/SakrS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SakrS16,
author = {Nourhan Sakr and
Cliff Stein},
title = {An Empirical Study of Online Packet Scheduling Algorithms},
journal = {CoRR},
volume = {abs/1603.07947},
year = {2016},
url = {http://arxiv.org/abs/1603.07947},
eprinttype = {arXiv},
eprint = {1603.07947},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SakrS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/QiuSZ16,
author = {Zhen Qiu and
Cliff Stein and
Yuan Zhong},
title = {Experimental Analysis of Algorithms for Coflow Scheduling},
journal = {CoRR},
volume = {abs/1603.07981},
year = {2016},
url = {http://arxiv.org/abs/1603.07981},
eprinttype = {arXiv},
eprint = {1603.07981},
timestamp = {Sun, 09 Feb 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/QiuSZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BansalMS16,
author = {Nikhil Bansal and
Nicole Megow and
Clifford Stein},
title = {Scheduling (Dagstuhl Seminar 16081)},
journal = {Dagstuhl Reports},
volume = {6},
number = {2},
pages = {97--118},
year = {2016},
url = {https://doi.org/10.4230/DagRep.6.2.97},
doi = {10.4230/DAGREP.6.2.97},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BansalMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/SimionCS15,
author = {Andrei Arsene Simion and
Michael Collins and
Cliff Stein},
editor = {Blai Bonet and
Sven Koenig},
title = {A Family of Latent Variable Convex Relaxations for {IBM} Model 2},
booktitle = {Proceedings of the Twenty-Ninth {AAAI} Conference on Artificial Intelligence,
January 25-30, 2015, Austin, Texas, {USA}},
pages = {2318--2324},
publisher = {{AAAI} Press},
year = {2015},
url = {https://doi.org/10.1609/aaai.v29i1.9514},
doi = {10.1609/AAAI.V29I1.9514},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/SimionCS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BansalGKPSS15,
author = {Nikhil Bansal and
Anupam Gupta and
Ravishankar Krishnaswamy and
Kirk Pruhs and
Kevin Schewior and
Clifford Stein},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {A 2-Competitive Algorithm For Online Convex Optimization With Switching
Costs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {96--109},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.96},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.96},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/BansalGKPSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/emnlp/SimionCS15,
author = {Andrei Simion and
Michael Collins and
Cliff Stein},
editor = {Llu{\'{\i}}s M{\`{a}}rquez and
Chris Callison{-}Burch and
Jian Su and
Daniele Pighin and
Yuval Marton},
title = {On {A} Strictly Convex {IBM} Model 1},
booktitle = {Proceedings of the 2015 Conference on Empirical Methods in Natural
Language Processing, {EMNLP} 2015, Lisbon, Portugal, September 17-21,
2015},
pages = {221--226},
publisher = {The Association for Computational Linguistics},
year = {2015},
url = {https://doi.org/10.18653/v1/d15-1023},
doi = {10.18653/V1/D15-1023},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/emnlp/SimionCS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BernsteinS15,
author = {Aaron Bernstein and
Cliff Stein},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Fully Dynamic Matching in Bipartite Graphs},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {167--179},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_14},
doi = {10.1007/978-3-662-47672-7\_14},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BernsteinS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/QiuSZ15,
author = {Zhen Qiu and
Cliff Stein and
Yuan Zhong},
editor = {Guy E. Blelloch and
Kunal Agrawal},
title = {Minimizing the Total Weighted Completion Time of Coflows in Datacenter
Networks},
booktitle = {Proceedings of the 27th {ACM} on Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2015, Portland, OR, USA, June 13-15, 2015},
pages = {294--303},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2755573.2755592},
doi = {10.1145/2755573.2755592},
timestamp = {Fri, 04 Apr 2025 18:15:05 +0200},
biburl = {https://dblp.org/rec/conf/spaa/QiuSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarasevicSZ15,
author = {Jelena Marasevic and
Clifford Stein and
Gil Zussman},
title = {A Fast Distributed Algorithm for {\(\alpha\)}-Fair Packing Problems},
journal = {CoRR},
volume = {abs/1502.03372},
year = {2015},
url = {http://arxiv.org/abs/1502.03372},
eprinttype = {arXiv},
eprint = {1502.03372},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarasevicSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BernsteinS15,
author = {Aaron Bernstein and
Clifford Stein},
title = {Fully Dynamic Matching in Bipartite Graphs},
journal = {CoRR},
volume = {abs/1506.07076},
year = {2015},
url = {http://arxiv.org/abs/1506.07076},
eprinttype = {arXiv},
eprint = {1506.07076},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BernsteinS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eacl/SimionCS14,
author = {Andrei Simion and
Michael Collins and
Cliff Stein},
editor = {Gosse Bouma and
Yannick Parmentier},
title = {Some Experiments with a Convex {IBM} Model 2},
booktitle = {Proceedings of the 14th Conference of the European Chapter of the
Association for Computational Linguistics, {EACL} 2014, April 26-30,
2014, Gothenburg, Sweden},
pages = {180--184},
publisher = {The Association for Computer Linguistics},
year = {2014},
url = {https://doi.org/10.3115/v1/e14-4035},
doi = {10.3115/V1/E14-4035},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eacl/SimionCS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mobihoc/MarasevicSZ14,
author = {Jelena Marasevic and
Clifford Stein and
Gil Zussman},
editor = {Jie Wu and
Xiuzhen Cheng and
Xiang{-}Yang Li and
Saswati Sarkar},
title = {Max-min fair rate allocation and routing in energy harvesting networks:
algorithmic analysis},
booktitle = {The Fifteenth {ACM} International Symposium on Mobile Ad Hoc Networking
and Computing, MobiHoc'14, Philadelphia, PA, USA, August 11-14, 2014},
pages = {367--376},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2632951.2632960},
doi = {10.1145/2632951.2632960},
timestamp = {Thu, 10 Mar 2022 09:31:34 +0100},
biburl = {https://dblp.org/rec/conf/mobihoc/MarasevicSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuptaKS14,
author = {Anupam Gupta and
Amit Kumar and
Cliff Stein},
editor = {Chandra Chekuri},
title = {Maintaining Assignments Online: Matching, Scheduling, and Flows},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {468--479},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.35},
doi = {10.1137/1.9781611973402.35},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GuptaKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AntoniadisIKMNPS14,
author = {Antonios Antoniadis and
Sungjin Im and
Ravishankar Krishnaswamy and
Benjamin Moseley and
Viswanath Nagarajan and
Kirk Pruhs and
Cliff Stein},
editor = {Chandra Chekuri},
title = {Hallucination Helps: Energy Efficient Virtual Circuit Routing},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1141--1153},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.84},
doi = {10.1137/1.9781611973402.84},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AntoniadisIKMNPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KrishnaswamyNPS14,
author = {Ravishankar Krishnaswamy and
Viswanath Nagarajan and
Kirk Pruhs and
Cliff Stein},
editor = {David B. Shmoys},
title = {Cluster before you hallucinate: approximating node-capacitated network
design and energy efficient routing},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {734--743},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591831},
doi = {10.1145/2591796.2591831},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KrishnaswamyNPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KrishnaswamyNPS14,
author = {Ravishankar Krishnaswamy and
Viswanath Nagarajan and
Kirk Pruhs and
Cliff Stein},
title = {Cluster Before You Hallucinate: Approximating Node-Capacitated Network
Design and Energy Efficient Routing},
journal = {CoRR},
volume = {abs/1403.6207},
year = {2014},
url = {http://arxiv.org/abs/1403.6207},
eprinttype = {arXiv},
eprint = {1403.6207},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KrishnaswamyNPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarasevicSZ14,
author = {Jelena Marasevic and
Cliff Stein and
Gil Zussman},
title = {Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks:
Algorithmic Analysis},
journal = {CoRR},
volume = {abs/1406.3671},
year = {2014},
url = {http://arxiv.org/abs/1406.3671},
eprinttype = {arXiv},
eprint = {1406.3671},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarasevicSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CarrascoIS13,
author = {Rodrigo A. Carrasco and
Garud Iyengar and
Cliff Stein},
title = {Single machine scheduling with job-dependent convex cost and arbitrary
precedence constraints},
journal = {Oper. Res. Lett.},
volume = {41},
number = {5},
pages = {436--441},
year = {2013},
url = {https://doi.org/10.1016/j.orl.2013.05.008},
doi = {10.1016/J.ORL.2013.05.008},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CarrascoIS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/emnlp/SimionCS13,
author = {Andrei Simion and
Michael Collins and
Cliff Stein},
title = {A Convex Alternative to {IBM} Model 2},
booktitle = {Proceedings of the 2013 Conference on Empirical Methods in Natural
Language Processing, {EMNLP} 2013, 18-21 October 2013, Grand Hyatt
Seattle, Seattle, Washington, USA, {A} meeting of SIGDAT, a Special
Interest Group of the {ACL}},
pages = {1574--1583},
publisher = {{ACL}},
year = {2013},
url = {https://doi.org/10.18653/v1/d13-1164},
doi = {10.18653/V1/D13-1164},
timestamp = {Fri, 13 Jun 2025 08:28:41 +0200},
biburl = {https://dblp.org/rec/conf/emnlp/SimionCS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/MoseleyPS13,
author = {Benjamin Moseley and
Kirk Pruhs and
Cliff Stein},
editor = {Michel X. Goemans and
Jos{\'{e}} Correa},
title = {The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended
Abstract)},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7801},
pages = {278--289},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36694-9\_24},
doi = {10.1007/978-3-642-36694-9\_24},
timestamp = {Wed, 03 Apr 2024 19:56:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/MoseleyPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-0793,
author = {Benjamin Moseley and
Kirk Pruhs and
Cliff Stein},
title = {The Complexity of Scheduling for p-norms of Flow and Stretch},
journal = {CoRR},
volume = {abs/1301.0793},
year = {2013},
url = {http://arxiv.org/abs/1301.0793},
eprinttype = {arXiv},
eprint = {1301.0793},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-0793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JezLSS12,
author = {Lukasz Jez and
Fei Li and
Jay Sethuraman and
Clifford Stein},
title = {Online scheduling of packets with agreeable deadlines},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {1},
pages = {5:1--5:11},
year = {2012},
url = {https://doi.org/10.1145/2390176.2390181},
doi = {10.1145/2390176.2390181},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/JezLSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/ShermanNS12,
author = {Alex Sherman and
Jason Nieh and
Clifford Stein},
title = {FairTorrent: {A} Deficit-Based Distributed Algorithm to Ensure Fairness
in Peer-to-Peer Systems},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {20},
number = {5},
pages = {1361--1374},
year = {2012},
url = {https://doi.org/10.1109/TNET.2012.2185058},
doi = {10.1109/TNET.2012.2185058},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/ShermanNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/medalg/BansalGKNPS12,
author = {Nikhil Bansal and
Anupam Gupta and
Ravishankar Krishnaswamy and
Viswanath Nagarajan and
Kirk Pruhs and
Cliff Stein},
editor = {Guy Even and
Dror Rawitz},
title = {Multicast Routing for Energy Minimization Using Speed Scaling},
booktitle = {Design and Analysis of Algorithms - First Mediterranean Conference
on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5,
2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7659},
pages = {37--51},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34862-4\_3},
doi = {10.1007/978-3-642-34862-4\_3},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/medalg/BansalGKNPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NegruseriPSSS11,
author = {Cosmin Silvestru Negruseri and
Mircea Bogdan Pasoi and
Barbara Stanley and
Clifford Stein and
Cristian George Strat},
title = {Solving maximum flow problems on real-world bipartite graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025381},
doi = {10.1145/1963190.2025381},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NegruseriPSSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/IyengarPS11,
author = {Garud Iyengar and
David J. Phillips and
Clifford Stein},
title = {Approximating Semidefinite Packing Programs},
journal = {{SIAM} J. Optim.},
volume = {21},
number = {1},
pages = {231--268},
year = {2011},
url = {https://doi.org/10.1137/090762671},
doi = {10.1137/090762671},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/IyengarPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-0685,
author = {Rodrigo A. Carrasco and
Garud Iyengar and
Clifford Stein},
title = {Energy Aware Scheduling for Weighted Completion Time and Weighted
Tardiness},
journal = {CoRR},
volume = {abs/1110.0685},
year = {2011},
url = {http://arxiv.org/abs/1110.0685},
eprinttype = {arXiv},
eprint = {1110.0685},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-0685.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FeldmanMSSS10,
author = {Jon Feldman and
S. Muthukrishnan and
Anastasios Sidiropoulos and
Clifford Stein and
Zoya Svitkina},
title = {On distributing symmetric streaming computations},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {4},
pages = {66:1--66:19},
year = {2010},
url = {https://doi.org/10.1145/1824777.1824786},
doi = {10.1145/1824777.1824786},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/FeldmanMSSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/PruhsS10,
author = {Kirk Pruhs and
Clifford Stein},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {How to Schedule When You Have to Buy Your Energy},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {352--365},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_27},
doi = {10.1007/978-3-642-15369-3\_27},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/PruhsS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FeldmanHKMS10,
author = {Jon Feldman and
Monika Henzinger and
Nitish Korula and
Vahab S. Mirrokni and
Clifford Stein},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Online Stochastic Packing Applied to Display Ad Allocation},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {182--194},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_16},
doi = {10.1007/978-3-642-15775-2\_16},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/FeldmanHKMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/IyengarPS10,
author = {Garud Iyengar and
David J. Phillips and
Clifford Stein},
editor = {Haim Kaplan},
title = {Feasible and Accurate Algorithms for Covering Semidefinite Programs},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {150--162},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_15},
doi = {10.1007/978-3-642-13731-0\_15},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/IyengarPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-5076,
author = {Jon Feldman and
Monika Henzinger and
Nitish Korula and
Vahab S. Mirrokni and
Clifford Stein},
title = {Online Stochastic Ad Allocation: Efficiency and Fairness},
journal = {CoRR},
volume = {abs/1001.5076},
year = {2010},
url = {http://arxiv.org/abs/1001.5076},
eprinttype = {arXiv},
eprint = {1001.5076},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-5076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0023376,
author = {Thomas H. Cormen and
Charles E. Leiserson and
Ronald L. Rivest and
Clifford Stein},
title = {Introduction to Algorithms, 3rd Edition},
publisher = {{MIT} Press},
year = {2009},
url = {http://mitpress.mit.edu/books/introduction-algorithms},
isbn = {978-0-262-03384-8},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0023376.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/WagnerDS09,
author = {David P. Wagner and
Robert L. Scot Drysdale and
Clifford Stein},
title = {An O(n\({}^{\mbox{5/2}}\)logn) algorithm for the Rectilinear Minimum
Link-Distance Problem in three dimensions},
journal = {Comput. Geom.},
volume = {42},
number = {5},
pages = {376--387},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2008.04.006},
doi = {10.1016/J.COMGEO.2008.04.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/WagnerDS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/AsgeirssonS09,
author = {Eyjolfur Ingi Asgeirsson and
Cliff Stein},
title = {Bounded-space online bin cover},
journal = {J. Sched.},
volume = {12},
number = {5},
pages = {461--474},
year = {2009},
url = {https://doi.org/10.1007/s10951-009-0116-x},
doi = {10.1007/S10951-009-0116-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/AsgeirssonS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalPS09,
author = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Speed Scaling for Weighted Flow Time},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {4},
pages = {1294--1308},
year = {2009},
url = {https://doi.org/10.1137/08072125X},
doi = {10.1137/08072125X},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BansalPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AsgeirssonS09,
author = {Eyjolfur Ingi Asgeirsson and
Cliff Stein},
title = {Divide-and-Conquer Approximation Algorithm for Vertex Cover},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {3},
pages = {1261--1280},
year = {2009},
url = {https://doi.org/10.1137/070710275},
doi = {10.1137/070710275},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AsgeirssonS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/NegruseriPSSS09,
author = {Cosmin Silvestru Negruseri and
Mircea Bogdan Pasoi and
Barbara Stanley and
Clifford Stein and
Cristian George Strat},
editor = {Irene Finocchi and
John Hershberger},
title = {Solving Maximum Flow Problems on Real World Bipartite Graphs},
booktitle = {Proceedings of the Eleventh Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2009, New York, New York, USA, January 3, 2009},
pages = {14--28},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972894.2},
doi = {10.1137/1.9781611972894.2},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/NegruseriPSSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/conext/ShermanNS09,
author = {Alex Sherman and
Jason Nieh and
Clifford Stein},
editor = {J{\"{o}}rg Liebeherr and
Giorgio Ventre and
Ernst W. Biersack and
Srinivasan Keshav},
title = {FairTorrent: bringing fairness to peer-to-peer systems},
booktitle = {Proceedings of the 2009 {ACM} Conference on Emerging Networking Experiments
and Technology, CoNEXT 2009, Rome, Italy, December 1-4, 2009},
pages = {133--144},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1658939.1658955},
doi = {10.1145/1658939.1658955},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/conext/ShermanNS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isw/ShermanSNKS09,
author = {Alex Sherman and
Angelos Stavrou and
Jason Nieh and
Angelos D. Keromytis and
Clifford Stein},
editor = {Pierangela Samarati and
Moti Yung and
Fabio Martinelli and
Claudio A. Ardagna},
title = {Adding Trust to {P2P} Distribution of Paid Content},
booktitle = {Information Security, 12th International Conference, {ISC} 2009, Pisa,
Italy, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5735},
pages = {459--474},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04474-8\_36},
doi = {10.1007/978-3-642-04474-8\_36},
timestamp = {Mon, 21 Mar 2022 18:09:53 +0100},
biburl = {https://dblp.org/rec/conf/isw/ShermanSNKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/RadovanovicS08,
author = {Ana Radovanovic and
Cliff Stein},
title = {Asymptotic performance of the non-forced idle time scheduling policies
in the presence of variable demand for resources},
booktitle = {46th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2008, Monticello, IL, USA, September 24-26, 2008},
pages = {499--503},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/ALLERTON.2008.4797599},
doi = {10.1109/ALLERTON.2008.4797599},
timestamp = {Wed, 22 Nov 2023 08:29:09 +0100},
biburl = {https://dblp.org/rec/conf/allerton/RadovanovicS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FeldmanMSSS08,
author = {Jon Feldman and
S. Muthukrishnan and
Anastasios Sidiropoulos and
Clifford Stein and
Zoya Svitkina},
editor = {Shang{-}Hua Teng},
title = {On distributing symmetric streaming computations},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {710--719},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347160},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/FeldmanMSSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/FeldmanMSSW07,
author = {Jon Feldman and
Tal Malkin and
Rocco A. Servedio and
Clifford Stein and
Martin J. Wainwright},
title = {{LP} Decoding Corrects a Constant Fraction of Errors},
journal = {{IEEE} Trans. Inf. Theory},
volume = {53},
number = {1},
pages = {82--89},
year = {2007},
url = {https://doi.org/10.1109/TIT.2006.887523},
doi = {10.1109/TIT.2006.887523},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/FeldmanMSSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalCKPSS07,
author = {Nikhil Bansal and
Ho{-}Leung Chan and
Rohit Khandekar and
Kirk Pruhs and
Clifford Stein and
Baruch Schieber},
title = {Non-Preemptive Min-Sum Scheduling with Resource Augmentation},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2007, Providence, RI, USA, October 20-23, 2007, Proceedings},
pages = {614--624},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.11},
doi = {10.1109/FOCS.2007.11},
timestamp = {Tue, 08 Jul 2025 16:25:57 +0200},
biburl = {https://dblp.org/rec/conf/focs/BansalCKPSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/FeldmanMPS07,
author = {Jon Feldman and
S. Muthukrishnan and
Martin P{\'{a}}l and
Clifford Stein},
editor = {Jeffrey K. MacKie{-}Mason and
David C. Parkes and
Paul Resnick},
title = {Budget optimization in search-based advertising auctions},
booktitle = {Proceedings 8th {ACM} Conference on Electronic Commerce (EC-2007),
San Diego, California, USA, June 11-15, 2007},
pages = {40--49},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250910.1250917},
doi = {10.1145/1250910.1250917},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/FeldmanMPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiSS07,
author = {Fei Li and
Jay Sethuraman and
Clifford Stein},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Better online buffer management},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {199--208},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283405},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/LiSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BansalPS07,
author = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Speed scaling for weighted flow time},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {805--813},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283469},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BansalPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/springsim/lyengarPS07,
author = {Garud Iyengar and
David J. Phillips and
Clifford Stein},
editor = {Maurice J. Ades},
title = {Models of malicious behavior in sponsored search},
booktitle = {Proceedings of the 2007 Spring Simulation Multiconference, SpringSim
2007, Norfolk, Virginia, USA, March 25-29, 2007, Volume 3},
pages = {143--151},
publisher = {{SCS/ACM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1404803.1404835},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/springsim/lyengarPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/AsgeirssonS07,
author = {Eyjolfur Ingi Asgeirsson and
Clifford Stein},
editor = {Camil Demetrescu},
title = {Vertex Cover Approximations on Random Graphs},
booktitle = {Experimental Algorithms, 6th International Workshop, {WEA} 2007, Rome,
Italy, June 6-8, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4525},
pages = {285--296},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72845-0\_22},
doi = {10.1007/978-3-540-72845-0\_22},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/AsgeirssonS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2007,
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383},
isbn = {978-0-898716-24-5},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0017732,
author = {Kenneth P. Bogart and
Clifford Stein and
Robert L. Scot Drysdale},
title = {Discrete mathematics for computer science},
series = {Mathematics accross the curriculum},
publisher = {Key College Publishing},
year = {2006},
isbn = {978-1-930190-86-3},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0017732.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/AsgeirssonS06,
author = {Eyj{\'{o}}lfur Ingi {\'{A}}sgeirsson and
Cliff Stein},
editor = {Rajeev Raman and
Matthias F. Stallmann},
title = {Using Markov Chains To Design Algorithms For Bounded-Space On-Line
Bin Cover},
booktitle = {Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments,
{ALENEX} 2006, Miami, Florida, USA, January 21, 2006},
pages = {75--85},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972863.8},
doi = {10.1137/1.9781611972863.8},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/AsgeirssonS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/CapritaNS06,
author = {Bogdan Caprita and
Jason Nieh and
Clifford Stein},
editor = {Eric Ruppert and
Dahlia Malkhi},
title = {Grouped distributed queues: distributed queue, proportional share
multiprocessor scheduling},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2006, Denver, CO, USA, July 23-26,
2006},
pages = {72--81},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1146381.1146396},
doi = {10.1145/1146381.1146396},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/CapritaNS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0611108,
author = {Jon Feldman and
S. Muthukrishnan and
Anastasios Sidiropoulos and
Clifford Stein and
Zoya Svitkina},
title = {On the Complexity of Processing Massive, Unordered, Distributed Data},
journal = {CoRR},
volume = {abs/cs/0611108},
year = {2006},
url = {http://arxiv.org/abs/cs/0611108},
eprinttype = {arXiv},
eprint = {cs/0611108},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0611108.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0612052,
author = {Jon Feldman and
S. Muthukrishnan and
Martin P{\'{a}}l and
Clifford Stein},
title = {Budget Optimization in Search-Based Advertising Auctions},
journal = {CoRR},
volume = {abs/cs/0612052},
year = {2006},
url = {http://arxiv.org/abs/cs/0612052},
eprinttype = {arXiv},
eprint = {cs/0612052},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0612052.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DrysdaleSW05,
author = {Robert L. Scot Drysdale and
Clifford Stein and
David P. Wagner},
title = {An O(n\({}^{\mbox{5/2}}\)log n) Algorithm for the Rectilinear Minimum
Link-Distance Problem},
booktitle = {Proceedings of the 17th Canadian Conference on Computational Geometry,
CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005},
pages = {97--100},
year = {2005},
url = {http://www.cccg.ca/proceedings/2005/70.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/DrysdaleSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/IyengarPS05,
author = {Garud Iyengar and
David J. Phillips and
Clifford Stein},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {Approximation Algorithms for Semidefinite Packing Problems with Applications
to Maxcut and Graph Coloring},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {152--166},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_12},
doi = {10.1007/11496915\_12},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/IyengarPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FeldmanS05,
author = {Jon Feldman and
Clifford Stein},
title = {{LP} decoding achieves capacity},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {460--469},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070496},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/FeldmanS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiSS05,
author = {Fei Li and
Jay Sethuraman and
Clifford Stein},
title = {An optimal online algorithm for packet scheduling with agreeable deadlines},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {801--802},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070544},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/LiSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/usenix/CapritaCNSZ05,
author = {Bogdan Caprita and
Wong Chun Chan and
Jason Nieh and
Clifford Stein and
Haoqiang Zheng},
title = {Group Ratio Round-Robin: {O(1)} Proportional Share Scheduling for
Uniprocessor and Multiprocessor Systems},
booktitle = {Proceedings of the 2005 {USENIX} Annual Technical Conference, April
10-15, 2005, Anaheim, CA, {USA}},
pages = {337--352},
publisher = {{USENIX}},
year = {2005},
url = {http://www.usenix.org/events/usenix05/tech/general/caprita.html},
timestamp = {Tue, 16 Jul 2024 09:12:32 +0200},
biburl = {https://dblp.org/rec/conf/usenix/CapritaCNSZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/AsgeirssonS05,
author = {Eyjolfur Ingi Asgeirsson and
Clifford Stein},
editor = {Sotiris E. Nikoletseas},
title = {Vertex Cover Approximations: Experiments and Observations},
booktitle = {Experimental and Efficient Algorithms, 4th InternationalWorkshop,
{WEA} 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3503},
pages = {545--557},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11427186\_47},
doi = {10.1007/11427186\_47},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/AsgeirssonS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KargerKSTY04,
author = {David R. Karger and
Philip N. Klein and
Clifford Stein and
Mikkel Thorup and
Neal E. Young},
title = {Rounding Algorithms for a Geometric Embedding of Minimum Multiway
Cut},
journal = {Math. Oper. Res.},
volume = {29},
number = {3},
pages = {436--461},
year = {2004},
url = {https://doi.org/10.1287/moor.1030.0086},
doi = {10.1287/MOOR.1030.0086},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KargerKSTY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KolliopoulosS04,
author = {Stavros G. Kolliopoulos and
Clifford Stein},
title = {Approximating disjoint-path problems using packing integer programs},
journal = {Math. Program.},
volume = {99},
number = {1},
pages = {63--87},
year = {2004},
url = {https://doi.org/10.1007/s10107-002-0370-6},
doi = {10.1007/S10107-002-0370-6},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KolliopoulosS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AsgeirssonBPPSW04,
author = {Eyjolfur Ingi Asgeirsson and
Jonathan W. Berry and
Cynthia A. Phillips and
David J. Phillips and
Clifford Stein and
Joel Wein},
editor = {George L. Nemhauser and
Daniel Bienstock},
title = {Scheduling an Industrial Production Facility},
booktitle = {Integer Programming and Combinatorial Optimization, 10th International
{IPCO} Conference, New York, NY, USA, June 7-11, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3064},
pages = {116--131},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-25960-2\_9},
doi = {10.1007/978-3-540-25960-2\_9},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AsgeirssonBPPSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/FeldmanMSSW04,
author = {Jon Feldman and
Tal Malkin and
Rocco A. Servedio and
Cliff Stein and
Martin J. Wainwright},
title = {{LP} decoding corrects a constant fraction of errors},
booktitle = {Proceedings of the 2004 {IEEE} International Symposium on Information
Theory, {ISIT} 2004, Chicago Downtown Marriott, Chicago, Illinois,
USA, June 27 - July 2, 2004},
pages = {68},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ISIT.2004.1365106},
doi = {10.1109/ISIT.2004.1365106},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isit/FeldmanMSSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/03/SteinFSMS03,
author = {Clifford Stein and
Lisa Fleischer and
Douglas R. Shier and
Prakash Mirchandani and
David Simchi{-}Levi},
editor = {Jonathan L. Gross and
Jay Yellen},
title = {Networks and Flows},
booktitle = {Handbook of Graph Theory},
series = {Discrete Mathematics and Its Applications},
pages = {1074--1142},
publisher = {Chapman {\&} Hall / Taylor {\&} Francis},
year = {2003},
url = {https://doi.org/10.1201/9780203490204.ch11},
doi = {10.1201/9780203490204.CH11},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/tf/03/SteinFSMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PhillipsSTW02,
author = {Cynthia A. Phillips and
Clifford Stein and
Eric Torng and
Joel Wein},
title = {Optimal Time-Critical Scheduling via Resource Augmentation},
journal = {Algorithmica},
volume = {32},
number = {2},
pages = {163--200},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0068-9},
doi = {10.1007/S00453-001-0068-9},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PhillipsSTW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RasalaSTU02,
author = {April Rasala and
Clifford Stein and
Eric Torng and
Patchrawat Uthaisombut},
editor = {David Eppstein},
title = {Existence theorems, lower bounds and algorithms for scheduling to
meet two objectives},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {723--731},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545478},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/RasalaSTU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HepnerS02,
author = {Clint Hepner and
Clifford Stein},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Minimizing Makespan for the Lazy Bureaucrat Problem},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {40--50},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_5},
doi = {10.1007/3-540-45471-3\_5},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HepnerS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2002,
editor = {David M. Mount and
Clifford Stein},
title = {Algorithm Engineering and Experiments, 4th International Workshop,
{ALENEX} 2002, San Francisco, CA, USA, January 4-5, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2409},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45643-0},
doi = {10.1007/3-540-45643-0},
isbn = {3-540-43977-3},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205008,
author = {Javed A. Aslam and
April Rasala and
Clifford Stein and
Neal E. Young},
title = {Improved Bicriteria Existence Theorems for Scheduling},
journal = {CoRR},
volume = {cs.DS/0205008},
year = {2002},
url = {https://arxiv.org/abs/cs/0205008},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205051,
author = {David R. Karger and
Philip N. Klein and
Clifford Stein and
Mikkel Thorup and
Neal E. Young},
title = {Rounding Algorithms for a Geometric Embedding of Minimum Multiway
Cut},
journal = {CoRR},
volume = {cs.DS/0205051},
year = {2002},
url = {https://arxiv.org/abs/cs/0205051},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/mg/CormenLRS01,
author = {Thomas H. Cormen and
Charles E. Leiserson and
Ronald L. Rivest and
Clifford Stein},
title = {Introduction to Algorithms, Second Edition},
publisher = {The {MIT} Press and McGraw-Hill Book Company},
year = {2001},
isbn = {0-262-03293-7},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/mg/CormenLRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/Bailey-KelloggKSD01,
author = {Christopher Bailey{-}Kellogg and
John J. Kelley and
Clifford Stein and
Bruce Randall Donald},
title = {Reducing Mass Degeneracy in {SAR} by {MS} by Stable Isotopic Labeling},
journal = {J. Comput. Biol.},
volume = {8},
number = {1},
pages = {19--36},
year = {2001},
url = {https://doi.org/10.1089/106652701300099056},
doi = {10.1089/106652701300099056},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcb/Bailey-KelloggKSD01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriMNS01,
author = {Chandra Chekuri and
Rajeev Motwani and
B. Natarajan and
Clifford Stein},
title = {Approximation Techniques for Average Completion Time Scheduling},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {1},
pages = {146--166},
year = {2001},
url = {https://doi.org/10.1137/S0097539797327180},
doi = {10.1137/S0097539797327180},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriMNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KolliopoulosS01,
author = {Stavros G. Kolliopoulos and
Clifford Stein},
title = {Approximation Algorithms for Single-Source Unsplittable Flow},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {919--946},
year = {2001},
url = {https://doi.org/10.1137/S0097539799355314},
doi = {10.1137/S0097539799355314},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KolliopoulosS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/agents/XieRS01,
author = {Rong Xie and
Daniela Rus and
Clifford Stein},
editor = {Elisabeth Andr{\'{e}} and
Sandip Sen and
Claude Frasson and
J{\"{o}}rg P. M{\"{u}}ller},
title = {Scheduling multi-task multi-agent systems},
booktitle = {Proceedings of the Fifth International Conference on Autonomous Agents,
{AGENTS} 2001, Montreal, Canada, May 28 - June 1, 2001},
pages = {159--160},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/375735.376036},
doi = {10.1145/375735.376036},
timestamp = {Mon, 03 Mar 2025 20:57:03 +0100},
biburl = {https://dblp.org/rec/conf/agents/XieRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HepnerS01,
author = {Clint Hepner and
Clifford Stein},
editor = {Adam L. Buchsbaum and
Jack Snoeyink},
title = {Implementation of a {PTAS} for Scheduling with Release Dates},
booktitle = {Algorithm Engineering and Experimentation, Third International Workshop,
{ALENEX} 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2153},
pages = {202--215},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44808-X\_17},
doi = {10.1007/3-540-44808-X\_17},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/HepnerS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/SteinW01,
author = {Clifford Stein and
David P. Wagner},
editor = {Karen I. Aardal and
Bert Gerards},
title = {Approximation Algorithms for the Minimum Bends Traveling Salesman
Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International
{IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2081},
pages = {406--422},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45535-3\_32},
doi = {10.1007/3-540-45535-3\_32},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/SteinW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/Stein01,
author = {Clifford Stein},
title = {Simultaneously optimizing two scheduling objectives},
booktitle = {Proceedings of the 15th International Parallel {\&} Distributed
Processing Symposium (IPDPS-01), San Francisco, CA, USA, April 23-27,
2001},
pages = {198},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/IPDPS.2001.925210},
doi = {10.1109/IPDPS.2001.925210},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/Stein01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ma/XieRS01,
author = {Rong Xie and
Daniela Rus and
Clifford Stein},
editor = {Gian Pietro Picco},
title = {Scheduling Multi-task Agents},
booktitle = {Mobile Agents, 5th International Conference, {MA} 2001 Atlanta, GA,
USA, December 2-4, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2240},
pages = {260--276},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45647-3\_18},
doi = {10.1007/3-540-45647-3\_18},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ma/XieRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismb/Bailey-KelloggKSD00,
author = {Christopher Bailey{-}Kellogg and
John J. Kelley and
Clifford Stein and
Bruce Randall Donald},
editor = {Philip E. Bourne and
Michael Gribskov and
Russ B. Altman and
Nancy Jensen and
Debra A. Hope and
Thomas Lengauer and
Julie C. Mitchell and
Eric D. Scheeff and
Chris Smith and
Shawn Strande and
Helge Weissig},
title = {Reducing Mass Degeneracy in {SAR} by {MS} by Stable Isotopic Labeling},
booktitle = {Proceedings of the Eighth International Conference on Intelligent
Systems for Molecular Biology, August 19-23, 2000, La Jolla / San
Diego, CA, {USA}},
pages = {13--24},
publisher = {{AAAI}},
year = {2000},
url = {http://www.aaai.org/Library/ISMB/2000/ismb00-002.php},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ismb/Bailey-KelloggKSD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/AslamLS00,
author = {Javed A. Aslam and
Alain Leblanc and
Clifford Stein},
editor = {Stefan N{\"{a}}her and
Dorothea Wagner},
title = {Clustering Data without Prior Knowledge},
booktitle = {Algorithm Engineering, 4th International Workshop, {WAE} 2000, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1982},
pages = {74--86},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44691-5\_7},
doi = {10.1007/3-540-44691-5\_7},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wae/AslamLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AfratiBCKKKMQSSS99,
author = {Foto N. Afrati and
Evripidis Bampis and
Chandra Chekuri and
David R. Karger and
Claire Kenyon and
Sanjeev Khanna and
Ioannis Milis and
Maurice Queyranne and
Martin Skutella and
Clifford Stein and
Maxim Sviridenko},
title = {Approximation Schemes for Minimizing Average Weighted Completion Time
with Release Dates},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} 1999,
New York, NY, USA, October 17-18, 1999},
pages = {32--44},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814574},
doi = {10.1109/SFFCS.1999.814574},
timestamp = {Tue, 08 Jul 2025 16:42:44 +0200},
biburl = {https://dblp.org/rec/conf/focs/AfratiBCKKKMQSSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KolliopoulosS99,
author = {Stavros G. Kolliopoulos and
Clifford Stein},
editor = {G{\'{e}}rard Cornu{\'{e}}jols and
Rainer E. Burkard and
Gerhard J. Woeginger},
title = {Experimental Evaluation of Approximation Algorithms for Single-Source
Unsplittable Flow},
booktitle = {Integer Programming and Combinatorial Optimization, 7th International
{IPCO} Conference, Graz, Austria, June 9-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1610},
pages = {328--344},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48777-8\_25},
doi = {10.1007/3-540-48777-8\_25},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KolliopoulosS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AslamRSY99,
author = {Javed A. Aslam and
April Rasala and
Clifford Stein and
Neal E. Young},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Improved Bicriteria Existence Theorems for Scheduling},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {846--847},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314963},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AslamRSY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KargerKSTY99,
author = {David R. Karger and
Philip N. Klein and
Clifford Stein and
Mikkel Thorup and
Neal E. Young},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Rounding Algorithms for a Geometric Embedding of Minimum Multiway
Cut},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {668--678},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301430},
doi = {10.1145/301250.301430},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KargerKSTY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/99/KargerSW99,
author = {David R. Karger and
Cliff Stein and
Joel Wein},
editor = {Mikhail J. Atallah},
title = {Scheduling Algorithms},
booktitle = {Algorithms and Theory of Computation Handbook},
series = {Chapman {\&} Hall/CRC Applied Algorithms and Data Structures series},
publisher = {{CRC} Press},
year = {1999},
url = {https://doi.org/10.1201/9781420049503-c36},
doi = {10.1201/9781420049503-C36},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/crc/99/KargerSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ArmenS98,
author = {Chris Armen and
Clifford Stein},
title = {A 2 2/3 Superstring Approximation Algorithm},
journal = {Discret. Appl. Math.},
volume = {88},
number = {1-3},
pages = {29--57},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)00065-1},
doi = {10.1016/S0166-218X(98)00065-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ArmenS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KolliopoulosS98,
author = {Stavros G. Kolliopoulos and
Clifford Stein},
title = {Finding Real-Valued Single-Source Shortest Paths in \emph{o(n\({}^{\mbox{3}}\))}
Expected Time},
journal = {J. Algorithms},
volume = {28},
number = {1},
pages = {125--141},
year = {1998},
url = {https://doi.org/10.1006/jagm.1998.0937},
doi = {10.1006/JAGM.1998.0937},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KolliopoulosS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PhillipsSSSW98,
author = {Cynthia A. Phillips and
Andreas S. Schulz and
David B. Shmoys and
Clifford Stein and
Joel Wein},
title = {Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem},
journal = {J. Comb. Optim.},
volume = {1},
number = {4},
pages = {413--426},
year = {1998},
url = {https://doi.org/10.1023/A:1009750913529},
doi = {10.1023/A:1009750913529},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PhillipsSSSW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/PhillipsSW98,
author = {Cynthia A. Phillips and
Clifford Stein and
Joel Wein},
title = {Minimizing average completion time in the presence of release dates},
journal = {Math. Program.},
volume = {82},
pages = {199--223},
year = {1998},
url = {https://doi.org/10.1007/BF01585872},
doi = {10.1007/BF01585872},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/PhillipsSW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KolliopoulosS98,
author = {Stavros G. Kolliopoulos and
Clifford Stein},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing
Integer Programs},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {153--168},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_12},
doi = {10.1007/3-540-69346-7\_12},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KolliopoulosS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GoldbergOPS98,
author = {Andrew V. Goldberg and
Jeffrey D. Oldham and
Serge A. Plotkin and
Clifford Stein},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost
Multicommodity Flow},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {338--352},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_26},
doi = {10.1007/3-540-69346-7\_26},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/GoldbergOPS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/FizzanoKSW97,
author = {Perry Fizzano and
David R. Karger and
Clifford Stein and
Joel Wein},
title = {Distributed Job Scheduling in Rings},
journal = {J. Parallel Distributed Comput.},
volume = {45},
number = {2},
pages = {122--133},
year = {1997},
url = {https://doi.org/10.1006/jpdc.1997.1373},
doi = {10.1006/JPDC.1997.1373},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jpdc/FizzanoKSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SteinW97,
author = {Clifford Stein and
Joel Wein},
title = {On the existence of schedules that are near-optimal for both makespan
and total weighted completion time},
journal = {Oper. Res. Lett.},
volume = {21},
number = {3},
pages = {115--122},
year = {1997},
url = {https://doi.org/10.1016/S0167-6377(97)00025-4},
doi = {10.1016/S0167-6377(97)00025-4},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SteinW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/PhillipsSW97,
author = {Cynthia A. Phillips and
Clifford Stein and
Joel Wein},
title = {Task Scheduling in Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {4},
pages = {573--598},
year = {1997},
url = {https://doi.org/10.1137/S0895480194279057},
doi = {10.1137/S0895480194279057},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/PhillipsSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KolliopoulosS97,
author = {Stavros G. Kolliopoulos and
Clifford Stein},
title = {Improved Approximation Algorithms for Unsplittable Flow Problems},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} 1997,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {426--435},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646131},
doi = {10.1109/SFCS.1997.646131},
timestamp = {Tue, 08 Jul 2025 16:43:15 +0200},
biburl = {https://dblp.org/rec/conf/focs/KolliopoulosS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriGKLS97,
author = {Chandra Chekuri and
Andrew V. Goldberg and
David R. Karger and
Matthew S. Levine and
Clifford Stein},
editor = {Michael E. Saks},
title = {Experimental Study of Minimum Cut Algorithms},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {324--333},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314315},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriGKLS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriMNS97,
author = {Chandra Chekuri and
Rajeev Motwani and
B. Natarajan and
Clifford Stein},
editor = {Michael E. Saks},
title = {Approximation Techniques for Average Completion Time Scheduling},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {609--618},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314396},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChekuriMNS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PhillipsSTW97,
author = {Cynthia A. Phillips and
Clifford Stein and
Eric Torng and
Joel Wein},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Optimal Time-Critical Scheduling via Resource Augmentation (Extended
Abstract)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {140--149},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258570},
doi = {10.1145/258533.258570},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PhillipsSTW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KargerS96,
author = {David R. Karger and
Clifford Stein},
title = {A New Approach to the Minimum Cut Problem},
journal = {J. {ACM}},
volume = {43},
number = {4},
pages = {601--640},
year = {1996},
url = {https://doi.org/10.1145/234533.234534},
doi = {10.1145/234533.234534},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KargerS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ArmenS96,
author = {Chris Armen and
Clifford Stein},
editor = {Daniel S. Hirschberg and
Eugene W. Myers},
title = {A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem},
booktitle = {Combinatorial Pattern Matching, 7th Annual Symposium, {CPM} 96, Laguna
Beach, California, USA, June 10-12, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1075},
pages = {87--101},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61258-0\_8},
doi = {10.1007/3-540-61258-0\_8},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ArmenS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChakrabartiPSSSW96,
author = {Soumen Chakrabarti and
Cynthia A. Phillips and
Andreas S. Schulz and
David B. Shmoys and
Clifford Stein and
Joel Wein},
editor = {Friedhelm Meyer auf der Heide and
Burkhard Monien},
title = {Improved Scheduling Algorithms for Minsum Criteria},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium,
ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1099},
pages = {646--657},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61440-0\_166},
doi = {10.1007/3-540-61440-0\_166},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChakrabartiPSSSW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/KolliopoulosS96,
author = {Stavros G. Kolliopoulos and
Clifford Stein},
editor = {William H. Cunningham and
S. Thomas McCormick and
Maurice Queyranne},
title = {Finding Real-Valued Single-Source Shortest Paths},
booktitle = {Integer Programming and Combinatorial Optimization, 5th International
{IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1084},
pages = {94--104},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61310-2\_8},
doi = {10.1007/3-540-61310-2\_8},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/KolliopoulosS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/ArmenS95,
author = {Chris Armen and
Clifford Stein},
title = {Short Superstrings and the Structure of Overlapping Strings},
journal = {J. Comput. Biol.},
volume = {2},
number = {2},
pages = {307--332},
year = {1995},
url = {https://doi.org/10.1089/cmb.1995.2.307},
doi = {10.1089/CMB.1995.2.307},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcb/ArmenS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LeightonMPSST95,
author = {Frank Thomson Leighton and
Fillia Makedon and
Serge A. Plotkin and
Clifford Stein and
{\'{E}}va Tardos and
Spyros Tragoudas},
title = {Fast Approximation Algorithms for Multicommodity Flow Problems},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {228--243},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1020},
doi = {10.1006/JCSS.1995.1020},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LeightonMPSST95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/PhillipsSW95,
author = {Cynthia A. Phillips and
Clifford Stein and
Joel Wein},
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Scheduling Jobs that Arrive Over Time (Extended Abstract)},
booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {86--97},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8\_53},
doi = {10.1007/3-540-60220-8\_53},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/PhillipsSW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ArmenS95,
author = {Chris Armen and
Clifford Stein},
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Improved Length Bounds for the Shortest Superstring Problem (Extended
Abstract)},
booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {494--505},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8\_88},
doi = {10.1007/3-540-60220-8\_88},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ArmenS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KleinPST94,
author = {Philip N. Klein and
Serge A. Plotkin and
Clifford Stein and
{\'{E}}va Tardos},
title = {Faster Approximation Algorithms for the Unit Capacity Concurrent Flow
Problem with Applications to Routing and Finding Sparse Cuts},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {3},
pages = {466--487},
year = {1994},
url = {https://doi.org/10.1137/S0097539792241175},
doi = {10.1137/S0097539792241175},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KleinPST94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShmoysSW94,
author = {David B. Shmoys and
Clifford Stein and
Joel Wein},
title = {Improved Approximation Algorithms for Shop Scheduling Problems},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {3},
pages = {617--632},
year = {1994},
url = {https://doi.org/10.1137/S009753979222676X},
doi = {10.1137/S009753979222676X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShmoysSW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AhujaOST94,
author = {Ravindra K. Ahuja and
James B. Orlin and
Clifford Stein and
Robert Endre Tarjan},
title = {Improved Algorithms for Bipartite Network Flow},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {5},
pages = {906--933},
year = {1994},
url = {https://doi.org/10.1137/S0097539791199334},
doi = {10.1137/S0097539791199334},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AhujaOST94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KosarajuPS94,
author = {S. Rao Kosaraju and
James K. Park and
Clifford Stein},
title = {Long Tours and Short Superstrings (Preliminary Version)},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, November 20-22, 1994},
pages = {166--177},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365696},
doi = {10.1109/SFCS.1994.365696},
timestamp = {Sun, 02 Nov 2025 21:27:17 +0100},
biburl = {https://dblp.org/rec/conf/focs/KosarajuPS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/FizzanoKSW94,
author = {Perry Fizzano and
David R. Karger and
Clifford Stein and
Joel Wein},
editor = {Lawrence Snyder and
Charles E. Leiserson},
title = {Job Scheduling in Rings},
booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '94, Cape May, New Jersey, USA, June 27-29,
1994},
pages = {210--219},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/181014.181333},
doi = {10.1145/181014.181333},
timestamp = {Mon, 29 Jul 2024 11:07:21 +0200},
biburl = {https://dblp.org/rec/conf/spaa/FizzanoKSW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PhillipsSW94,
author = {Cynthia A. Phillips and
Clifford Stein and
Joel Wein},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Task Scheduling in Networks (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {290--301},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_27},
doi = {10.1007/3-540-58218-5\_27},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PhillipsSW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KleinS93,
author = {Philip N. Klein and
Clifford Stein},
title = {A Parallel Algorithm for Approximating the Minimum Cycle Cover},
journal = {Algorithmica},
volume = {9},
number = {1},
pages = {23--31},
year = {1993},
url = {https://doi.org/10.1007/BF01185336},
doi = {10.1007/BF01185336},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KleinS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/OrlinS93,
author = {James B. Orlin and
Clifford Stein},
title = {Parallel algorithms for the assignment and minimum-cost flow problems},
journal = {Oper. Res. Lett.},
volume = {14},
number = {4},
pages = {181--186},
year = {1993},
url = {https://doi.org/10.1016/0167-6377(93)90068-R},
doi = {10.1016/0167-6377(93)90068-R},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/OrlinS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KargerS93,
author = {David R. Karger and
Clifford Stein},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {An O{\textasciitilde}(n\({}^{\mbox{2}}\)) algorithm for minimum cuts},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {757--765},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167281},
doi = {10.1145/167088.167281},
timestamp = {Mon, 26 May 2025 08:18:30 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KargerS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Stein92,
author = {Clifford Stein},
title = {Approximation algorithms for multicommodity flow and shop scheduling
problems},
school = {Massachusetts Institute of Technology, Cambridge, MA, {USA}},
year = {1992},
url = {https://hdl.handle.net/1721.1/12867},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Stein92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SteinW92,
author = {Clifford Stein and
Joel Wein},
title = {Approximating the Minimum-Cost Maximum Flow is P-Complete},
journal = {Inf. Process. Lett.},
volume = {42},
number = {6},
pages = {315--319},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90229-O},
doi = {10.1016/0020-0190(92)90229-O},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/SteinW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/LeongSS91,
author = {Tishya Leong and
Peter W. Shor and
Clifford Stein},
editor = {David S. Johnson and
Catherine C. McGeoch},
title = {Implementation of a Combinatorial Multicommodity Flow Algorithm},
booktitle = {Network Flows And Matching, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, October 14-16, 1991},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {12},
pages = {387--405},
publisher = {{DIMACS/AMS}},
year = {1991},
url = {https://doi.org/10.1090/dimacs/012/15},
doi = {10.1090/DIMACS/012/15},
timestamp = {Mon, 26 May 2025 08:18:30 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/LeongSS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ShmoysSW91,
author = {David B. Shmoys and
Clifford Stein and
Joel Wein},
editor = {Alok Aggarwal},
title = {Improved Approximation Algorithms for Shop Scheduling Problems},
booktitle = {Proceedings of the Second Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1991, San Francisco, California, {USA}},
pages = {148--157},
publisher = {{ACM/SIAM}},
year = {1991},
url = {http://dl.acm.org/citation.cfm?id=127787.127819},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ShmoysSW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeightonMPSTT91,
author = {Frank Thomson Leighton and
Fillia Makedon and
Serge A. Plotkin and
Clifford Stein and
{\'{E}}va Tardos and
Spyros Tragoudas},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Fast Approximation Algorithms for Multicommodity Flow Problems},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {101--111},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103425},
doi = {10.1145/103418.103425},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LeightonMPSTT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KleinS90,
author = {Philip N. Klein and
Clifford Stein},
title = {A Parallel Algorithm for Eliminating Cycles in Undirected Graphs},
journal = {Inf. Process. Lett.},
volume = {34},
number = {6},
pages = {307--312},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90015-P},
doi = {10.1016/0020-0190(90)90015-P},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KleinS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleinST90,
author = {Philip N. Klein and
Clifford Stein and
{\'{E}}va Tardos},
editor = {Harriet Ortiz},
title = {Leighton-Rao Might Be Practical: Faster Approximation Algorithms for
Concurrent Flow with Uniform Capacities},
booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing,
May 13-17, 1990, Baltimore, Maryland, {USA}},
pages = {310--321},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/100216.100257},
doi = {10.1145/100216.100257},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KleinST90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-28 23:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: