Special Issue of the 11th Conference of PhD Students in Computer Science

• Preface

  Attila Kertész

  1-3

  • PDF
• Towards a Classification to Facilitate the Design of Domain-Specific Visual Languages

  Sándor Bácsi, Gergely Mezei, PhD

  5-16

  • PDF
• Operations on Signed Distance Functions

  Csaba Bálint, Gábor Valasek, Lajos Gergó

  17-28

  • PDF
• Multi Party Computation Motivated by the Birthday Problem

  Péter Hudoba, Péter Burcsi

  29-41

  • PDF
• Benchmarking Graph Database Backends—What Works Well with Wikidata?

  Tibor Kovács, Gábor Simon, Gergely Mezei

  43-60

  • PDF
• Keeping P4 Switches Fast and Fault-free through Automatic Verification

  Dániel Lukács, Máté Tejfel, Gergely Pongrácz

  61-81

  • PDF
• Multi-Cloud Management Strategies for Simulating IoT Applications

  András Márkus, József Dániel Dombi

  83-103

  • PDF
• Different Types of Search Algorithms for Rough Sets

  David Nagy, Tamas Mihalydeak, Laszlo Aszalos

  105-120

  • PDF
• LZ based Compression Benchmark on PE Files

  Zsombor Paroczi

  121-129

  • PDF
• A Preparation Guide for Java Call Graph Comparison Finding a Match for Your Methods

  Edit Pengő, Zoltán Ságodi

  131-155

  • PDF
• Combining Common Sense Rules and Machine Learning to Understand Object Manipulation

  András Sárkány, Máté Csákvári, Mike Olasz

  157-172

  • PDF