zbMATH — the first resource for mathematics

SOFSEM 2014: theory and practice of computer science. 40th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 26–29, 2014. Proceedings. (English) Zbl 1298.68026
Lecture Notes in Computer Science 8327. Berlin: Springer (ISBN 978-3-319-04297-8/pbk). xxiv, 528 p. (2014).

Show indexed articles as search result.

The articles of mathematical interest will be reviewed individually. For the preceding conference see [Zbl 1298.68036].
Indexed articles:
Janin, David, Towards a higher-dimensional string theory for the modeling of computerized systems, 7-20 [Zbl 1432.68033]
Královič, Rastislav, Advice complexity: quantitative approach to a-priori information. Extended abstract, 21-29 [Zbl 1432.68183]
Mishkin, Dmytro; Matas, Jiří, Matching of images of non-planar objects with view synthesis, 30-39 [Zbl 1432.68532]
Alam, Md. Jawaherul; Kaufmann, Michael; Kobourov, Stephen G.; Mchedlidze, Tamara, Fitting planar graphs on planar maps, 52-64 [Zbl 1432.68329]
Alqahtani, Hasna Mohsen; Erlebach, Thomas, Minimum activation cost node-disjoint paths in graphs with bounded treewidth, 65-76 [Zbl 1432.68330]
Barhum, Kfir, Tight bounds for the advice complexity of the online minimum Steiner tree problem, 77-88 [Zbl 1432.68587]
Barhum, Kfir; Böckenhauer, Hans-Joachim; Forišek, Michal; Gebauer, Heidi; Hromkovič, Juraj; Krug, Sacha; Smula, Jasmin; Steffen, Björn, On the power of advice and randomization for the disjoint path allocation problem, 89-101 [Zbl 1432.68009]
Bougeret, Marin; Bousquet, Nicolas; Giroudeau, Rodolphe; Watrigant, Rémi, Parameterized complexity of the sparsest \(k\)-subgraph problem in chordal graphs, 150-161 [Zbl 1432.68189]
Bujtor, Ferenc; Vogler, Walter, Error-pruning in interface automata, 162-173 [Zbl 1422.68147]
Cochefert, Manfred; Kratsch, Dieter, Exact algorithms to clique-colour graphs, 187-198 [Zbl 1432.05106]
Fleck, Tobias; Kappes, Andrea; Wagner, Dorothea, Graph clustering with surprise: complexity and exact solutions, 223-234 [Zbl 1432.68352]
Fontaine, Allyx; Métivier, Yves; Robson, John Michael; Zemmari, Akka, On lower bounds for the time and the bit complexity of some probabilistic distributed graph algorithms. Extended abstract, 235-245 [Zbl 1432.68557]
Freivalds, Rūsiņš; Zeugmann, Thomas, Active learning of recursive functions by ultrametric algorithms, 246-257 [Zbl 1390.68361]
Gelles, Ran; Ostrovsky, Rafail; Roytman, Alan, Efficient error-correcting codes for sliding windows, 258-268 [Zbl 1432.68139]
Gimbert, Hugo; Oualhadj, Youssouf, Deciding the value 1 problem for \(\sharp\)-acyclic partially observable Markov decision processes, 281-292 [Zbl 1435.91022]
Grigoriev, Alexander; Koutsonas, Athanassios; Thilikos, Dimitrios M., Bidimensionality of geometric intersection graphs, 293-305 [Zbl 1435.05146]
Hanzlik, Lucjan; Kluczniak, Kamil, Attack against a pairing based anonymous authentication protocol, 306-314 [Zbl 1432.94151]
Heggernes, Pinar; van ’t Hof, Pim; van Leeuwen, Erik Jan; Saei, Reza, Finding disjoint paths in split graphs, 315-326 [Zbl 1432.68357]
Jansen, Klaus; Prädel, Lars, A new asymptotic approximation algorithm for 3-dimensional strip packing, 327-338 [Zbl 1432.68576]
Jonoska, Nataša; Manea, Florin; Seki, Shinnosuke, A stronger square conjecture on binary words, 339-350 [Zbl 1432.68375]
Komatsu, Tomoki; Okuta, Ryosuke; Narisawa, Kazuyuki; Shinohara, Ayumi, Bounded occurrence edit distance: a new metric for string similarity joins with edit distance constraints, 363-374 [Zbl 1432.68606]
Korec, Ivan; Wiedermann, Jiří, Deterministic verification of integer matrix multiplication in quadratic time, 375-382 [Zbl 1432.68620]
Krzywiecki, Łukasz; Kubiak, Przemysław; Kutyłowski, Mirosław, Probabilistic admissible encoding on elliptic curves – towards PACE with generalized integrated mapping, 395-406 [Zbl 1432.94139]
Ksystra, Katerina; Stefaneas, Petros; Frangos, Panayiotis, An algebraic framework for modeling of reactive rule-based intelligent agents, 407-418 [Zbl 1432.68469]
Kutrib, Martin; Meckel, Katja; Wendlandt, Matthias, Parameterized prefix distance between regular languages, 419-430 [Zbl 1432.68232]
Mráz, František; Otto, Friedrich, Ordered restarting automata for picture languages, 431-442 [Zbl 1432.68237]
Palioudakis, Alexandros; Salomaa, Kai; Akl, Selim G., Unary NFAs with limited nondeterminism, 443-454 [Zbl 1432.68242]
Roumelis, George; Vassilakopoulos, Michael; Corral, Antonio; Manolopoulos, Yannis, A new plane-sweep algorithm for the \(K\)-closest-pairs query, 478-490 [Zbl 1432.68117]
Tsuruta, Kazuya; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki, Shortest unique substrings queries in optimal time, 503-513 [Zbl 1432.68612]
Yamakami, Tomoyuki, Oracle pushdown automata, nondeterministic reducibilities, and the hierarchy over the family of context-free languages, 514-525 [Zbl 1432.68250]

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest
Full Text: DOI