BibTeX records: Michele Scquizzato

download as .bib file

@article{DBLP:journals/talg/PesericoS23,
  author       = {Enoch Peserico and
                  Michele Scquizzato},
  title        = {Matching on the Line Admits no o({\(\surd\)}log n)-Competitive Algorithm},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {19},
  number       = {3},
  pages        = {28:1--28:4},
  year         = {2023},
  url          = {https://doi.org/10.1145/3594873},
  doi          = {10.1145/3594873},
  timestamp    = {Fri, 18 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/PesericoS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dc/NanongkaiS22,
  author       = {Danupon Nanongkai and
                  Michele Scquizzato},
  title        = {Equivalence classes and conditional hardness in massively parallel
                  computations},
  journal      = {Distributed Comput.},
  volume       = {35},
  number       = {2},
  pages        = {165--183},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00446-021-00418-2},
  doi          = {10.1007/S00446-021-00418-2},
  timestamp    = {Fri, 13 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dc/NanongkaiS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/spaa/AgrawalBDKPS22,
  author       = {Kunal Agrawal and
                  Michael A. Bender and
                  Rathish Das and
                  William Kuszmaul and
                  Enoch Peserico and
                  Michele Scquizzato},
  editor       = {Kunal Agrawal and
                  I{-}Ting Angelina Lee},
  title        = {Online Parallel Paging with Optimal Makespan},
  booktitle    = {{SPAA} '22: 34th {ACM} Symposium on Parallelism in Algorithms and
                  Architectures, Philadelphia, PA, USA, July 11 - 14, 2022},
  pages        = {205--216},
  publisher    = {{ACM}},
  year         = {2022},
  url          = {https://doi.org/10.1145/3490148.3538577},
  doi          = {10.1145/3490148.3538577},
  timestamp    = {Tue, 12 Jul 2022 14:22:25 +0200},
  biburl       = {https://dblp.org/rec/conf/spaa/AgrawalBDKPS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/topc/PanduranganRS21,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  title        = {On the Distributed Complexity of Large-Scale Graph Computations},
  journal      = {{ACM} Trans. Parallel Comput.},
  volume       = {8},
  number       = {2},
  pages        = {7:1--7:28},
  year         = {2021},
  url          = {https://doi.org/10.1145/3460900},
  doi          = {10.1145/3460900},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/topc/PanduranganRS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/PesericoS21,
  author       = {Enoch Peserico and
                  Michele Scquizzato},
  editor       = {Nikhil Bansal and
                  Emanuela Merelli and
                  James Worrell},
  title        = {Matching on the Line Admits No o({\(\surd\)}log n)-Competitive Algorithm},
  booktitle    = {48th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {198},
  pages        = {103:1--103:3},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2021.103},
  doi          = {10.4230/LIPICS.ICALP.2021.103},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/PesericoS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/AgrawalBDKPS21,
  author       = {Kunal Agrawal and
                  Michael A. Bender and
                  Rathish Das and
                  William Kuszmaul and
                  Enoch Peserico and
                  Michele Scquizzato},
  editor       = {D{\'{a}}niel Marx},
  title        = {Tight Bounds for Parallel Paging and Green Paging},
  booktitle    = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2021, Virtual Conference, January 10 - 13, 2021},
  pages        = {3022--3041},
  publisher    = {{SIAM}},
  year         = {2021},
  url          = {https://doi.org/10.1137/1.9781611976465.180},
  doi          = {10.1137/1.9781611976465.180},
  timestamp    = {Thu, 15 Jul 2021 13:48:55 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AgrawalBDKPS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/talg/Pandurangan0S20,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  title        = {A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning
                  Trees},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {16},
  number       = {1},
  pages        = {13:1--13:27},
  year         = {2020},
  url          = {https://doi.org/10.1145/3365005},
  doi          = {10.1145/3365005},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/Pandurangan0S20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PanduranganPS20,
  author       = {Gopal Pandurangan and
                  David Peleg and
                  Michele Scquizzato},
  title        = {Message lower bounds via efficient network synchronization},
  journal      = {Theor. Comput. Sci.},
  volume       = {810},
  pages        = {82--95},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2018.11.017},
  doi          = {10.1016/J.TCS.2018.11.017},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/PanduranganPS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/spaa/AgrawalBDKPS20,
  author       = {Kunal Agrawal and
                  Michael A. Bender and
                  Rathish Das and
                  William Kuszmaul and
                  Enoch Peserico and
                  Michele Scquizzato},
  editor       = {Christian Scheideler and
                  Michael Spear},
  title        = {Green Paging and Parallel Paging},
  booktitle    = {{SPAA} '20: 32nd {ACM} Symposium on Parallelism in Algorithms and
                  Architectures, Virtual Event, USA, July 15-17, 2020},
  pages        = {493--495},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3350755.3400231},
  doi          = {10.1145/3350755.3400231},
  timestamp    = {Sun, 12 Jul 2020 18:55:23 +0200},
  biburl       = {https://dblp.org/rec/conf/spaa/AgrawalBDKPS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2001-02191,
  author       = {Danupon Nanongkai and
                  Michele Scquizzato},
  title        = {Equivalence Classes and Conditional Hardness in Massively Parallel
                  Computations},
  journal      = {CoRR},
  volume       = {abs/2001.02191},
  year         = {2020},
  url          = {http://arxiv.org/abs/2001.02191},
  eprinttype    = {arXiv},
  eprint       = {2001.02191},
  timestamp    = {Mon, 13 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2001-02191.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2012-15593,
  author       = {Enoch Peserico and
                  Michele Scquizzato},
  title        = {Matching on the line admits no {\textdollar}o({\textbackslash}sqrt\{{\textbackslash}log
                  n\}){\textdollar}-competitive algorithm},
  journal      = {CoRR},
  volume       = {abs/2012.15593},
  year         = {2020},
  url          = {https://arxiv.org/abs/2012.15593},
  eprinttype    = {arXiv},
  eprint       = {2012.15593},
  timestamp    = {Fri, 08 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2012-15593.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AntoniadisBNPS19,
  author       = {Antonios Antoniadis and
                  Neal Barcelo and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  title        = {A o(n)-Competitive Deterministic Algorithm for Online Matching on
                  a Line},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {7},
  pages        = {2917--2933},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00453-019-00565-w},
  doi          = {10.1007/S00453-019-00565-W},
  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AntoniadisBNPS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/opodis/NanongkaiS19,
  author       = {Danupon Nanongkai and
                  Michele Scquizzato},
  editor       = {Pascal Felber and
                  Roy Friedman and
                  Seth Gilbert and
                  Avery Miller},
  title        = {Equivalence Classes and Conditional Hardness in Massively Parallel
                  Computations},
  booktitle    = {23rd International Conference on Principles of Distributed Systems,
                  {OPODIS} 2019, December 17-19, 2019, Neuch{\^{a}}tel, Switzerland},
  series       = {LIPIcs},
  volume       = {153},
  pages        = {33:1--33:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.OPODIS.2019.33},
  doi          = {10.4230/LIPICS.OPODIS.2019.33},
  timestamp    = {Wed, 12 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/opodis/NanongkaiS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eatcs/Pandurangan0S18,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  title        = {The Distributed Minimum Spanning Tree Problem},
  journal      = {Bull. {EATCS}},
  volume       = {125},
  year         = {2018},
  url          = {http://eatcs.org/beatcs/index.php/beatcs/article/view/538},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eatcs/Pandurangan0S18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/topc/BilardiSS18,
  author       = {Gianfranco Bilardi and
                  Michele Scquizzato and
                  Francesco Silvestri},
  title        = {A Lower Bound Technique for Communication in {BSP}},
  journal      = {{ACM} Trans. Parallel Comput.},
  volume       = {4},
  number       = {3},
  pages        = {14:1--14:27},
  year         = {2018},
  url          = {https://doi.org/10.1145/3181776},
  doi          = {10.1145/3181776},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/topc/BilardiSS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/topc/PanduranganRS18,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  title        = {Fast Distributed Algorithms for Connectivity and {MST} in Large Graphs},
  journal      = {{ACM} Trans. Parallel Comput.},
  volume       = {5},
  number       = {1},
  pages        = {4:1--4:22},
  year         = {2018},
  url          = {https://doi.org/10.1145/3209689},
  doi          = {10.1145/3209689},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/topc/PanduranganRS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/spaa/Pandurangan0S18,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  editor       = {Christian Scheideler and
                  Jeremy T. Fineman},
  title        = {On the Distributed Complexity of Large-Scale Graph Computations},
  booktitle    = {Proceedings of the 30th on Symposium on Parallelism in Algorithms
                  and Architectures, {SPAA} 2018, Vienna, Austria, July 16-18, 2018},
  pages        = {405--414},
  publisher    = {{ACM}},
  year         = {2018},
  url          = {https://doi.org/10.1145/3210377.3210409},
  doi          = {10.1145/3210377.3210409},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/spaa/Pandurangan0S18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/AntoniadisBCKNP17,
  author       = {Antonios Antoniadis and
                  Neal Barcelo and
                  Mario E. Consuegra and
                  Peter Kling and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  title        = {Efficient Computation of Optimal Energy and Fractional Weighted Flow
                  Trade-Off Schedules},
  journal      = {Algorithmica},
  volume       = {79},
  number       = {2},
  pages        = {568--597},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00453-016-0208-x},
  doi          = {10.1007/S00453-016-0208-X},
  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AntoniadisBCKNP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/Pandurangan0S17,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  editor       = {Hamed Hatami and
                  Pierre McKenzie and
                  Valerie King},
  title        = {A time- and message-optimal distributed algorithm for minimum spanning
                  trees},
  booktitle    = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages        = {743--756},
  publisher    = {{ACM}},
  year         = {2017},
  url          = {https://doi.org/10.1145/3055399.3055449},
  doi          = {10.1145/3055399.3055449},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/Pandurangan0S17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BilardiS017,
  author       = {Gianfranco Bilardi and
                  Michele Scquizzato and
                  Francesco Silvestri},
  title        = {A Lower Bound Technique for Communication in {BSP}},
  journal      = {CoRR},
  volume       = {abs/1707.02229},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.02229},
  eprinttype    = {arXiv},
  eprint       = {1707.02229},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BilardiS017.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jacm/BilardiPPS016,
  author       = {Gianfranco Bilardi and
                  Andrea Pietracaprina and
                  Geppino Pucci and
                  Michele Scquizzato and
                  Francesco Silvestri},
  title        = {Network-Oblivious Algorithms},
  journal      = {J. {ACM}},
  volume       = {63},
  number       = {1},
  pages        = {3:1--3:36},
  year         = {2016},
  url          = {https://doi.org/10.1145/2812804},
  doi          = {10.1145/2812804},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BilardiPPS016.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/latin/AntoniadisBNPSS16,
  author       = {Antonios Antoniadis and
                  Neal Barcelo and
                  Michael Nugent and
                  Kirk Pruhs and
                  Kevin Schewior and
                  Michele Scquizzato},
  editor       = {Evangelos Kranakis and
                  Gonzalo Navarro and
                  Edgar Ch{\'{a}}vez},
  title        = {Chasing Convex Bodies and Functions},
  booktitle    = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
                  Ensenada, Mexico, April 11-15, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9644},
  pages        = {68--81},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-662-49529-2\_6},
  doi          = {10.1007/978-3-662-49529-2\_6},
  timestamp    = {Wed, 28 Feb 2024 00:16:41 +0100},
  biburl       = {https://dblp.org/rec/conf/latin/AntoniadisBNPSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sirocco/PanduranganPS16,
  author       = {Gopal Pandurangan and
                  David Peleg and
                  Michele Scquizzato},
  editor       = {Jukka Suomela},
  title        = {Message Lower Bounds via Efficient Network Synchronization},
  booktitle    = {Structural Information and Communication Complexity - 23rd International
                  Colloquium, {SIROCCO} 2016, Helsinki, Finland, July 19-21, 2016, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9988},
  pages        = {75--91},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-48314-6\_6},
  doi          = {10.1007/978-3-319-48314-6\_6},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/PanduranganPS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/spaa/Pandurangan0S16,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  editor       = {Christian Scheideler and
                  Seth Gilbert},
  title        = {Fast Distributed Algorithms for Connectivity and {MST} in Large Graphs},
  booktitle    = {Proceedings of the 28th {ACM} Symposium on Parallelism in Algorithms
                  and Architectures, {SPAA} 2016, Asilomar State Beach/Pacific Grove,
                  CA, USA, July 11-13, 2016},
  pages        = {429--438},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2935764.2935785},
  doi          = {10.1145/2935764.2935785},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/spaa/Pandurangan0S16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Pandurangan0S16,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  title        = {Tight Bounds for Distributed Graph Computations},
  journal      = {CoRR},
  volume       = {abs/1602.08481},
  year         = {2016},
  url          = {http://arxiv.org/abs/1602.08481},
  eprinttype    = {arXiv},
  eprint       = {1602.08481},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Pandurangan0S16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Pandurangan0S16a,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  title        = {A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning
                  Trees},
  journal      = {CoRR},
  volume       = {abs/1607.06883},
  year         = {2016},
  url          = {http://arxiv.org/abs/1607.06883},
  eprinttype    = {arXiv},
  eprint       = {1607.06883},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Pandurangan0S16a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/green/BarceloNPS15,
  author       = {Neal Barcelo and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  title        = {The power of heterogeneity in Near-Threshold Computing},
  booktitle    = {Sixth International Green and Sustainable Computing Conference, {IGSC}
                  2015, Las Vegas, NV, USA, December 14-16, 2015},
  pages        = {1--4},
  publisher    = {{IEEE} Computer Society},
  year         = {2015},
  url          = {https://doi.org/10.1109/IGCC.2015.7393700},
  doi          = {10.1109/IGCC.2015.7393700},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/green/BarceloNPS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/BarceloKNPS15,
  author       = {Neal Barcelo and
                  Peter Kling and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  editor       = {Giuseppe F. Italiano and
                  Giovanni Pighizzini and
                  Donald Sannella},
  title        = {On the Complexity of Speed Scaling},
  booktitle    = {Mathematical Foundations of Computer Science 2015 - 40th International
                  Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
                  Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9235},
  pages        = {75--89},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48054-0\_7},
  doi          = {10.1007/978-3-662-48054-0\_7},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/BarceloKNPS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/BarceloNPS15,
  author       = {Neal Barcelo and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  editor       = {Giuseppe F. Italiano and
                  Giovanni Pighizzini and
                  Donald Sannella},
  title        = {Almost All Functions Require Exponential Energy},
  booktitle    = {Mathematical Foundations of Computer Science 2015 - 40th International
                  Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
                  Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {9235},
  pages        = {90--101},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48054-0\_8},
  doi          = {10.1007/978-3-662-48054-0\_8},
  timestamp    = {Thu, 25 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/BarceloNPS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/podc/HegemanPPSS15,
  author       = {James W. Hegeman and
                  Gopal Pandurangan and
                  Sriram V. Pemmaraju and
                  Vivek B. Sardeshmukh and
                  Michele Scquizzato},
  editor       = {Chryssis Georgiou and
                  Paul G. Spirakis},
  title        = {Toward Optimal Bounds in the Congested Clique: Graph Connectivity
                  and {MST}},
  booktitle    = {Proceedings of the 2015 {ACM} Symposium on Principles of Distributed
                  Computing, {PODC} 2015, Donostia-San Sebasti{\'{a}}n, Spain,
                  July 21 - 23, 2015},
  pages        = {91--100},
  publisher    = {{ACM}},
  year         = {2015},
  url          = {https://doi.org/10.1145/2767386.2767434},
  doi          = {10.1145/2767386.2767434},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/podc/HegemanPPSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Pandurangan0S15,
  author       = {Gopal Pandurangan and
                  Peter Robinson and
                  Michele Scquizzato},
  title        = {Almost Optimal Distributed Algorithms for Large-Scale Graph Problems},
  journal      = {CoRR},
  volume       = {abs/1503.02353},
  year         = {2015},
  url          = {http://arxiv.org/abs/1503.02353},
  eprinttype    = {arXiv},
  eprint       = {1503.02353},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Pandurangan0S15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/green/AntoniadisBNPS14,
  author       = {Antonios Antoniadis and
                  Neal Barcelo and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  title        = {Complexity-theoretic obstacles to achieving energy savings with near-threshold
                  computing},
  booktitle    = {International Green Computing Conference, {IGCC} 2014, Dallas, TX,
                  USA, November 3-5, 2014},
  pages        = {1--8},
  publisher    = {{IEEE} Computer Society},
  year         = {2014},
  url          = {https://doi.org/10.1109/IGCC.2014.7039142},
  doi          = {10.1109/IGCC.2014.7039142},
  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/green/AntoniadisBNPS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/innovations/AntoniadisBNPS14,
  author       = {Antonios Antoniadis and
                  Neal Barcelo and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  editor       = {Moni Naor},
  title        = {Energy-efficient circuit design},
  booktitle    = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
                  USA, January 12-14, 2014},
  pages        = {303--312},
  publisher    = {{ACM}},
  year         = {2014},
  url          = {https://doi.org/10.1145/2554797.2554826},
  doi          = {10.1145/2554797.2554826},
  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/AntoniadisBNPS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/AntoniadisBCKNPS14,
  author       = {Antonios Antoniadis and
                  Neal Barcelo and
                  Mario E. Consuegra and
                  Peter Kling and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  editor       = {Ernst W. Mayr and
                  Natacha Portier},
  title        = {Efficient Computation of Optimal Energy and Fractional Weighted Flow
                  Trade-off Schedules},
  booktitle    = {31st International Symposium on Theoretical Aspects of Computer Science
                  {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
  series       = {LIPIcs},
  volume       = {25},
  pages        = {63--74},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2014},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2014.63},
  doi          = {10.4230/LIPICS.STACS.2014.63},
  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/AntoniadisBCKNPS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/ScquizzatoS14,
  author       = {Michele Scquizzato and
                  Francesco Silvestri},
  editor       = {Ernst W. Mayr and
                  Natacha Portier},
  title        = {Communication Lower Bounds for Distributed-Memory Computations},
  booktitle    = {31st International Symposium on Theoretical Aspects of Computer Science
                  {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
  series       = {LIPIcs},
  volume       = {25},
  pages        = {627--638},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2014},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2014.627},
  doi          = {10.4230/LIPICS.STACS.2014.627},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/ScquizzatoS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/waoa/AntoniadisBNPS14,
  author       = {Antonios Antoniadis and
                  Neal Barcelo and
                  Michael Nugent and
                  Kirk Pruhs and
                  Michele Scquizzato},
  editor       = {Evripidis Bampis and
                  Ola Svensson},
  title        = {A o(n) -Competitive Deterministic Algorithm for Online Matching on
                  a Line},
  booktitle    = {Approximation and Online Algorithms - 12th International Workshop,
                  {WAOA} 2014, Wroc{\l}aw, Poland, September 11-12, 2014, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8952},
  pages        = {11--22},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-18263-6\_2},
  doi          = {10.1007/978-3-319-18263-6\_2},
  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/AntoniadisBNPS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BilardiPPSS14,
  author       = {Gianfranco Bilardi and
                  Andrea Pietracaprina and
                  Geppino Pucci and
                  Michele Scquizzato and
                  Francesco Silvestri},
  title        = {Network-Oblivious Algorithms},
  journal      = {CoRR},
  volume       = {abs/1404.3318},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.3318},
  eprinttype    = {arXiv},
  eprint       = {1404.3318},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BilardiPPSS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/ScquizzatoS13,
  author       = {Michele Scquizzato and
                  Francesco Silvestri},
  title        = {Communication Lower Bounds for Distributed-Memory Computations},
  journal      = {CoRR},
  volume       = {abs/1307.1805},
  year         = {2013},
  url          = {http://arxiv.org/abs/1307.1805},
  eprinttype    = {arXiv},
  eprint       = {1307.1805},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ScquizzatoS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/europar/BilardiSS12,
  author       = {Gianfranco Bilardi and
                  Michele Scquizzato and
                  Francesco Silvestri},
  editor       = {Christos Kaklamanis and
                  Theodore S. Papatheodorou and
                  Paul G. Spirakis},
  title        = {A Lower Bound Technique for Communication on {BSP} with Application
                  to the {FFT}},
  booktitle    = {Euro-Par 2012 Parallel Processing - 18th International Conference,
                  Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7484},
  pages        = {676--687},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-32820-6\_67},
  doi          = {10.1007/978-3-642-32820-6\_67},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/europar/BilardiSS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tgc/BertasiPSS10,
  author       = {Paolo Bertasi and
                  Alberto Pettarin and
                  Michele Scquizzato and
                  Francesco Silvestri},
  editor       = {Martin Wirsing and
                  Martin Hofmann and
                  Axel Rauschmayer},
  title        = {A Novel Resource-Driven Job Allocation Scheme for Desktop Grid Environments},
  booktitle    = {Trustworthly Global Computing - 5th International Symposium, {TGC}
                  2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {6084},
  pages        = {268--283},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-15640-3\_18},
  doi          = {10.1007/978-3-642-15640-3\_18},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/tgc/BertasiPSS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.