LEADER 07084nam 22007335 450 001 996465876703316 005 20230405235659.0 010 $a3-540-34168-4 024 7 $a10.1007/11753728 035 $a(CKB)1000000000232975 035 $a(SSID)ssj0000316894 035 $a(PQKBManifestationID)11212918 035 $a(PQKBTitleCode)TC0000316894 035 $a(PQKBWorkID)10287818 035 $a(PQKB)10273178 035 $a(DE-He213)978-3-540-34168-0 035 $a(MiAaPQ)EBC3068222 035 $a(PPN)123134714 035 $a(EXLCZ)991000000000232975 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science -- Theory and Applications$b[electronic resource] $eFirst International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings /$fedited by Dima Grigoriev, John Harrison, Edward A. Hirsch 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XVI, 684 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3967 300 $a"The International Symposium on Computer Science in Russia (CSR 2006) was held on June 8-12, 2006 in St. Petersburg, Russia, hosted by the Steklov Institute of Mathematics at St. Petersburg."--Pref. 311 $a3-540-34166-8 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Non-black-box Techniques in Cryptography -- Complexity of Polynomial Multiplication over Finite Fields -- Synchronous Elastic Circuits -- Theory Track -- SZK Proofs for Black-Box Group Problems -- Canonical Decomposition of a Regular Factorial Language -- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure -- Inductive Type Schemas as Functors -- Unfolding Synthesis of Asynchronous Automata -- Conjugacy and Equivalence of Weighted Automata and Functional Transducers -- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees -- Tuples of Disjoint NP-Sets -- Constructive Equivalence Relations on Computable Probability Measures -- Planar Dimer Tilings -- The Complexity of Equality Constraint Languages -- Window Subsequence Problems for Compressed Texts -- Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varieties -- Relativisation Provides Natural Separations for Resolution-Based Proof Systems -- Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems -- Isolation and Reducibility Properties and the Collapse Result -- Incremental Branching Programs -- Logic of Proofs for Bounded Arithmetic -- On a Maximal NFA Without Mergible States -- Expressiveness of Metric Modalities for Continuous Time -- Extending Dijkstra?s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction -- Weighted Logics for Traces -- On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone -- Unwinding a Non-effective Cut Elimination Proof -- Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover -- Shannon Entropy vs. Kolmogorov Complexity -- Language Equations with Symmetric Difference -- On Primitive Recursive Realizabilities -- Evidence Reconstruction of Epistemic Modal Logic S5 -- Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms -- On the Frequency of Letters in Morphic Sequences -- Functional Equations in Shostak Theories -- All Semi-local Longest Common Subsequences in Subquadratic Time -- Non-approximability of the Randomness Deficiency Function -- Multi-agent Explicit Knowledge -- Applications and Technology Track -- Polarized Subtyping for Sized Types -- Neural-Network Based Physical Fields Modeling Techniques -- Approximate Methods for Constrained Total Variation Minimization -- Dynamic Isoline Extraction for Visualization of Streaming Data -- Improved Technique of IP Address Fragmentation Strategies for DoS Attack Traceback -- Performance Comparison Between Backpropagation, Neuro-Fuzzy Network, and SVM -- Evolutionary Multi-objective Optimisation by Diversity Control -- 3D Facial Recognition Using Eigenface and Cascade Fuzzy Neural Networks: Normalized Facial Image Approach -- A New Scaling Kernel-Based Fuzzy System with Low Computational Complexity -- Bulk Synchronous Parallel ML: Semantics and Implementation of the Parallel Juxtaposition -- A Shortest Path Algorithm Based on Limited Search Heuristics -- A New Hybrid Directory Scheme for Shared Memory Multi-processors -- Manipulator Path Planning in 3-Dimensional Space -- Least Likely to Use: A New Page Replacement Strategy for Improving Database Management System Response Time -- Nonlinear Visualization of Incomplete Data Sets -- A Review of Race Detection Mechanisms -- Fuzzy-Q Knowledge Sharing Techniques with Expertness Measures: Comparison and Analysis -- Explaining Symbolic Trajectory Evaluation by Giving It a Faithful Semantics -- Analytic Modeling of Channel Traffic in n-Cubes -- Capturing an Intruder in the Pyramid -- Speech Enhancement in Short-Wave Channel Based on Empirical Mode Decomposition -- Extended Resolution Proofs for Conjoining BDDs -- Optimal Difference Systems of Sets with Multipliers -- Authentication Mechanism Using One-Time Password for 802.11 Wireless LAN -- Optimizing Personalized Retrieval System Based on Web Ranking -- Instruction Selection for ARM/Thumb Processors Based on a Multi-objective Ant Algorithm -- A New Flow Control Algorithm for High Speed Computer Network -- Nonlinear Systems Modeling and Control Using Support Vector Machine Technique -- Fast Motif Search in Protein Sequence Databases. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3967 606 $aComputer science 606 $aAlgorithms 606 $aArtificial intelligence 606 $aComputer science?Mathematics 606 $aBioinformatics 606 $aTheory of Computation 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aMathematics of Computing 606 $aBioinformatics 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aComputer science?Mathematics. 615 0$aBioinformatics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aArtificial Intelligence. 615 24$aMathematics of Computing. 615 24$aBioinformatics. 676 $a004 702 $aGrigoriev$b Dima$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHarrison$b John$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHirsch$b Edward A$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Computer Science Symposium in Russia 906 $aBOOK 912 $a996465876703316 996 $aComputer Science - Theory and Applications$92889860 997 $aUNISA LEADER 03248nam 22006975 450 001 996465825603316 005 20230221142600.0 010 $a3-319-90530-9 024 7 $a10.1007/978-3-319-90530-3 035 $a(CKB)3850000000031362 035 $a(DE-He213)978-3-319-90530-3 035 $a(MiAaPQ)EBC6248589 035 $a(PPN)22740338X 035 $a(EXLCZ)993850000000031362 100 $a20180424d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputer Science ? Theory and Applications$b[electronic resource] $e13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6?10, 2018, Proceedings /$fedited by Fedor V. Fomin, Vladimir V. Podolskii 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XXXII, 335 p. 41 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10846 311 $a3-319-90529-5 320 $aIncludes bibliographical references and index. 330 $aThis book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018. The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions. The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10846 606 $aComputer science 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aArtificial intelligence?Data processing 606 $aArtificial intelligence 606 $aComputer Science Logic and Foundations of Programming 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aData Science 606 $aArtificial Intelligence 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aArtificial intelligence?Data processing. 615 0$aArtificial intelligence. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aData Science. 615 24$aArtificial Intelligence. 676 $a004 702 $aFomin$b Fedor V$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPodolskii$b Vladimir V$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465825603316 996 $aComputer Science - Theory and Applications$92889860 997 $aUNISA