New PDF release: SOFSEM 2014: Theory and Practice of Computer Science: 40th

By Miklos Biro (auth.), Viliam Geffert, Bart Preneel, Branislav Rovan, Július àtuller, A Min Tjoa (eds.)

ISBN-10: 3319042971

ISBN-13: 9783319042978

ISBN-10: 331904298X

ISBN-13: 9783319042985

This publication constitutes the refereed court cases of the fortieth overseas convention on present developments in thought and perform of laptop technological know-how, SOFSEM 2014, held in Nový Smokovec, Slovakia, in January 2014.
The forty revised complete papers offered during this quantity have been rigorously reviewed and chosen from 104 submissions. The booklet additionally includes 6 invited talks. The contributions covers themes as: Foundations of laptop technology, software program and net Engineering, in addition to info, info, and data Engineering, and Cryptography, defense, and Verification.

Show description

Read or Download 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 PDF

Similar theory books

Download e-book for iPad: Governance Theory: A Cross-Disciplinary Approach by Vasudha Chhotray, Gerry Stoker

Confusion approximately governance abounds. Many lack appreciation of the way various traditions of inspiration within the social sciences give a contribution to our figuring out. This e-book tackles those weaknesses head on and goals to supply a much wider imaginative and prescient of the world, studying 3 severe parts of perform: environmental, company and participatory governance.

Get Theory of Quantum Computation, Communication, and PDF

This ebook constitutes the completely refereed post-workshop complaints of the 4th Workshop on thought of Quantum Computation, communique, and Cryptography, TQC 2009, held in Waterloo, Canada, in may possibly 2009. the ten revised papers provided have been conscientiously chosen in the course of rounds of reviewing and development.

Download e-book for iPad: Madelung.Teoriya.Tverdogo.Tela by n/a

The subsequent description is in Russian (transliterated), by way of an automatic English translation. We ask for forgiveness for inaccuracies within the computer-generated English translation. Please be at liberty to touch us for a correct human English translation, which good feel free to organize upon requestTrans.

Extra resources for 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

Example text

As a result, this new programming layer allows for the combination of both (sequential) strings and (parallel) streams with a single mixed product: the tiled product. By capitalizing on theoretical developments within the general theory of inverse semigroups (see [25] for instance) and the associated emerging notion of higher-dimensional strings [22,23], we thus aim at developing the idea of an inverse semigroup theory for computer science much in the same way that the development of logic for computer science is advocated in [36].

244–256. Springer, Heidelberg (2013) 18. : Overlapping tile automata. M. ) CSR 2013. LNCS, vol. 7913, pp. 431–443. Springer, Heidelberg (2013) 19. : Walking automata in the free inverse monoid. Technical Report RR1464-12, LaBRI, Université de Bordeaux (2013) 20. : The Tcalculus : towards a structured programming of (musical) time and space. In: Workshop on Functional Art, Music, Modeling and Design (FARM). ACM Press (2013) 21. : Multi-scale design of interactive music systems: The libTuiles experiment.

The oracle-based approach where additional advice strings can be placed in the nodes was applied in [19], where it is proven that 2 bits in every node are sufficient for a finite automaton to explore all graphs, a task that is not possible without any information. In the same model, the problem of drawing a map of an unlabeled graph ([25]), and traversing an unknown tree ([49]) have been considered. Contrary to the local port scenario, where the agent residing in a given node can locally distinguish the incident links, in the so-called fixed graph scenario introduced by Kalyanasundaram and Pruhs in [59], the nodes have identifiers, and when the agent arrives at a node v ∈ G, it learns all incident edges, their endpoints, and, if the graph is weighted, their weights.

Download PDF sample

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 by Miklos Biro (auth.), Viliam Geffert, Bart Preneel, Branislav Rovan, Július àtuller, A Min Tjoa (eds.)


by Robert
4.5

Rated 4.48 of 5 – based on 11 votes