Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)
Aurélie Suzanne, Guillaume Raschia, José Martinez, and Damien Tassetti. Window-Slicing Techniques Extended to Spanning-Event Streams. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{suzanne_et_al:LIPIcs.TIME.2020.10, author = {Suzanne, Aur\'{e}lie and Raschia, Guillaume and Martinez, Jos\'{e} and Tassetti, Damien}, title = {{Window-Slicing Techniques Extended to Spanning-Event Streams}}, booktitle = {27th International Symposium on Temporal Representation and Reasoning (TIME 2020)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-167-2}, ISSN = {1868-8969}, year = {2020}, volume = {178}, editor = {Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.10}, URN = {urn:nbn:de:0030-drops-129783}, doi = {10.4230/LIPIcs.TIME.2020.10}, annote = {Keywords: Data Stream, Spanning-events, Temporal Aggregates, Sliding Windows} }
Published in: LIPIcs, Volume 130, 24th International Conference on Types for Proofs and Programs (TYPES 2018)
Ulrich Berger, Ralph Matthes, and Anton Setzer. Martin Hofmann’s Case for Non-Strictly Positive Data Types. In 24th International Conference on Types for Proofs and Programs (TYPES 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 130, pp. 1:1-1:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{berger_et_al:LIPIcs.TYPES.2018.1, author = {Berger, Ulrich and Matthes, Ralph and Setzer, Anton}, title = {{Martin Hofmann’s Case for Non-Strictly Positive Data Types}}, booktitle = {24th International Conference on Types for Proofs and Programs (TYPES 2018)}, pages = {1:1--1:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-106-1}, ISSN = {1868-8969}, year = {2019}, volume = {130}, editor = {Dybjer, Peter and Esp{\'\i}rito Santo, Jos\'{e} and Pinto, Lu{\'\i}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2018.1}, URN = {urn:nbn:de:0030-drops-114052}, doi = {10.4230/LIPIcs.TYPES.2018.1}, annote = {Keywords: non strictly-positive data types, breadth-first traversal, program verification, Mendler-style recursion, System F, theorem proving, Coq, Agda, Haskell} }
Published in: LIPIcs, Volume 130, 24th International Conference on Types for Proofs and Programs (TYPES 2018)
Iosif Petrakis. Dependent Sums and Dependent Products in Bishop’s Set Theory. In 24th International Conference on Types for Proofs and Programs (TYPES 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 130, pp. 3:1-3:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{petrakis:LIPIcs.TYPES.2018.3, author = {Petrakis, Iosif}, title = {{Dependent Sums and Dependent Products in Bishop’s Set Theory}}, booktitle = {24th International Conference on Types for Proofs and Programs (TYPES 2018)}, pages = {3:1--3:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-106-1}, ISSN = {1868-8969}, year = {2019}, volume = {130}, editor = {Dybjer, Peter and Esp{\'\i}rito Santo, Jos\'{e} and Pinto, Lu{\'\i}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2018.3}, URN = {urn:nbn:de:0030-drops-114070}, doi = {10.4230/LIPIcs.TYPES.2018.3}, annote = {Keywords: Bishop’s constructive mathematics, Martin-L\"{o}f’s type theory, dependent sums, dependent products, type-theoretic axiom of choice} }
Published in: LIPIcs, Volume 130, 24th International Conference on Types for Proofs and Programs (TYPES 2018)
Filippo Sestini. Normalization by Evaluation for Typed Weak lambda-Reduction. In 24th International Conference on Types for Proofs and Programs (TYPES 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 130, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{sestini:LIPIcs.TYPES.2018.6, author = {Sestini, Filippo}, title = {{Normalization by Evaluation for Typed Weak lambda-Reduction}}, booktitle = {24th International Conference on Types for Proofs and Programs (TYPES 2018)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-106-1}, ISSN = {1868-8969}, year = {2019}, volume = {130}, editor = {Dybjer, Peter and Esp{\'\i}rito Santo, Jos\'{e} and Pinto, Lu{\'\i}s}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2018.6}, URN = {urn:nbn:de:0030-drops-114101}, doi = {10.4230/LIPIcs.TYPES.2018.6}, annote = {Keywords: normalization, lambda-calculus, reduction, term-rewriting, Agda} }
Published in: LIPIcs, Volume 147, 26th International Symposium on Temporal Representation and Reasoning (TIME 2019)
Ana de Almeida Borges, Juan José Conejero Rodríguez, David Fernández-Duque, Mireia González Bedmar, and Joost J. Joosten. The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations. In 26th International Symposium on Temporal Representation and Reasoning (TIME 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 147, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dealmeidaborges_et_al:LIPIcs.TIME.2019.6, author = {de Almeida Borges, Ana and Conejero Rodr{\'\i}guez, Juan Jos\'{e} and Fern\'{a}ndez-Duque, David and Gonz\'{a}lez Bedmar, Mireia and Joosten, Joost J.}, title = {{The Second Order Traffic Fine: Temporal Reasoning in European Transport Regulations}}, booktitle = {26th International Symposium on Temporal Representation and Reasoning (TIME 2019)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-127-6}, ISSN = {1868-8969}, year = {2019}, volume = {147}, editor = {Gamper, Johann and Pinchinat, Sophie and Sciavicco, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2019.6}, URN = {urn:nbn:de:0030-drops-113649}, doi = {10.4230/LIPIcs.TIME.2019.6}, annote = {Keywords: linear temporal logic, monadic second order logic, formalized law, transport regulations} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, and José Verschae. A Local-Search Algorithm for Steiner Forest. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 31:1-31:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gro_et_al:LIPIcs.ITCS.2018.31, author = {Gro{\ss}, Martin and Gupta, Anupam and Kumar, Amit and Matuschke, Jannik and Schmidt, Daniel R. and Schmidt, Melanie and Verschae, Jos\'{e}}, title = {{A Local-Search Algorithm for Steiner Forest}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {31:1--31:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.31}, URN = {urn:nbn:de:0030-drops-83134}, doi = {10.4230/LIPIcs.ITCS.2018.31}, annote = {Keywords: Local Search, Steiner Forest, Approximation Algorithms, Network Design} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, and Yifeng Zhang. Scheduling Problems over Network of Machines. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 5:1-5:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{friggstad_et_al:LIPIcs.APPROX-RANDOM.2017.5, author = {Friggstad, Zachary and Golestanian, Arnoosh and Khodamoradi, Kamyar and Martin, Christopher and Rahgoshay, Mirmahdi and Rezapour, Mohsen and Salavatipour, Mohammad R. and Zhang, Yifeng}, title = {{Scheduling Problems over Network of Machines}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.5}, URN = {urn:nbn:de:0030-drops-75547}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.5}, annote = {Keywords: approximation algorithms, job-shop scheduling, min-sum edge coloring, minimum latency} }
Published in: Dagstuhl Reports, Volume 5, Issue 10 (2016)
José R. Correa, Tobias Harks, Kai Nagel, Britta Peis, and Martin Skutella. Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412). In Dagstuhl Reports, Volume 5, Issue 10, pp. 19-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{correa_et_al:DagRep.5.10.19, author = {Correa, Jos\'{e} R. and Harks, Tobias and Nagel, Kai and Peis, Britta and Skutella, Martin}, title = {{Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 15412)}}, pages = {19--34}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {5}, number = {10}, editor = {Correa, Jos\'{e} R. and Harks, Tobias and Nagel, Kai and Peis, Britta and Skutella, Martin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.10.19}, URN = {urn:nbn:de:0030-drops-56938}, doi = {10.4230/DagRep.5.10.19}, annote = {Keywords: Dynamic traffic equilibria, Complexity of equilibrium computation, Simulation, Dynamic network flow theory, Network optimization} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Martin Gairing, Tobias Harks, and Max Klimm. Complexity and Approximation of the Continuous Network Design Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 226-241, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{gairing_et_al:LIPIcs.APPROX-RANDOM.2014.226, author = {Gairing, Martin and Harks, Tobias and Klimm, Max}, title = {{Complexity and Approximation of the Continuous Network Design Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {226--241}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.226}, URN = {urn:nbn:de:0030-drops-46998}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.226}, annote = {Keywords: Bilevel optimization, Optimization under equilibrium constraints, Network design, Wardrop equilibrium, Computational complexity, Approximation algorit} }
Published in: Dagstuhl Seminar Proceedings, Volume 9441, The Constraint Satisfaction Problem: Complexity and Approximability (2010)
Barnaby Martin and Jos Martin. The complexity of positive first-order logic without equality II: The four-element case. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Seminar Proceedings, Volume 9441, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{martin_et_al:DagSemProc.09441.5, author = {Martin, Barnaby and Martin, Jos}, title = {{The complexity of positive first-order logic without equality II: The four-element case}}, booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9441}, editor = {Andrei A. Bulatov and Martin Grohe and Phokion G. Kolaitis and Andrei Krokhin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09441.5}, URN = {urn:nbn:de:0030-drops-23670}, doi = {10.4230/DagSemProc.09441.5}, annote = {Keywords: Quantified constraints, Galois connection} }
Published in: Dagstuhl Seminar Proceedings, Volume 9041, Hybrid and Robust Approaches to Multiobjective Optimization (2009)
Jos Figueira, Martin Geiger, Salvatore Greco, Johannes Jahn, Kathrin Klamroth, Masahiro Inuiguchi, Vincent Mousseau, Sayin Serpil, Roman Slowinski, Margaret M. Wiecek, and Witting Katrin. 09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round). In Hybrid and Robust Approaches to Multiobjective Optimization. Dagstuhl Seminar Proceedings, Volume 9041, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{figueira_et_al:DagSemProc.09041.6, author = {Figueira, Jos and Geiger, Martin and Greco, Salvatore and Jahn, Johannes and Klamroth, Kathrin and Inuiguchi, Masahiro and Mousseau, Vincent and Sayin Serpil and Slowinski, Roman and Wiecek, Margaret M. and Witting Katrin}, title = {{09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round)}}, booktitle = {Hybrid and Robust Approaches to Multiobjective Optimization}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9041}, editor = {Kalyanmoy Deb and Salvatore Greco and Kaisa Miettinen and Eckart Zitzler}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09041.6}, URN = {urn:nbn:de:0030-drops-20025}, doi = {10.4230/DagSemProc.09041.6}, annote = {Keywords: Robust multiobjective optimization} }
Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)
José Luiz Fiadeiro, Ugo Montanari, and Martin Wirsing. 05081 Abstracts Collection – Foundations of Global Computing. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{fiadeiro_et_al:DagSemProc.05081.1, author = {Fiadeiro, Jos\'{e} Luiz and Montanari, Ugo and Wirsing, Martin}, title = {{05081 Abstracts Collection – Foundations of Global Computing}}, booktitle = {Foundations of Global Computing}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5081}, editor = {Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.1}, URN = {urn:nbn:de:0030-drops-4590}, doi = {10.4230/DagSemProc.05081.1}, annote = {Keywords: Global Computing} }
Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)
Cristóvão Oliveira and Michel Wermelinger. Architectural Views for CommUnity. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{oliveira_et_al:DagSemProc.05081.2, author = {Oliveira, Crist\'{o}v\~{a}o and Wermelinger, Michel}, title = {{Architectural Views for CommUnity}}, booktitle = {Foundations of Global Computing}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5081}, editor = {Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.2}, URN = {urn:nbn:de:0030-drops-2967}, doi = {10.4230/DagSemProc.05081.2}, annote = {Keywords: Software Architecture, views, computation, coordination, distribution} }
Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)
Jens Gustedt. Data Handover: Reconciling Message Passing and Shared Memory. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{gustedt:DagSemProc.05081.3, author = {Gustedt, Jens}, title = {{Data Handover: Reconciling Message Passing and Shared Memory}}, booktitle = {Foundations of Global Computing}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5081}, editor = {Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.3}, URN = {urn:nbn:de:0030-drops-2977}, doi = {10.4230/DagSemProc.05081.3}, annote = {Keywords: Efficient data management, message passing, shared memory} }
Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)
Maura Cerioli and Matteo Dell'Amico. Injecting Distribution in CASL. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{cerioli_et_al:DagSemProc.05081.4, author = {Cerioli, Maura and Dell'Amico, Matteo}, title = {{Injecting Distribution in CASL}}, booktitle = {Foundations of Global Computing}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5081}, editor = {Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.4}, URN = {urn:nbn:de:0030-drops-2981}, doi = {10.4230/DagSemProc.05081.4}, annote = {Keywords: P2P, CASL, algebraic specification language, specification library} }
Feedback for Dagstuhl Publishing