Computer Science -- Theory and Applications: First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $9.42
Usually ships in 1-2 business days
(Save 94%)
Other sellers (Paperback)
  • All (12) from $9.42   
  • New (7) from $78.83   
  • Used (5) from $9.40   


This book constitutes the refereed proceedings of the First International Symposium on Computer Science in Russia, CSR 2006. The 35 revised full theory papers and 29 revised application papers together with 3 invited talks address all major areas in computer science are addressed. The theory track deals with algorithms, prools, data structures and more. The application part comprises programming and languages; computer architecture and hardware design among many more topics.

Read More Show Less

Product Details

Table of Contents

Invited 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.

Read More Show Less

Customer Reviews

Average Rating 5
( 1 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted May 28, 2013

    I¿m loving McDonalds for fast food... MyDeals247 for the best de

    I’m loving McDonalds for fast food... MyDeals247 for the best deals;))

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)