LEADER 07632nam 22009135 450 001 996198829903316 005 20230329100702.0 010 $a3-662-46078-5 024 7 $a10.1007/978-3-662-46078-8 035 $a(CKB)2560000000326198 035 $a(Springer)9783662460788 035 $a(MH)014293534-4 035 $a(SSID)ssj0001424602 035 $a(PQKBManifestationID)11844612 035 $a(PQKBTitleCode)TC0001424602 035 $a(PQKBWorkID)11363959 035 $a(PQKB)10720296 035 $a(DE-He213)978-3-662-46078-8 035 $a(MiAaPQ)EBC5578005 035 $a(PPN)183519957 035 $a(EXLCZ)992560000000326198 100 $a20150114d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSOFSEM 2015: Theory and Practice of Computer Science$b[electronic resource] $e41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sn??kou, Czech Republic, January 24-29, 2015, Proceedings /$fedited by Giuseppe Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer 205 $a1st ed. 2015. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2015. 215 $a1 online resource (XVI, 616 p. 116 illus.)$conline resource 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8939 300 $aIncludes index. 311 $a3-662-46077-7 327 $aKeynote Talk -- What is Computation: An Epistemic Approach -- Foundations of Computer Science -- Progress (and Lack Thereof) for Graph Coloring Approximation Problems -- Recent Results in Scalable Multi-Party Computation -- Online Bipartite Matching in Offline Time (Abstract) -- Software & Web Engineering -- Quo Vadis Explicit-State Model Checking -- The Dos and Dont?s of Crowdsourcing Software Development -- Data, Information and Knowledge Engineering -- Adaptively Approximate Techniques in Distributed Architectures -- Back to the Future ? Should SQL Surrender to SPARQL? -- Foundations of Computer Science -- Balancing Energy Consumption for the Establishment of Multi-interface Networks -- The Maximum k-Differential Coloring Problem -- Exact Algorithms for 2-clustering with Size Constraints in the Euclidean Plane -- Local Routing in Convex Subdivisions -- Nondeterministic Modal Interfaces -- Group Search on the Line -- Online Makespan Scheduling with Sublinear Advice -- Deterministic Rendezvous in Restricted Graphs -- Fastest, Average and Quantile Schedule -- Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP -- Maximally Permissive Controlled System Synthesis for Modal Logic -- Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem -- Finding Highly Connected Subgraphs -- Fixing Improper Colorings of Graphs -- Efficient Online Strategies for Renting Servers in the Cloud -- Palk is Linear Recognizable Online -- Two Grammatical Equivalents of Flip-Pushdown Automata -- On the Hierarchy Classes of Finite Ultrametric Automata -- Nash-Williams-type and Chvat´al-type Conditions in One-Conflict Graphs. -Optimal State Reductions of Automata with Partially Specified Behaviors. -Quantum Pushdown Automata with a Garbage Tape -- Towards a Characterization of Leaf Powers by Clique Arrangements -- Filling Logarithmic Gaps in Distributed Complexity for Global Problems -- On Visibly Pushdown Trace Languages -- Dominating an s-t-Cut in a Network -- Lower Bounds for Linear Decision Trees with Bounded Weights -- Software & Web Engineering -- A Model-Driven Approach to Generate External DSLs from Object-Oriented APIs -- Function Based Requirements Engineering and Design ? Towards Efficient and Transparent Plant Engineering -- Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies -- Discovering Motifs in Real-World Social Networks -- Data, Information, and Knowledge Engineering -- Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities -- Efficient Similarity Search by Combining Indexing and Caching Strategies -- Retrieving Documents Related to Database Queries -- Advantages of Dependency Parsing for Free Word Order Natural Languages -- Detecting Identical Entities in the Semantic Web Data -- Conducting a Web Browsing Behaviour Study ? An Educational Scenario -- A Uniform Programmning Language for Implementing XML Standards -- OntoSDM: An Approach to Improve Quality on Spatial Data Mining Algorithms -- Cryptography, Security, and Verification -- Attribute-Based Encryption Optimized for Cloud Computing -- Trustworthy Virtualization of the ARMv7 Memory Subsystem -- True Random Number Generators Secure in a Changing Environment: Improved Security Bounds -- Java Loops Are Mainly Polynomial. 330 $aThis book constitutes the proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science held in Pec pod Sn??kou, Czech Republic, during January 24-29, 2015. The book features 8 invited talks and 42 regular papers which were carefully reviewed and selected from 101 submissions. The papers are organized in topical sections named: foundations of computer science; software and Web engineering; data, information, and knowledge engineering; and cryptography, security, and verification. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8939 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aInformation storage and retrieval systems 606 $aSoftware engineering 606 $aArtificial intelligence 606 $aCryptography 606 $aData encryption (Computer science) 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aInformation Storage and Retrieval 606 $aSoftware Engineering 606 $aArtificial Intelligence 606 $aCryptology 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aInformation storage and retrieval systems. 615 0$aSoftware engineering. 615 0$aArtificial intelligence. 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aInformation Storage and Retrieval. 615 24$aSoftware Engineering. 615 24$aArtificial Intelligence. 615 24$aCryptology. 676 $a004.015113 702 $aItaliano$b Giuseppe$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMargaria-Steffen$b Tiziana$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPokorný$b Jaroslav$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aQuisquater$b Jean-Jacques$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWattenhofer$b Roger$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996198829903316 996 $aSOFSEM 2015: Theory and Practice of Computer Science$92504133 997 $aUNISA 999 $aThis Record contains information from the Harvard Library Bibliographic Dataset, which is provided by the Harvard Library under its Bibliographic Dataset Use Terms and includes data made available by, among others the Library of Congress