Table of Contents
|
Topics in Theoretical Computer Science Mohammad Reza Mousavi, Jiří Sgall |
Front Matter |
Invited Talk
|
Design and Validation of Cloud Storage Systems Using Formal Methods Peter Ölveczky |
3-8 |
Algorithms and Complexity
|
A Characterization of Horoidal Digraphs Ardeshir Dolati |
11-25 |
Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System Saeid Hanifehnezhad, Ardeshir Dolati |
26-33 |
Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance Mobarakeh Karimi, Massoud Aman, Ardeshir Dolati |
34-40 |
Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths Mohsen Safari, Ali Ebnenasir |
41-56 |
Logic, Semantics, and Programming Theory
|
Exposing Latent Mutual Exclusion by Work Automata Kasper Dokter, Farhad Arbab |
59-73 |
A Decidable Subtyping Logic for Intersection and Union Types Luigi Liquori, Claude Stolze |
74-90 |
Container Combinatorics: Monads and Lax Monoidal Functors Tarmo Uustalu |
91-105 |
Unification of Hypergraph $\lambda $-Terms Alimujiang Yasen, Kazunori Ueda |
106-124 |