|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-77566-9 |
| 003 |
DE-He213 |
| 005 |
20230330023114.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2008 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540775669
|9 978-3-540-77566-9
|
| 024 |
7 |
|
|a 10.1007/978-3-540-77566-9
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a SOFSEM 2008: Theory and Practice of Computer Science
|h [electronic resource] :
|b 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings /
|c edited by Villiam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková.
|
| 250 |
|
|
|a 1st ed. 2008.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2008.
|
| 300 |
|
|
|a XV, 792 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4910
|
| 505 |
0 |
|
|a Invited Talks -- Quantum Random Walks - New Method for Designing Quantum Algorithms -- Social Information Access: The Other Side of the Social Web -- Designing Adaptive Web Applications -- Best of Both: Using Semantic Web Technologies to Enrich User Interaction with the Web and Vice Versa -- On the Hardness of Reoptimization -- Describing Self-assembly of Nanostructures -- On the Undecidability of the Tiling Problem -- Remote Entrusting by Run-Time Software Authentication -- Trusted Computing - Special Aspects and Challenges -- Optimizing Winning Strategies in Regular Infinite Games -- Foundations of Computer Science -- Recursive Domain Equations of Filter Models -- Algorithmic Problems for Metrics on Permutation Groups -- Periodic and Infinite Traces in Matrix Semigroups -- From Asynchronous to Synchronous Specifications for Distributed Program Synthesis -- Exact OBDD Bounds for Some Fundamental Functions -- Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers -- A Useful Bounded Resource Functional Language -- On Reachability Games of Ordinal Length -- An Algorithm for Computation of the Scene Geometry by the Log-Polar Area Matching Around Salient Points -- The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring -- How Much Information about the Future Is Needed? -- On Compiling Structured Interactive Programs with Registers and Voices -- Optimal Orientation On-Line -- Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality -- Assisted Problem Solving and Decompositions of Finite Automata -- Energy-Efficient Windows Scheduling -- A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns -- Certification of Proving Termination of Term Rewriting by Matrix Interpretations -- Extension of Rescheduling Based on Minimal Graph Cut -- Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets -- Computing Longest Common Substring and All Palindromes from Compressed Strings -- Basic Sets in the Digital Plane -- Algebraic Optimization of Relational Queries with Various Kinds of Preferences -- Mortality Problem for 2×2 Integer Matrices -- Element Distinctness and Sorting on One-Tape Off-Line Turing Machines -- Improved Bounds for Range Mode and Range Median Queries -- An Automata Theoretic Approach to Rational Tree Relations -- Slicing Petri Nets with an Application to Workflow Verification -- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata -- Verifying Parameterized taDOM+ Lock Managers -- Untangling a Planar Graph -- Computing by Nature -- Quantum Walks with Multiple or Moving Marked Locations -- Parallel Immune System for Graph Coloring -- The Quantum Complexity of Group Testing -- Quantum Walks: A Markovian Perspective -- A Memetic Algorithm for Global Induction of Decision Trees -- Geometric Rates of Approximation by Neural Networks -- A Sensitive Metaheuristic for Solving a Large Optimization Problem -- Networks, Security, and Cryptography -- Domain Name System as a Memory and Communication Medium -- Strong Authentication over Lock-Keeper -- Short Ballot Assumption and Threeballot Voting Protocol -- Practical Deniable Encryption -- Taming of Pict -- Classification, Formalization and Verification of Security Functional Requirements -- ONN the Use of Neural Networks for Data Privacy -- Threshold Privacy Preserving Keyword Searches -- Web Technologies -- 3D_XML: A Three-Dimensional XML-Based Model -- Visual Exploration of RDF Data -- Creation, Population and Preprocessing of Experimental Data Sets for Evaluation of Applications for the Semantic Web -- Algorithm for Intelligent Prediction of Requests in Business Systems -- Mining Personal Social Features in the Community of Email Users -- Proofs of Communication and Its Application for Fighting Spam -- Web Pages Reordering and Clustering Based on Web Patterns -- Compression of Concatenated Web Pages Using XBW -- The Dynamic Web Presentations with a Generality Model on the News Domain -- A Highly Efficient XML Compression Scheme for the Web -- Improving Semantic Search Via Integrated Personalized Faceted and Visual Graph Navigation.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Database management.
|
| 650 |
|
0 |
|a Data mining.
|
| 650 |
|
0 |
|a Application software.
|
| 650 |
1 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Database Management.
|
| 650 |
2 |
4 |
|a Data Mining and Knowledge Discovery.
|
| 650 |
2 |
4 |
|a Computer and Information Systems Applications.
|
| 700 |
1 |
|
|a Geffert, Villiam.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Karhumäki, Juhani.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Bertoni, Alberto.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Preneel, Bart.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Návrat, Pavol.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Bieliková, Mária.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540847113
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540775652
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 4910
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-540-77566-9
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
