000 06456nam a22006495i 4500
001 978-3-662-46078-8
003 DE-He213
005 20200421111206.0
007 cr nn 008mamaa
008 150114s2015 gw | s |||| 0|eng d
020 _a9783662460788
_9978-3-662-46078-8
024 7 _a10.1007/978-3-662-46078-8
_2doi
050 4 _aQA76.9.M35
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aSOFSEM 2015: Theory and Practice of Computer Science
_h[electronic resource] :
_b41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings /
_cedited by Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorn�y, Jean-Jacques Quisquater, Roger Wattenhofer.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2015.
300 _aXVI, 616 p. 116 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8939
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aData encryption (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aInformation storage and retrieval.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aSoftware Engineering.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aData Encryption.
700 1 _aItaliano, Giuseppe F.
_eeditor.
700 1 _aMargaria-Steffen, Tiziana.
_eeditor.
700 1 _aPokorn�y, Jaroslav.
_eeditor.
700 1 _aQuisquater, Jean-Jacques.
_eeditor.
700 1 _aWattenhofer, Roger.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662460771
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8939
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-662-46078-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54156
_d54156