000 06807nam a22006975i 4500
001 978-3-662-49192-8
003 DE-He213
005 20240730192401.0
007 cr nn 008mamaa
008 160107s2016 gw | s |||| 0|eng d
020 _a9783662491928
_9978-3-662-49192-8
024 7 _a10.1007/978-3-662-49192-8
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aSOFSEM 2016: Theory and Practice of Computer Science
_h[electronic resource] :
_b42nd International Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 23-28, 2016, Proceedings /
_cedited by Rūsiņš Mārtiņš Freivalds, Gregor Engels, Barbara Catania.
250 _a1st ed. 2016.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2016.
300 _aXV, 630 p. 150 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9587
505 0 _aFoundations of Computer Science -- Cryptography in a Quantum World -- Relating Sublinear Space Computability among Graph Connectivity and Related Problems -- Learning Automatic Families of Languages -- Software Engineering: Methods, Tools, Applications From ESSENCE to Theory Oriented Software Engineering -- Incremental Queries and Transformations: From Concepts to Industrial Applications -- Data, Information, and Knowledge Engineering Big Sequence Management: A Glimpse on the Past, the Present, and the Future -- Pay-as-you-go Data Integration: Experiences and Recurring Themes -- Foundations of Computer Science -- Robust Recoverable Path Using Backup Nodes -- On Contact Graphs with Cubes and Proportional Boxes -- Orthogonal Layout with Optimal Face Complexity -- L-Drawings of Directed Graphs -- A Combinatorial Model of Two-sided Search -- On the Power of Laconic Advice in Communication Complexity -- Using Attribute Grammars to Model Nested Workflows with Extra Constraints -- A Natural Counting of Lambda Terms -- Online Minimum Spanning Tree with Advice -- Subsequence Automata with Default Transitions -- Run-Time Checking Multi-threaded Java Programs -- Online Graph Coloring with Advice and Randomized Adversary -- Pseudoknot-Generating Operation -- Capabilities of Ultrametric Automata with One, Two, and Three States -- The Complexity of Paging Against a Probabilistic Adversary -- On Parity Game Preorders and the Logic of Matching Plays -- A PTAS for Scheduling Unrelated Machines of Few Different Types -- Compacting a Dynamic Edit Distance Table by RLE Compression -- Walking Automata in Free Inverse Monoids -- Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique -- Grover's Search with Faults on Some Marked Elements -- Reachability problems for PAMs -- On the Effects of Nondeterminism on Ordered Restarting Automata -- Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations -- How to Smooth Entropy? -- Bounded TSO-to-SC Linearizability is Decidable -- Probabilistic Autoreductions -- Software Engineering: Methods, Tools, Applications ABS: A High-Level Modeling Language for Cloud-Aware Programming -- Aspect, Rich, and Anemic Domain Models in Enterprise Information Systems -- Finding Optimal Compatible Set of Software Components Using Integer Linear Programming -- Effective Parallel Multicore-optimized K-mers Counting Algorithm -- Meta-Evolution Style for Software Architecture Evolution -- The Simulation Relation for Formal e-contracts -- Data, Information, and Knowledge Engineering Solving the Problem of Selecting Suitable Objective Measures by Clustering Association Rules through the Measures Themselves -- Survey On Concern Separation in Service Integration -- Utilizing Vector Models for Automatic Text Lemmatization -- Improving Keyword Extraction from Movie Subtitles by Utilizing Temporal Properties -- Identification of Navigation Lead Candidates Using Citation and Co-Citation Analysis -- Summarizing Online User Reviews Using Bicliques.-Post-Processing Association Rules: a Network Based Label Propagation Approach -- Application of Multiple Sound Representations in Multipitch Estimation Using Shift-Invariant Probabilistic Latent Component Analysis -- Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams -- Evaluation of Static/Dynamic Cache for Similarity Search Engines.
520 _aThis book constitutes the proceedings of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2016, held in Harrachov, Czech Republic, in January 2016. The 43 full papers presented in this volume were carefully reviewed and selected from 116 submissions. They are organized in topical sections named: foundations of computer science; software engineering: methods, tools, applications; and data, information, and knowledge engineering. The volume also contains 7 invited talks in full paper length. .
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 0 _aInformation storage and retrieval systems.
_922213
650 0 _aSoftware engineering.
_94138
650 0 _aArtificial intelligence.
_93407
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 1 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aAlgorithms.
_93390
650 2 4 _aInformation Storage and Retrieval.
_923927
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aCryptology.
_931769
700 1 _aFreivalds, Rūsiņš Mārtiņš.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149779
700 1 _aEngels, Gregor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149780
700 1 _aCatania, Barbara.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9149781
710 2 _aSpringerLink (Online service)
_9149782
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783662491911
776 0 8 _iPrinted edition:
_z9783662491935
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9587
_9149783
856 4 0 _uhttps://doi.org/10.1007/978-3-662-49192-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94228
_d94228