Vol-1326
urn:nbn:de:0074-1326-7

Copyright © 2015 for the individual papers by the papers' authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors.

SOFSEM-SP 2015
Student Research Forum Papers and Posters at SOFSEM 2015

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015)

Pec pod Snezkou, Czech Republic, January 24-29, 2015.

The papers of this volume also appeared as printed proceedings "SOFSEM 2015, Volume II", ISBN: 978-80-87136-20-1

Edited by

Giuseppe F. Italiano ¹⁾
Tiziana Margaria-Steffen ²⁾
Jaroslav Pokorny ³⁾
Jean-Jacques Quisquater ⁴⁾
Roger Wattenhofer ⁵⁾
Roman Spanek ⁶⁾
Martin Rimnac ⁷⁾

Table of Contents

Preface

Student Research Forum Papers

Foundations of Computer Science

Advantages of Ultrametric Counter Automata 1
Valdis Adamsons, Karlis Jerins, Rihards Krislauks, Marta Lapina, Andris Pakulis, Rusins Freivalds
Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata 13
Maksims Dimitrijevs, Irina Scegulnaja
Fast Primality Testing for Integers That Fit into a Machine Word 20
Michal Forisek, Jakub Jancina
A Fixed-Parameter Algorithm for Max Edge Domination 31
Tesshu Hanaka, Hirotaka Ono
Position Heaps for Permuted Pattern Matching on Multi-Track String 41
Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara

Software and Web Engineering

Performance Analysis Patterns for Requirements Analysis 54
Azadeh Alebrahim

Cryptography, Security, and Verification

An Improved Transformation between HILL and Metric Conditional Pseudoentropy 67
Maciej Skorski
Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs with Applications to Pseudoentropy 78
Maciej Skorski
Metric Pseudoentropy: Characterizations and Applications 90
Maciej Skorski

Posters

Introduction to Android 5 Security 103
Lukas Aron, Petr Hanacek
Towards Indestructible Molecular Robots 112
Ilir Capuni, Anisa Halimi, Dorjan Hitaj
Experiments in Complexity of Probabilistic and Ultrametric Automata 120
Kristine Cipola, Andris Pakulis, Rusins Freivalds
Measuring Complexity of Domain Standard Specifications Using XML Schema Entropy 124
George Feuerlicht, Vladimir Kovar, David Hartman, Marek Beranek, Pavel Bory
Team Semantics and Recursive Enumerability 132
Antti Kuusisto
Superimposed Codes and Query Algorithms 140
Anete Lace, Muntis Rudzitis, Eriks Gopaks, Rusins Freivalds
Frequency Pushdown Automata 132
Ilmars Puzulis, Rusins Freivalds
Implementing the Aho-Corasick Automata for Phonetic Search 154
Ondrej Sykora

2015-01-14: submitted by Martin Rimnac, metadata incl. bibliographic data published under Creative Commons CC0
2015-01-15: published on CEUR-WS.org |valid HTML5|