SOFSEM 2009: Theory and Practice of Computer Science - Erstausgabe

EAN (ISBN-13): 9783540958901
ISBN (ISBN-10): 3540958908
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2009
Herausgeber: Springer Berlin
670 Seiten
Gewicht: 0,950 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-08-26T15:13:33+02:00 (Berlin)
Detailseite zuletzt geändert am 2024-04-07T16:38:57+02:00 (Berlin)
ISBN/EAN: 9783540958901

ISBN - alternative Schreibweisen:
3-540-95890-8, 978-3-540-95890-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: tuma, nielsen, kucera, mogens, antonin, peter frank, frank pala, bro, palamidessi, vale, nipkow
Titel des Buches: lecture notes computer science, berlin, 2009, theory and practice, the practice science, tuma, methods programming, 4085, czech, computer science 1st edition ebook

---

Daten vom Verlag:

Autor/in: Mogens Nielsen; Antonin Kucera; Peter Bro Miltersen; Catuscia Palamidessi; Petr Tuma; Frank Valencia
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; SOFSEM 2009: Theory and Practice of Computer Science - 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings
Verlag: Springer; Springer Berlin
670 Seiten
Erscheinungsjahr: 2009-01-12
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XVII, 670 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Graph; Service-oriented Computing; algorithms; approximation; auctions; automata; combinatorial complexity; communication; complexity; component based; conceptual modeling; database services; distributed computing; petri net; verification; Theory of Computation; Database Management; Programming Techniques; System Performance and Evaluation; Data Mining and Knowledge Discovery; Information Storage and Retrieval; Datenbanken; Computerprogrammierung und Softwareentwicklung; Systemanalyse und -design; Data Mining; Wissensbasierte Systeme, Expertensysteme; Informationsrückgewinnung, Information Retrieval; Data Warehousing; EA

Invited Talks.- A New Analysis of Expected Revenue.- Can Component/Service-Based Systems Be Proved Correct?.- Probabilistic Acceptors for Languages over Infinite Words.- Automatic Verification of Heap Manipulation Using Separation Logic.- Technology Diffusion in Social Networks.- Service Oriented Architecture Pitfalls.- Algorithms for Solving Infinite Games.- Randomness and Determination, from Physics and Computing towards Biology.- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures.- Regular Papers.- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems.- Framed Versus Unframed Two-Dimensional Languages.- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes.- The Shortcut Problem – Complexity and Approximation.- Green Computing: Energy Consumption Optimized Service Hosting.- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem.- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems.- Epistemic Strategies and Games on Concurrent Processes.- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures.- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay.- Time and Fairness in a Process Algebra with Non-blocking Reading.- Expressiveness of Multiple Heads in CHR.- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes.- A Framework for Mutant Genetic Generation for WS-BPEL.- Implementing Services by Partial State Machines.- Pattern Matching with Swaps for Short Patterns in Linear Time.- Automatic Bug Detection in Microcontroller Software by Static Program Analysis.- On the Unification of Process Semantics: Observational Semantics.- Factoring andTesting Primes in Small Space.- Adaptive Incentive-Compatible Sponsored Search Auction.- Semantically-Aided Data-Aware Service Workflow Composition.- Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time.- Abstract Storage Devices.- On Stateless Deterministic Restarting Automata.- User Care Preference-Based Semantic Service Discovery in a Ubiquitous Environment.- Safe Reasoning with Logic LTS.- Partial Order Semantics of Types of Nets.- A Problem Kernelization for Graph Packing.- -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games.- Conjunctive Grammars with Restricted Disjunction.- Modelling and Verifying Mobile Systems Using ?-Graphs.- On Some SAT-Variants over Linear Formulas.- The Simple Reachability Problem in Switch Graphs.- Unambiguous Erasing Morphisms in Free Monoids.- An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA.- Asynchronous Deterministic Rendezvous on the Line.- Design Validation by Symbolic Simulation and Equivalence Checking: A Case Study in Memory Optimization for Image Manipulation.- Group Input Machine.- From Outermost Termination to Innermost Termination.- Improved Algorithms for the 2-Vertex Disjoint Paths Problem.- Event-Clock Visibly Pushdown Automata.- A Machine Checked Soundness Proof for an Intermediate Verification Language.- Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams.- Symbolic Reachability Analysis of Integer Timed Petri Nets.- On Toda’s Theorem in Structural Communication Complexity.- The Minimum Reload s-t Path/Trail/Walk Problems.- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression.- A New Family of Regular Operators Fitting with the Position AutomatonComputation.- A Formal Model of Business Application Integration from Web Services (Position Paper).