Published in: LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022)
Harm Derksen, Visu Makam, and Jeroen Zuiddam. Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. In 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 234, pp. 9:1-9:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{derksen_et_al:LIPIcs.CCC.2022.9, author = {Derksen, Harm and Makam, Visu and Zuiddam, Jeroen}, title = {{Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors}}, booktitle = {37th Computational Complexity Conference (CCC 2022)}, pages = {9:1--9:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-241-9}, ISSN = {1868-8969}, year = {2022}, volume = {234}, editor = {Lovett, Shachar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.9}, URN = {urn:nbn:de:0030-drops-165716}, doi = {10.4230/LIPIcs.CCC.2022.9}, annote = {Keywords: tensors, bilinear maps, complexity, subrank, diagonalization, generic tensors, random tensors, reduction, slice rank} }
Published in: LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Ruben Brokkelkamp, Raymond van Venetië, Mees de Vries, and Jan Westerdiep. PACE Solver Description: tdULL. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 29:1-29:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{brokkelkamp_et_al:LIPIcs.IPEC.2020.29, author = {Brokkelkamp, Ruben and van Veneti\"{e}, Raymond and de Vries, Mees and Westerdiep, Jan}, title = {{PACE Solver Description: tdULL}}, booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)}, pages = {29:1--29:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-172-6}, ISSN = {1868-8969}, year = {2020}, volume = {180}, editor = {Cao, Yixin and Pilipczuk, Marcin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.29}, URN = {urn:nbn:de:0030-drops-133326}, doi = {10.4230/LIPIcs.IPEC.2020.29}, annote = {Keywords: PACE 2020, treedepth, treedepth decomposition, vertex ranking, minimal separators, branch and bound} }
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 52, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)
Fer-Jan de Vries. On Undefined and Meaningless in Lambda Definability. In 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 52, pp. 18:1-18:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{devries:LIPIcs.FSCD.2016.18, author = {de Vries, Fer-Jan}, title = {{On Undefined and Meaningless in Lambda Definability}}, booktitle = {1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-010-1}, ISSN = {1868-8969}, year = {2016}, volume = {52}, editor = {Kesner, Delia and Pientka, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.18}, URN = {urn:nbn:de:0030-drops-59785}, doi = {10.4230/LIPIcs.FSCD.2016.18}, annote = {Keywords: lambda calculus, lambda definability, partial recursive function, undefined term, meaningless term} }
Published in: LIPIcs, Volume 35, 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)
Alexander Kurz, Alberto Pardo, Daniela Petrisan, Paula Severi, and Fer-Jan de Vries. Approximation of Nested Fixpoints – A Coalgebraic View of Parametric Dataypes. In 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 35, pp. 205-220, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kurz_et_al:LIPIcs.CALCO.2015.205, author = {Kurz, Alexander and Pardo, Alberto and Petrisan, Daniela and Severi, Paula and de Vries, Fer-Jan}, title = {{Approximation of Nested Fixpoints – A Coalgebraic View of Parametric Dataypes}}, booktitle = {6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)}, pages = {205--220}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-84-2}, ISSN = {1868-8969}, year = {2015}, volume = {35}, editor = {Moss, Lawrence S. and Sobocinski, Pawel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2015.205}, URN = {urn:nbn:de:0030-drops-55351}, doi = {10.4230/LIPIcs.CALCO.2015.205}, annote = {Keywords: coalgebra, Bekic lemma, infinite data, functional programming, type theory} }
Published in: LIPIcs, Volume 15, 23rd International Conference on Rewriting Techniques and Applications (RTA'12) (2012)
Paula Severi and Fer-Jan de Vries. Meaningless Sets in Infinitary Combinatory Logic. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 288-304, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{severi_et_al:LIPIcs.RTA.2012.288, author = {Severi, Paula and de Vries, Fer-Jan}, title = {{Meaningless Sets in Infinitary Combinatory Logic}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {288--304}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.288}, URN = {urn:nbn:de:0030-drops-34993}, doi = {10.4230/LIPIcs.RTA.2012.288}, annote = {Keywords: Infinitary Rewriting, Combinatory Logic, Meaningless Sets, Confluence, Normalisation} }
Published in: LIPIcs, Volume 10, 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (2011)
Paula Severi and Fer-Jan de Vries. Weakening the Axiom of Overlap in Infinitary Lambda Calculus. In 22nd International Conference on Rewriting Techniques and Applications (RTA'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 10, pp. 313-328, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{severi_et_al:LIPIcs.RTA.2011.313, author = {Severi, Paula and de Vries, Fer-Jan}, title = {{Weakening the Axiom of Overlap in Infinitary Lambda Calculus}}, booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)}, pages = {313--328}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-30-9}, ISSN = {1868-8969}, year = {2011}, volume = {10}, editor = {Schmidt-Schauss, Manfred}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.313}, URN = {urn:nbn:de:0030-drops-31312}, doi = {10.4230/LIPIcs.RTA.2011.313}, annote = {Keywords: Infinitary Lambda Calculus, Confluence, Normalization} }
Published in: Dagstuhl Seminar Proceedings, Volume 9081, Similarity-based learning on structures (2009)
Gert-Jan de Vries and Michael Biehl. Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition. In Similarity-based learning on structures. Dagstuhl Seminar Proceedings, Volume 9081, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{devries_et_al:DagSemProc.09081.4, author = {de Vries, Gert-Jan and Biehl, Michael}, title = {{Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition}}, booktitle = {Similarity-based learning on structures}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9081}, editor = {Michael Biehl and Barbara Hammer and Sepp Hochreiter and Stefan C. Kremer and Thomas Villmann}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09081.4}, URN = {urn:nbn:de:0030-drops-20356}, doi = {10.4230/DagSemProc.09081.4}, annote = {Keywords: Learning Vector Quantization, Analysis, Facial Expression Recognition} }
Feedback for Dagstuhl Publishing