Published in: DARTS, Volume 7, Issue 2, Special Issue of the 35th European Conference on Object-Oriented Programming (ECOOP 2021)
Ellen Arteca, Frank Tip, and Max Schäfer. Enabling Additional Parallelism in Asynchronous JavaScript Applications (Artifact). In Special Issue of the 35th European Conference on Object-Oriented Programming (ECOOP 2021). Dagstuhl Artifacts Series (DARTS), Volume 7, Issue 2, pp. 5:1-5:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{arteca_et_al:DARTS.7.2.5, author = {Arteca, Ellen and Tip, Frank and Sch\"{a}fer, Max}, title = {{Enabling Additional Parallelism in Asynchronous JavaScript Applications (Artifact)}}, pages = {5:1--5:6}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2021}, volume = {7}, number = {2}, editor = {Arteca, Ellen and Tip, Frank and Sch\"{a}fer, Max}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DARTS.7.2.5}, URN = {urn:nbn:de:0030-drops-140290}, doi = {10.4230/DARTS.7.2.5}, annote = {Keywords: asynchronous programming, refactoring, side-effect analysis, performance optimization, static analysis, JavaScript} }
Published in: LIPIcs, Volume 194, 35th European Conference on Object-Oriented Programming (ECOOP 2021)
Ellen Arteca, Frank Tip, and Max Schäfer. Enabling Additional Parallelism in Asynchronous JavaScript Applications. In 35th European Conference on Object-Oriented Programming (ECOOP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 194, pp. 7:1-7:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{arteca_et_al:LIPIcs.ECOOP.2021.7, author = {Arteca, Ellen and Tip, Frank and Sch\"{a}fer, Max}, title = {{Enabling Additional Parallelism in Asynchronous JavaScript Applications}}, booktitle = {35th European Conference on Object-Oriented Programming (ECOOP 2021)}, pages = {7:1--7:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-190-0}, ISSN = {1868-8969}, year = {2021}, volume = {194}, editor = {M{\o}ller, Anders and Sridharan, Manu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2021.7}, URN = {urn:nbn:de:0030-drops-140501}, doi = {10.4230/LIPIcs.ECOOP.2021.7}, annote = {Keywords: asynchronous programming, refactoring, side-effect analysis, performance optimization, static analysis, JavaScript} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Ruben Brokkelkamp, Sven Polak, Guido Schäfer, and Yllka Velaj. Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{brokkelkamp_et_al:LIPIcs.ISAAC.2019.13, author = {Brokkelkamp, Ruben and Polak, Sven and Sch\"{a}fer, Guido and Velaj, Yllka}, title = {{Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a Node}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.13}, URN = {urn:nbn:de:0030-drops-115091}, doi = {10.4230/LIPIcs.ISAAC.2019.13}, annote = {Keywords: Network pricing, Stackelberg network pricing, betweenness centrality, revenue maximization} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Irving van Heuven van Staereling, Bart de Keijzer, and Guido Schäfer. The Ground-Set-Cost Budgeted Maximum Coverage Problem. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 50:1-50:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{vanheuvenvanstaereling_et_al:LIPIcs.MFCS.2016.50, author = {van Heuven van Staereling, Irving and de Keijzer, Bart and Sch\"{a}fer, Guido}, title = {{The Ground-Set-Cost Budgeted Maximum Coverage Problem}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {50:1--50:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.50}, URN = {urn:nbn:de:0030-drops-65020}, doi = {10.4230/LIPIcs.MFCS.2016.50}, annote = {Keywords: maximum coverage problem, approximation algorithms, hypergraphs, submodular optimization, sponsored search} }
Published in: LIPIcs, Volume 56, 30th European Conference on Object-Oriented Programming (ECOOP 2016)
Pavel Avgustinov, Oege de Moor, Michael Peyton Jones, and Max Schäfer. QL: Object-oriented Queries on Relational Data. In 30th European Conference on Object-Oriented Programming (ECOOP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 56, pp. 2:1-2:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{avgustinov_et_al:LIPIcs.ECOOP.2016.2, author = {Avgustinov, Pavel and de Moor, Oege and Jones, Michael Peyton and Sch\"{a}fer, Max}, title = {{QL: Object-oriented Queries on Relational Data}}, booktitle = {30th European Conference on Object-Oriented Programming (ECOOP 2016)}, pages = {2:1--2:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-014-9}, ISSN = {1868-8969}, year = {2016}, volume = {56}, editor = {Krishnamurthi, Shriram and Lerner, Benjamin S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2016.2}, URN = {urn:nbn:de:0030-drops-60968}, doi = {10.4230/LIPIcs.ECOOP.2016.2}, annote = {Keywords: Object orientation, Datalog, query languages, prescriptive typing} }
Published in: Dagstuhl Reports, Volume 4, Issue 5 (2014)
Danny Dig, William G. Griswold, Emerson Murphy-Hill, and Max Schäfer. The Future of Refactoring (Dagstuhl Seminar 14211). In Dagstuhl Reports, Volume 4, Issue 5, pp. 40-67, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@Article{dig_et_al:DagRep.4.5.40, author = {Dig, Danny and Griswold, William G. and Murphy-Hill, Emerson and Sch\"{a}fer, Max}, title = {{The Future of Refactoring (Dagstuhl Seminar 14211)}}, pages = {40--67}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2014}, volume = {4}, number = {5}, editor = {Dig, Danny and Griswold, William G. and Murphy-Hill, Emerson and Sch\"{a}fer, Max}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.5.40}, URN = {urn:nbn:de:0030-drops-46807}, doi = {10.4230/DagRep.4.5.40}, annote = {Keywords: Refactoring} }
Feedback for Dagstuhl Publishing