×

Found 20 Documents (Results 1–20)

Extending propositional separation logic for robustness properties. (English) Zbl 1528.03151

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 42, 23 p. (2018).
MSC:  03B70 68Q17
Full Text: DOI

All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time. (English) Zbl 1441.68183

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 74, 14 p. (2017).
MSC:  68R10 68W40

Log-space algorithms for paths and matchings in \(k\)-trees. (English) Zbl 1230.68087

Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 215-226, electronic only (2010).

Transition graphs of rewriting systems over unranked trees. (English) Zbl 1147.68546

Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 67-77 (2007).
MSC:  68Q42 68Q60

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field