default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35. SOFSEM 2009: Spindleruv Mlýn, Czech Republic
- Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia:
SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings. Lecture Notes in Computer Science 5404, Springer 2009, ISBN 978-3-540-95890-1
Invited Talks
- Arne Andersson, Jim Wilenius:
A New Analysis of Expected Revenue. 1-2 - J. Christian Attiogbé
:
Can Component/Service-Based Systems Be Proved Correct?. 3-18 - Christel Baier, Nathalie Bertrand, Marcus Größer:
Probabilistic Acceptors for Languages over Infinite Words. 19-33 - Josh Berdine:
Automatic Verification of Heap Manipulation Using Separation Logic. 34 - Nicole Immorlica:
Technology Diffusion in Social Networks. 35-36 - Radovan Janecek:
Service Oriented Architecture Pitfalls. 37-45 - Marcin Jurdzinski:
Algorithms for Solving Infinite Games. 46-48 - Giuseppe Longo:
Randomness and Determination, from Physics and Computing towards Biology. 49-61 - David C. Parkes:
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures. 62-66
Regular Papers
- Suzana Andova, Sonja Georgievska:
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems. 67-78 - Marcella Anselmo, Natasha Jonoska, Maria Madonia:
Framed Versus Unframed Two-Dimensional Languages. 79-92 - Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama:
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes. 93-104 - Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner:
The Shortcut Problem - Complexity and Approximation. 105-116 - Walter Binder, Niranjan Suri:
Green Computing: Energy Consumption Optimized Service Hosting. 117-128 - Beate Bollig:
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem. 129-140 - Thomas Chatain, Paul Gastin, Nathalie Sznajder:
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. 141-152 - Konstantinos Chatzikokolakis, Sophia Knight, Prakash Panangaden:
Epistemic Strategies and Games on Concurrent Processes. 153-166 - Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. 167-180 - Taishin Daigo, Kouichi Hirata:
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay. 181-192 - Flavio Corradini, Maria Rita Di Berardini, Walter Vogler:
Time and Fairness in a Process Algebra with Non-blocking Reading. 193-204 - Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiara Meo:
Expressiveness of Multiple Heads in CHR. 205-216 - Martin Dietzfelbinger, Ulf Schellbach:
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes. 217-228 - Juan José Domínguez-Jiménez, Antonia Estero-Botaro, Inmaculada Medina-Bulo:
A Framework for Mutant Genetic Generation for WS-BPEL. 229-240 - Walter Dosch, Annette Stümpel:
Implementing Services by Partial State Machines. 241-254 - Domenico Cantone, Simone Faro:
Pattern Matching with Swaps for Short Patterns in Linear Time. 255-266 - Ansgar Fehnker, Ralf Huuck, Bastian Schlich, Michael Tapp:
Automatic Bug Detection in Microcontroller Software by Static Program Analysis. 267-278 - David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Miguel Palomino:
On the Unification of Process Semantics: Observational Semantics. 279-290 - Viliam Geffert, Dana Pardubská:
Factoring and Testing Primes in Small Space. 291-302 - Rica Gonen, Elan Pavlov:
Adaptive Incentive-Compatible Sponsored Search Auction. 303-316 - Ondrej Habala, Marek Paralic, Viera Rozinajová, Peter Bartalos:
Semantically-Aided Data-Aware Service Workflow Composition. 317-328 - Jan Jezabek:
Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time. 329-340 - Robert König, Ueli M. Maurer, Stefano Tessaro:
Abstract Storage Devices. 341-352 - Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Deterministic Restarting Automata. 353-364 - Dongpil Kwak, Joongsoo Lee, Dohyun Kim, Younghee Lee:
User Care Preference-Based Semantic Service Discovery in a Ubiquitous Environment. 365-375 - Gerald Lüttgen, Walter Vogler:
Safe Reasoning with Logic LTS. 376-387 - Robert Lorenz, Gabriel Juhás, Sebastian Mauser:
Partial Order Semantics of Types of Nets. 388-400 - Hannes Moser:
A Problem Kernelization for Graph Packing. 401-412 - Kim Thang Nguyen:
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games. 413-424 - Alexander Okhotin, Christian Reitwießner:
Conjunctive Grammars with Restricted Disjunction. 425-436 - Frédéric Peschanski, Joël-Alexis Bialkiewicz:
Modelling and Verifying Mobile Systems Using pi-Graphs. 437-448 - Stefan Porschen, Tatjana Schmidt:
On Some SAT-Variants over Linear Formulas. 449-460 - Klaus Reinhardt:
The Simple Reachability Problem in Switch Graphs. 461-472 - Johannes C. Schneider:
Unambiguous Erasing Morphisms in Free Monoids. 473-484 - Jens Bachmann, Martin Riedl, Johann Schuster, Markus Siegle:
An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA. 485-496 - Grzegorz Stachowiak:
Asynchronous Deterministic Rendezvous on the Line. 497-508 - Kong Woei Susanto, Tim Todman, José Gabriel F. Coutinho, Wayne Luk:
Design Validation by Symbolic Simulation and Equivalence Checking: A Case Study in Memory Optimization for Image Manipulation. 509-520 - Ruslans Tarasovs, Rusins Freivalds:
Group Input Machine. 521-532 - René Thiemann:
From Outermost Termination to Innermost Termination. 533-545 - Torsten Tholey:
Improved Algorithms for the 2-Vertex Disjoint Paths Problem. 546-557 - Nguyen Van Tang, Mizuhito Ogawa:
Event-Clock Visibly Pushdown Automata. 558-569 - Frédéric Vogels, Bart Jacobs, Frank Piessens:
A Machine Checked Soundness Proof for an Intermediate Verification Language. 570-581 - Min Wan, Gianfranco Ciardo:
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams. 582-594 - Min Wan, Gianfranco Ciardo:
Symbolic Reachability Analysis of Integer Timed Petri Nets. 595-608 - Henning Wunderlich:
On Toda's Theorem in Structural Communication Complexity. 609-620 - Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
The Minimum Reload s-tPath/Trail/Walk Problems. 621-632 - Elvira Mayordomo, Philippe Moser:
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression. 633-644 - Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot:
A New Family of Regular Operators Fitting with the Position Automaton Computation. 645-655 - Kaiyu Wan, Mubarak Mohammad, Vasu S. Alagar:
A Formal Model of Business Application Integration from Web Services (Position Paper). 656-667
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
