top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Computer science--theory and applications [electronic resource] : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Computer science--theory and applications [electronic resource] : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Creatore [International Computer Science Symposium in Russia (1st : 2006 : St. Petersburg, Russia)]
Estensione 1 online resource
Disciplina 004
Accesso persona Grigoriev, Dima
Harrison, J. (John), 1966-
Hirsch, Edward A.
Genere/Forma Conference papers and proceedings
ISBN 3540341668
9783540341666
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UPENN-9964956993503681
[International Computer Science Symposium in Russia (1st : 2006 : St. Petersburg, Russia)]  
Materiale a stampa
Lo trovi qui: University of Pennsylvania
Computer science -- theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Computer science -- theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Creatore [International Computer Science Symposium in Russia (1st : 2006 : Saint Petersburg, Russia)]
Estensione xvi, 684 p. : ill. ; 24 cm.
Accesso persona Grigoriev, Dima
Harrison, J. (John), 1966-
Hirsch, Edward A.
ISBN 3540341668 (pbk.)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Non-black-box techniques in cryptography / Boaz Barak -- Complexity of polynomial multiplication over finite fields / Michael Kaminski -- Synchronous elastic circuits / Mike Kishinevsky, Jordi Cortadella, Bill Grundmann, Sava Krstic and John O'Leary -- SZK proofs for black-box group problems / V. Arvind and Bireswar Das -- Canonical decomposition of a regular factorial language / S. V. Avgustinovich and A. E. Frid -- Acyclic bidirected and skew-symmetric graphs : algorithms and structure / Maxim A. Babenko -- Inductive type schemas as functors / Freiric Barral and Sergei Soloviev -- Unfolding synthesis of asynchronous automata / Nicolas Baudru and Remi Morin -- Conjugacy and equivalence of weighted automata and functional transducers / Marie-Pierre Beal, Sylvain Lombardy and Jacques Sakarovitch -- Applications of the linear matroid parity algorithm to approximating Steiner trees / Piotr Berman, Martin Furer and Alexander Zelikovsky -- Tuples of disjoint NP-sets / Olaf Beyersdorff -- Constructive equivalence relations on computable probability measures / Laurent Bienvenu -- Planar dimer tilings / Olivier Bodini and Thomas Fernique -- The complexity of equality constraint languages / Manuel Bodirsky and Jan Kara -- Window subsequence problems for compressed texts / Patrick Cegielski, Irene Guessarian, Yury Lifshits and Yuri Matiyasevich -- Efficient algorithms in zero-characteristic for a new model of representation of algebraic varieties / Alexander L. Chistov -- Relativisation provides natural separations for resolution-based proof systems / Stefan Dantchev -- Bounded-degree forbidden patterns problems are constraint satisfaction problems / Stefan Dantchev and Florent Madelaine -- Isolation and reducibility properties and the collapse result / Sergey M. Dudakov -- Incremental branching programs / Anna Gal, Michal Koucky and Pierre McKenzie -- Logic of proofs for bounded arithmetic / Evan Goris -- On a maximal NFA without mergible states / Igor Grunsky, Oleksiy Kurganskyy and Igor Potapov -- Expressiveness of metric modalities for continuous time / Yoram Hirshfeld and Alexander Rabinovich -- Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction / Leonid Khachiyan, Vladimir Gurvich and Jihui Zhao -- Weighted logics for traces / Ingmar Meinecke -- On nonforgetting restarting automata that are deterministic and/or monotone / Hartmut Messerschmidt and Friedrich Otto -- Unwinding a non-effective cut elimination proof / Grigori Mints -- Enumerate and expand : improved algorithms for connected vertex cover and tree cover / Daniel Molle, Stefan Richter and Peter Rossmanith -- Shannon entropy vs. Kolmogorov complexity / An. Muchnik and N. Vereshchagin -- Language equations with symmetric difference / Alexander Okhotin -- On primitive recursive realizabilities / Valery Plisko -- Evidence reconstruction of epistemic modal logic S5 / Natalia Rubtsova -- Linear temporal logic with until and before on integer numbers, deciding algorithms / V. Rybakov -- On the frequency of letters in morphic sequences / Kalle Saari -- Functional equations in Shostak theories / Sergey P. Shlepakov -- All semi-local longest common subsequences in subquadratic time / Alexander Tiskin -- Non-approximability of the randomness deficiency function / Michael A. Ustinov -- Multi-agent explicit knowledge / Tatiana Yavorskaya -- Polarized subtyping for sized types / Andreas Abel -- Neural-network based physical fields modeling techniques / Konstantin Bournayev -- Approximate methods for constrained total variation minimization / Xiaogang Dong and Ilya Pollak -- Dynamic isoline extraction for visualization of streaming data / Dina Goldin and Huayan Gao -- Improved technique of IP address fragmentation strategies for DoS attack traceback / Byung-Ryong Kim and Ki-Chang Kim -- Performance comparison between backpropagation, neuro-fuzzy network, and SVM / Yong-Guk Kim, Min-Soo Jang, Kyoung-Sic Cho and Gwi-Tae Park -- Evolutionary multi-objective optimisation by diversity control / Pasan Kulvanit, Theera Piroonratana, Nachol Chaiyaratana and Djitt Laowattana -- 3D facial recognition using eigenface and cascade fuzzy neural networks : normalized facial image approach / Yeung-Hak Lee and Chang-Wook Han -- A new scaling kernel-based fuzzy system with low computational complexity / Xiaojun Liu, Jie Yang, Hongbin Shen and Xiangyang Wang -- Bulk synchronous parallel ML : semantics and implementation of the parallel juxtaposition / F. Loulergue, R. Benheddi, F. Gava and D. Louis-Regis -- A shortest path algorithm based on limited search heuristics / Feng Lu and Poh-Chin Lai -- A new hybrid directory scheme for shared memory multi-processors / Guoteng Pan, Lunguo Xie, Qiang Dou and Erhua He -- Manipulator path planning in 3-dimensional space / Dmitry Pavlov -- Least likely to use : a new page replacement strategy for improving database management system response time / Rodolfo A. Pazos R., Joaquin Perez O., Jose A. Martinez F., Juan J. Gonzalez B. and Mirna P. Ponce F. -- Nonlinear visualization of incomplete data sets / Sergiy Popov -- A review of race detection mechanisms / Aoun Raza -- Fuzzy-Q knowledge sharing techniques with expertness measures : comparison and analysis / Panrasee Ritthipravat, Thavida Maneewarn, Jeremy Wyatt and Djitt Laowattana -- Explaining symbolic trajectory evaluation by giving it a faithful semantics / Jan-Willem Roorda and Koen Claessen -- Analytic modeling of channel traffic in n-cubes / Hamid Sarbazi-Azad, Hamid Mahini and Ahmad Patooghy -- Capturing an intruder in the pyramid / Pooya Shareghi, Navid Imani and Hamid Sarbazi-Azad -- Speech enhancement in short-wave channel based on empirical mode decomposition / Li-Ran Shen, Qing-Bo Yin, Xue-Yao Li and Hui-Qiang Wang -- Extended resolution proofs for conjoining BDDs / Carsten Sinz and Armin Biere -- Optimal difference systems of sets with multipliers / Vladimir D. Tonchev and Hao Wang -- Authentication mechanism using one-time password for 802.11 wireless LAN / Binod Vaidya, SangDuck Lee, Jae-Kyun Han and SeungJo Han -- Optimizing personalized retrieval system based on Web ranking / Hao-ming Wang, Ye Guo and Bo-qin Feng -- Instruction selection for ARM/thumb processors based on a multi-objective ant algorithm / Shengning Wu and Sikun Li -- A new flow control algorithm for high speed computer network / Haoran Zhang and Peng Sun -- Nonlinear systems modeling and control using support vector machine technique / Haoran Zhang and Xiaodong Wang -- Fast motif search in protein sequence databases / Elena Zheleva and Abdullah N. Arslan.
Record Nr. UCHICAGO-6002751
[International Computer Science Symposium in Russia (1st : 2006 : Saint Petersburg, Russia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 ; proceedings / Farid Ablayev, Ernst W. Mayr (eds.).
Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 ; proceedings / Farid Ablayev, Ernst W. Mayr (eds.).
Creatore [International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]
Estensione 1 online resource (xi, 396 pages) : illustrations.
Disciplina 004.0151
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642131820
3642131824
9783642131813
3642131816
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms for energy management (invited talk) / Susanne Albers -- Sofic and almost of finite type tree-shifts / Nathalie Aubrun and Marie-Pierre Béal -- Proof-based design of security protocols / Nazim Benaissa and Dominique Méry -- Approximating the minimum length of synchronizing words is hard / Mikhail V. Berlinkov -- Realizability of dynamic MSC languages / Benedikt Bollig and Loïc Hélouët -- The max quasi-independent set problem / N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Th. Paschos, and O. Pottié -- Equilibria in quantitative reachability games / Thomas Brihaye, Véronique Bruyère, and Julie De Pril -- Quotient complexity of closed languages / Janusz Brzozowski, Galina Jirásková, and Chenglong Zou -- Right-sequential functions on infinite words / Olivier Carton -- Kernelization (invited talk) / Fedor V. Fomin -- Zigzags in turing machines / Anahí Gajardo and Pierre Guillon -- Frameworks for logically classifying polynomial-time optimisation problems / James Gate and Iain A. Stewart -- Validating the Knuth-Morris-Pratt failure function, fast and online / Pawel Gawrychowski, Artur Jeż, and Lukasz Jeż -- Identical relations in symmetric groups and separating words with reversible automata / R.A. Gimadeev and M.N. Vyalyi -- Time optimal d-list colouring of a graph / Nick Gravin -- The Cantor space as a generic model of topologically presented knowledge / Bernhard Heinemann -- Algorithmics : is there hope for a unified theory? (invited talk) / Juraj Hromkovič -- Classifying rankwidth k-DH-graphs / Ling-Ju Hung and Ton Kloks -- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms / Dmitry Itsykson -- A SAT based effective algorithm for the directed Hamiltonian cycle problem / Gerold Jäger and Weixiong Zhang -- Balancing bounded treewidth circuits / Maurice Jansen and Jayalal Sarma M.N. -- Obtaining online ecological colourings by generalizing First-Fit / Matthew Johnson, Viresh Patel, Daniël Paulusma, and Théophile Trunck -- Classical simulation and complexity of quantum computations (invited talk) / Richard Jozsa -- Prefix-free and prefix-correct complexities with compound conditions / Elena Kalinina -- Monotone complexity of a pair / Pavel Karpovich -- Symbolic models for single-conclusion proof logics / Vladimir N. Krupski -- Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA / P.V. Martyugin -- Advancing matrix computations with randomized preprocessing / Victor Y. Pan, Guoliang Qian, and Ai-Long Zheng -- Transfinite sequences of constructive predicate logics / Valery Plisko -- The quantitative analysis of user behavior online : data, models and algorithms (abstract of invited talk) / Prabhakar Raghavan -- A faster exact algorithm for the directed maximum leaf spanning tree problem / Daniel Binkele-Raible and Henning Fernau -- Complexity of propositional proofs (invited talk) / Alexander Razborov -- Quantization of random walks : search algorithms and hitting time (extended abstract of invited talk) / Miklos Santha -- Comparing two stochastic local search algorithms for constraint satisfaction problems (invited talk) / Uwe Schöning -- Growth of power-free languages over large alphabets / Arseny M. Shur -- A partially synchronizing coloring / Avraham N. Trahtman -- An encoding invariant version of polynomial time computable distributions / Nikolay Vereshchagin -- Prehistoric phenomena and self-referentiality / Junhua Yu.
Record Nr. NYU-004617274
[International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]  
Materiale a stampa
Lo trovi qui: New York University
Computer science -- theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Computer science -- theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 : proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Creatore [International Computer Science Symposium in Russia (1st : 2006 : Saint Petersburg, Russia)]
Estensione xvi, 684 p. : ill. ; 24 cm.
Accesso persona Grigoriev, Dima
Harrison, J. (John), 1966-
Hirsch, Edward A.
ISBN 3540341668 (pbk.)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-003783992
[International Computer Science Symposium in Russia (1st : 2006 : Saint Petersburg, Russia)]  
Materiale a stampa
Lo trovi qui: Duke University
Computer science--theory and applications : 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014, proceedings / Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin (eds.).
Computer science--theory and applications : 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014, proceedings / Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin (eds.).
Creatore [International Computer Science Symposium in Russia (9th : 2014 : Moscow, Russia)]
Estensione 1 online resource (xix, 389 pages).
Accesso persona Hirsch, Edward A., editor.
Genere/Forma Electronic books
Ebook
Conference papers and proceedings
ISBN 9783319066868
3319066862
3319066854
9783319066851
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Finding All Solutions of Equations in Free Groups and Monoids with Involution -- Algorithmic Meta Theorems for Sparse Graph Classes -- The Lattice of Definability -- Counting Popular Matchings in House Allocation Problems -- Vertex Disjoint Paths in Upward Planar Graphs -- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains -- Testing low degree trigonometric polynomials -- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees -- A Fast Branching Algorithm for Cluster Vertex Deletion -- Separation Logic with One Quantified Variable -- Notions of metric dimension of corona products -- On the Complexity of Computing Two Nonlinearity Measures -- Model Checking for String Problems -- Semiautomatic Structures -- The Query Complexity of Witness Finding -- Primal implication as encryption -- Processing Succinct Matrices and Vectors -- Constraint Satisfaction with Counting Quantifiers -- Dynamic Complexity of Planar 3-connected Graph Isomorphism -- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions -- First-Order Logic on CPDA Graphs -- Recognizing two-sided contexts in cubic time -- A Parameterized Algorithm for Packing Overlapping Subgraphs -- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles -- The Connectivity of Boolean Satisfiability -- Randomized communication complexity of approximating Kolmogorov complexity -- Space Saving by Dynamic Algebraization.
Record Nr. UCHICAGO-11085622
[International Computer Science Symposium in Russia (9th : 2014 : Moscow, Russia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Computer science--theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 ; proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Computer science--theory and applications : First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006 ; proceedings / Dima Grigoriev, John Harrison, Edward A. Hirsch (eds.).
Creatore [International Computer Science Symposium in Russia (1st : 2006 : St. Petersburg, Russia)]
Estensione xvi, 684 p. : ill. ; 24 cm.
Accesso persona Grigoriev, Dima
Harrison, J. (John), 1966-
Hirsch, Edward A.
ISBN 3540341668
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UMICH-005552929
[International Computer Science Symposium in Russia (1st : 2006 : St. Petersburg, Russia)]  
Materiale a stampa
Lo trovi qui: University of Michigan Ann Arbor
Computer science--theory and applications : 4th International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009 : proceedings / Anna Frid [and others] (eds.).
Computer science--theory and applications : 4th International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009 : proceedings / Anna Frid [and others] (eds.).
Creatore [International Computer Science Symposium in Russia (4th : 2009 : Novosibirsk, Russia)]
Estensione 1 online resource (xiii, 367 pages) : illustrations.
Disciplina 004
Accesso persona Frid, Anna
ISBN 9783642033513
3642033512
9783642033506
3642033504
Classificazione TP3-532
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a9110365
[International Computer Science Symposium in Russia (4th : 2009 : Novosibirsk, Russia)]  
Materiale a stampa
Lo trovi qui: Stanford University
Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 ; proceedings / Farid Ablayev, Ernst W. Mayr (eds.).
Computer science - theory and applications : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 ; proceedings / Farid Ablayev, Ernst W. Mayr (eds.).
Creatore [International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]
Estensione 1 online resource (xi, 396 pages) : illustrations.
Disciplina 004.0151
ISBN 9783642131820
3642131824
9783642131813
3642131816
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms for energy management (invited talk) / Susanne Albers -- Sofic and almost of finite type tree-shifts / Nathalie Aubrun and Marie-Pierre Béal -- Proof-based design of security protocols / Nazim Benaissa and Dominique Méry -- Approximating the minimum length of synchronizing words is hard / Mikhail V. Berlinkov -- Realizability of dynamic MSC languages / Benedikt Bollig and Loïc Hélouët -- The max quasi-independent set problem / N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Th. Paschos, and O. Pottié -- Equilibria in quantitative reachability games / Thomas Brihaye, Véronique Bruyère, and Julie De Pril -- Quotient complexity of closed languages / Janusz Brzozowski, Galina Jirásková, and Chenglong Zou -- Right-sequential functions on infinite words / Olivier Carton -- Kernelization (invited talk) / Fedor V. Fomin -- Zigzags in turing machines / Anahí Gajardo and Pierre Guillon -- Frameworks for logically classifying polynomial-time optimisation problems / James Gate and Iain A. Stewart -- Validating the Knuth-Morris-Pratt failure function, fast and online / Pawel Gawrychowski, Artur Jeż, and Lukasz Jeż -- Identical relations in symmetric groups and separating words with reversible automata / R.A. Gimadeev and M.N. Vyalyi -- Time optimal d-list colouring of a graph / Nick Gravin -- The Cantor space as a generic model of topologically presented knowledge / Bernhard Heinemann -- Algorithmics : is there hope for a unified theory? (invited talk) / Juraj Hromkovič -- Classifying rankwidth k-DH-graphs / Ling-Ju Hung and Ton Kloks -- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms / Dmitry Itsykson -- A SAT based effective algorithm for the directed Hamiltonian cycle problem / Gerold Jäger and Weixiong Zhang -- Balancing bounded treewidth circuits / Maurice Jansen and Jayalal Sarma M.N. -- Obtaining online ecological colourings by generalizing First-Fit / Matthew Johnson, Viresh Patel, Daniël Paulusma, and Théophile Trunck -- Classical simulation and complexity of quantum computations (invited talk) / Richard Jozsa -- Prefix-free and prefix-correct complexities with compound conditions / Elena Kalinina -- Monotone complexity of a pair / Pavel Karpovich -- Symbolic models for single-conclusion proof logics / Vladimir N. Krupski -- Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA / P.V. Martyugin -- Advancing matrix computations with randomized preprocessing / Victor Y. Pan, Guoliang Qian, and Ai-Long Zheng -- Transfinite sequences of constructive predicate logics / Valery Plisko -- The quantitative analysis of user behavior online : data, models and algorithms (abstract of invited talk) / Prabhakar Raghavan -- A faster exact algorithm for the directed maximum leaf spanning tree problem / Daniel Binkele-Raible and Henning Fernau -- Complexity of propositional proofs (invited talk) / Alexander Razborov -- Quantization of random walks : search algorithms and hitting time (extended abstract of invited talk) / Miklos Santha -- Comparing two stochastic local search algorithms for constraint satisfaction problems (invited talk) / Uwe Schöning -- Growth of power-free languages over large alphabets / Arseny M. Shur -- A partially synchronizing coloring / Avraham N. Trahtman -- An encoding invariant version of polynomial time computable distributions / Nikolay Vereshchagin -- Prehistoric phenomena and self-referentiality / Junhua Yu.
Record Nr. STANFORD-a9112433
[International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]  
Materiale a stampa
Lo trovi qui: Stanford University
Computer science--theory and applications : 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011 : proceedings / Alexander Kulikov, Nikolay Vereshchagin (eds.).
Computer science--theory and applications : 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011 : proceedings / Alexander Kulikov, Nikolay Vereshchagin (eds.).
Creatore [International Computer Science Symposium in Russia (6th : 2011 : Saint Petersburg, Russia)]
Estensione 1 online resource (xi, 469 pages).
Disciplina 004
Accesso persona Kulikov, Alexander
Vereshchagin, Nikolai Konstantinovich, 1958-
ISBN 9783642207129
364220712X
3642207111
9783642207112
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a9265691
[International Computer Science Symposium in Russia (6th : 2011 : Saint Petersburg, Russia)]  
Materiale a stampa
Lo trovi qui: Stanford University
Computer science-- theory and applications [electronic resource] : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 : proceedings / Farid Ablayev, Ernst W. Mayr (eds.).
Computer science-- theory and applications [electronic resource] : 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 : proceedings / Farid Ablayev, Ernst W. Mayr (eds.).
Creatore [International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]
Estensione xi, 396 p. : ill. ; 24 cm.
Accesso persona Ablayev, Farid
Mayr, Ernst
ISBN 3642131824 (electronic bk.)
9783642131820 (electronic bk.)
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-4860438
[International Computer Science Symposium in Russia (5th : 2010 : Kazan, Russia)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium