Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 : proceedings / / [edited by] Farid Ablayev, Ernst W. Mayr
| Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 : proceedings / / [edited by] Farid Ablayev, Ernst W. Mayr |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XI, 397 p. 49 illus.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
AblayevFarid
MayrErnst |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer science
Computer science - Russia (Federation) |
| ISBN |
1-280-38667-3
9786613564597 3-642-13182-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Energy Management -- Sofic and Almost of Finite Type Tree-Shifts -- Proof-Based Design of Security Protocols -- Approximating the Minimum Length of Synchronizing Words Is Hard -- Realizability of Dynamic MSC Languages -- The max quasi-independent set Problem -- Equilibria in Quantitative Reachability Games -- Quotient Complexity of Closed Languages -- Right-Sequential Functions on Infinite Words -- Kernelization -- Zigzags in Turing Machines -- Frameworks for Logically Classifying Polynomial-Time Optimisation Problems -- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online -- Identical Relations in Symmetric Groups and Separating Words with Reversible Automata -- Time Optimal d-List Colouring of a Graph -- The Cantor Space as a Generic Model of Topologically Presented Knowledge -- Algorithmics – Is There Hope for a Unified Theory? -- Classifying Rankwidth k-DH-Graphs -- Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms -- A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem -- Balancing Bounded Treewidth Circuits -- Obtaining Online Ecological Colourings by Generalizing First-Fit -- Classical Simulation and Complexity of Quantum Computations -- Prefix-Free and Prefix-Correct Complexities with Compound Conditions -- Monotone Complexity of a Pair -- Symbolic Models for Single-Conclusion Proof Logics -- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA -- Advancing Matrix Computations with Randomized Preprocessing -- Transfinite Sequences of Constructive Predicate Logics -- The Quantitative Analysis of User Behavior Online — Data, Models and Algorithms -- A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem -- Complexity of Propositional Proofs -- Quantization of Random Walks: Search Algorithms and Hitting Time -- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems -- Growth of Power-Free Languages over Large Alphabets -- A Partially Synchronizing Coloring -- An Encoding Invariant Version of Polynomial Time Computable Distributions -- Prehistoric Phenomena and Self-referentiality. |
| Altri titoli varianti | CSR 2010 |
| Record Nr. | UNINA-9910483768903321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer science -- theory and applications : fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009 : proceedings / / Anna Frid ... [et al.] (eds.)
| Computer science -- theory and applications : fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009 : proceedings / / Anna Frid ... [et al.] (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XIII, 369 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | FridAnna |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer science
Computer science - Russia (Federation) |
| ISBN |
1-280-38317-8
9786613561091 3-642-03351-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Well-Founded and Partial Stable Semantics Logical Aspects -- The Reachability Problem over Infinite Graphs -- Kolmogorov Complexity and Model Selection -- Automatic Verification of Heap-Manipulating Programs Using Separation Logic -- Accepted Papers -- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism -- Integrality Property in Preemptive Parallel Machine Scheduling -- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes -- k-SAT Is No Harder Than Decision-Unique-k-SAT -- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations -- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model -- Approximability Distance in the Space of H-Colourability Problems -- On Random Ordering Constraints -- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates -- A Feebly Secure Trapdoor Function -- Partitioning Graphs into Connected Parts -- Structural Complexity of AvgBPP -- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials -- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity -- One-Nonterminal Conjunctive Grammars over a Unary Alphabet -- Concatenation of Regular Languages and Descriptional Complexity -- Approximability of the Maximum Solution Problem for Certain Families of Algebras -- Complete Complexity Classification of Short Shop Scheduling -- Compressed Word Problems in HNN-Extensions and Amalgamated Products -- Variations on Muchnik’s Conditional Complexity Theorem -- An Optimal Bloom Filter Replacement Based on Matrix Solving -- Aperiodicity Measure for Infinite Sequences -- On the Complexity of Matroid Isomorphism Problems -- Breaking Anonymity by Learning a Unique Minimum Hitting Set -- The Budgeted Unique Coverage Problem and Color-Coding -- Formal Verification of Gate-Level Computer Systems -- On Models of a Nondeterministic Computation -- New Plain-Exponential Time Classes for Graph Homomorphism -- Languages Recognized with Unbounded Error by Quantum Finite Automata. |
| Altri titoli varianti | CSR 2009 |
| Record Nr. | UNINA-9910484414703321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
SoRuCom 2017 : 2017 forth International Conference "Computer Technology in Russia and in the Former Soviet Union" : selected papers : 3-5 October 2017, Zelenograd, Russia / / editors, Irina Krayneva, Alexander Tomilin ; sponsored by Institute of Electrical and Electronics Engineers
| SoRuCom 2017 : 2017 forth International Conference "Computer Technology in Russia and in the Former Soviet Union" : selected papers : 3-5 October 2017, Zelenograd, Russia / / editors, Irina Krayneva, Alexander Tomilin ; sponsored by Institute of Electrical and Electronics Engineers |
| Pubbl/distr/stampa | Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2017 |
| Descrizione fisica | 1 online resource (247 pages) |
| Disciplina | 004 |
| Soggetto topico |
Computer science - Russia (Federation)
Information technology - Russia (Federation) |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-5386-4741-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996279526603316 |
| Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SoRuCom 2017 : 2017 forth International Conference "Computer Technology in Russia and in the Former Soviet Union" : selected papers : 3-5 October 2017, Zelenograd, Russia / / editors, Irina Krayneva, Alexander Tomilin ; sponsored by Institute of Electrical and Electronics Engineers
| SoRuCom 2017 : 2017 forth International Conference "Computer Technology in Russia and in the Former Soviet Union" : selected papers : 3-5 October 2017, Zelenograd, Russia / / editors, Irina Krayneva, Alexander Tomilin ; sponsored by Institute of Electrical and Electronics Engineers |
| Pubbl/distr/stampa | Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2017 |
| Descrizione fisica | 1 online resource (247 pages) |
| Disciplina | 004 |
| Soggetto topico |
Computer science - Russia (Federation)
Information technology - Russia (Federation) |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-5386-4741-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910280938703321 |
| Piscataway, New Jersey : , : Institute of Electrical and Electronics Engineers, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
