Search Results - "Berger, Sören"

The modal logic of abelian groups by Berger, Sören, Block, Alexander Christensen, Löwe, Benedikt

“…We prove that the modal logic of abelian groups with the accessibility relation of being isomorphic to a subgroup is S 4.2 …”
Get full text

The size‐Ramsey number of powers of bounded degree trees by Berger, Sören, Kohayakawa, Yoshiharu, Maesaka, Giulia Satiko, Martins, Taísa, Mendonça, Walner, Mota, Guilherme Oliveira, Parczyk, Olaf

“…Given a positive integer s, the s‐colour size‐Ramsey number of a graph H is the smallest integer m such that there exists a graph G with m edges with the…”
Get full text

Tur\'an density of cliques of order five in $3$-uniform hypergraphs with quasirandom links by Berger, Sören, Piga, Simón, Reiher, Christian, Rödl, Vojtěch, Schacht, Mathias

“…We show that $3$-uniform hypergraphs with the property that all vertices have a quasirandom link graph with density bigger than $1/3$ contain a clique on five…”
Get full text

Virtualised e-Learning on the IRMOS real-time Cloud by Cucinotta, Tommaso, Checconi, Fabio, Kousiouris, George, Konstanteli, Kleopatra, Gogouvitis, Spyridon, Kyriazis, Dimosthenis, Varvarigou, Theodora, Mazzetti, Alessandro, Zlatev, Zlatko, Papay, Juri, Boniface, Michael, Berger, Sören, Lamp, Dominik, Voith, Thomas, Stein, Manuel

“…This paper presents the real-time virtualised Cloud infrastructure that was developed in the context of the IRMOS European Project. The paper shows how…”
Get full text

Odd cycles in subgraphs of sparse pseudorandom graphs by Berger, Sören, Lee, Joonkyung, Schacht, Mathias

“…We answer two extremal questions about odd cycles that naturally arise in the study of sparse pseudorandom graphs. Let $\Gamma$ be an $(n,d,\lambda)$-graph,…”
Get full text

The size-Ramsey number of powers of bounded degree trees by Berger, Sören, Kohayakawa, Yoshiharu, Maesaka, Giulia Satiko, Martins, Taísa, Mendonça, Walner, Mota, Guilherme Oliveira, Parczyk, Olaf

“…Given a positive integer $s$, the $s$-colour size-Ramsey number of a graph $H$ is the smallest integer $m$ such that there exists a graph $G$ with $m$ edges…”
Get full text

Network virtualization: The missing piece by Oberle, K., Kessler, M., Stein, M., Voith, T., Lamp, D., Berger, S.

“…Current service platforms or frameworks, e.g., cloud solutions, do not take the infrastructure, necessary for the execution of the service, sufficiently into…”
Get full text