SOFSEM 2015: Theory and Practice of Computer Science: Lecture Notes in Computer Science
Editat de Giuseppe Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhoferen Limba Engleză Paperback – 2 ian 2015
Din seria Lecture Notes in Computer Science
- 20%
Preț: 400.77 lei - 20%
Preț: 754.11 lei - 20%
Preț: 324.19 lei - 20%
Preț: 373.80 lei - 20%
Preț: 342.61 lei - 20%
Preț: 403.00 lei - 20%
Preț: 573.45 lei -
Preț: 395.25 lei - 20%
Preț: 487.46 lei - 20%
Preț: 355.27 lei - 20%
Preț: 731.97 lei - 20%
Preț: 293.24 lei - 20%
Preț: 669.21 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 336.86 lei - 20%
Preț: 330.54 lei - 20%
Preț: 313.87 lei - 20%
Preț: 679.09 lei - 20%
Preț: 373.16 lei - 20%
Preț: 782.57 lei - 20%
Preț: 434.17 lei - 20%
Preț: 489.11 lei - 20%
Preț: 904.16 lei - 20%
Preț: 375.72 lei - 20%
Preț: 400.17 lei - 20%
Preț: 432.78 lei - 20%
Preț: 631.96 lei - 20%
Preț: 432.11 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 556.96 lei - 20%
Preț: 488.90 lei - 20%
Preț: 560.93 lei - 20%
Preț: 327.36 lei - 20%
Preț: 340.04 lei - 20%
Preț: 327.36 lei - 20%
Preț: 328.94 lei - 20%
Preț: 629.71 lei - 20%
Preț: 568.70 lei - 20%
Preț: 447.31 lei - 20%
Preț: 733.68 lei - 20%
Preț: 315.26 lei - 20%
Preț: 315.62 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 850.42 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 519.32 lei
Preț: 338.13 lei
Preț vechi: 422.65 lei
-20%
Puncte Express: 507
Preț estimativ în valută:
59.86€ • 69.64$ • 51.91£
59.86€ • 69.64$ • 51.91£
Carte tipărită la comandă
Livrare economică 28 februarie-14 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662460771
ISBN-10: 3662460777
Pagini: 632
Ilustrații: XVI, 616 p. 116 illus.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.94 kg
Ediția:2015
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662460777
Pagini: 632
Ilustrații: XVI, 616 p. 116 illus.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.94 kg
Ediția:2015
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Keynote Talk.- What is Computation: An Epistemic Approach.- Foundations of Computer Science.- Progress (and Lack Thereof) for Graph Coloring Approximation Problems.- Recent Results in Scalable Multi-Party Computation.- Online Bipartite Matching in Offline Time (Abstract).- Software & Web Engineering.- Quo Vadis Explicit-State Model Checking.- The Dos and Dont’s of Crowdsourcing Software Development.- Data, Information and Knowledge Engineering.- Adaptively Approximate Techniques in Distributed Architectures.- Back to the Future – Should SQL Surrender to SPARQL?.- Foundations of Computer Science.- Balancing Energy Consumption for the Establishment of Multi-interface Networks.- The Maximum k-Differential Coloring Problem.- Exact Algorithms for 2-clustering with Size Constraints in the Euclidean Plane.- Local Routing in Convex Subdivisions.- Nondeterministic Modal Interfaces.- Group Search on the Line.- Online Makespan Scheduling with Sublinear Advice.- Deterministic Rendezvous in Restricted Graphs.- Fastest, Average and Quantile Schedule.- Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP.- Maximally Permissive Controlled System Synthesis for Modal Logic.- Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem.- Finding Highly Connected Subgraphs.- Fixing Improper Colorings of Graphs.- Efficient Online Strategies for Renting Servers in the Cloud.- Palk is Linear Recognizable Online.- Two Grammatical Equivalents of Flip-Pushdown Automata.- On the Hierarchy Classes of Finite Ultrametric Automata.- Nash-Williams-type and Chvat´al-type Conditions in One-Conflict Graphs. -Optimal State Reductions of Automata with Partially Specified Behaviors. -Quantum Pushdown Automata with a Garbage Tape.- Towards a Characterization of Leaf Powers by Clique Arrangements.- Filling Logarithmic Gaps in Distributed Complexity for Global Problems.- On Visibly Pushdown Trace Languages.- Dominating an s-t-Cut in a Network.- LowerBounds for Linear Decision Trees with Bounded Weights.- Software & Web Engineering.- A Model-Driven Approach to Generate External DSLs fromObject-Oriented APIs.- Function Based Requirements Engineering and Design – Towards Efficient and Transparent Plant Engineering.- Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies.- Discovering Motifs in Real-World Social Networks.- Data, Information, and Knowledge Engineering.- Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities.- Efficient Similarity Search by Combining Indexing and CachingStrategies.- Retrieving Documents Related to Database Queries.- Advantages of Dependency Parsing for Free Word Order Natural Languages.- Detecting Identical Entities in the Semantic Web Data.- Conducting a Web Browsing Behaviour Study – An Educational Scenario.- A Uniform Programmning Language for Implementing XML Standards.- OntoSDM: An Approach to Improve Quality on Spatial Data MiningAlgorithms.- Cryptography, Security, and Verification.- Attribute-Based Encryption Optimized for Cloud Computing.- Trustworthy Virtualization of the ARMv7 Memory Subsystem.- True Random Number Generators Secure in a Changing Environment: Improved Security Bounds.- Java Loops Are Mainly Polynomial.