SOFSEM 2008: Theory and Practice of Computer Science

SOFSEM 2008: Theory and Practice of Computer Science

4.11 - 1251 ratings - Source

This volume contains the invited and the contributed papers selected for p- th sentation at SOFSEM 2008, the 34 Conference on Current Trends in Theory and Practice of Computer Science, which was held January 19a€“25, 2008, in the Atrium Hotel, Novy I Smokovec, High Tatras in Slovakia. SOFSEM (originally SOFtware SEMinar), as an annual international c- ference devoted to the theory and practice of computer science, aims to foster cooperationamongprofessionalsfromacademiaandindustryworkinginallareas in this ?eld. Developing over the years from a local event to a fully international and well-established conference, contemporary SOFSEM continues to maintain the best of its original Winter School aspects, such as a high number of invited talks and in-depth coverage of novel research results in selected areas within computer science. SOFSEM 2008 was organized around the following tracks: a€“ Foundations of Computer Science (Chair: Juhani Karhum Iˆ aki) a€“ Computing by Nature (Chair: Alberto Bertoni) a€“ Networks, Security, and Cryptography (Chair: Bart Preneel) a€“ Web Technologies (Chair: Pavol N I avrat) The SOFSEM 2008 Program Committee consisted of 75 international - perts, representing active areas of the SOFSEM 2008 tracks with outstanding expertise and an eye for current developments, evaluating the submissions with the help of 169 additional reviewers. An integral part of SOFSEM 2008 was the traditional Student Research - rum (chaired by Ma Iria Bielikov I a), organized with the aim of presenting student projectsinthetheoryandpracticeofcomputerscienceandtogivestudentsfe- back on both originality of their scienti?c results and on their work in progress.Table 1. Possible manual cost changes, affecting the rescheduling cut algorithms with lower time complexity. The only requirement is the ability to work with infinite edge throughputs. The conversion of the schedule ... The Ford-Fulkerson algorithm we use has time complexity O((|A|+|D|)2 aˆ—|A|). This is also the complexity ofanbsp;...

Title:SOFSEM 2008: Theory and Practice of Computer Science
Author:Villiam Geffert, Juhani Karhumäki, Alberto Bertoni
Publisher:Springer Science & Business Media - 2008-01-11


You Must CONTINUE and create a free account to access unlimited downloads & streaming