×

zbMATH — the first resource for mathematics

SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24–30, 2009. Proceedings. (English) Zbl 1154.68020
Lecture Notes in Computer Science 5404. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). xvii, 670 p. (2009).

Show indexed articles as search result.

The articles of mathematical interest will be reviewed individually. For the preceding conference see [Zbl 1131.68008].
Indexed articles:
Andersson, Arne; Wilenius, Jim, A new analysis of expected revenue. Combinatorial and simultaneous auctions, 1-2 [Zbl 1206.91039]
Baier, Christel; Bertrand, Nathalie; Größer, Marcus, Probabilistic acceptors for languages over infinite words, 19-33 [Zbl 1206.68167]
Longo, Giuseppe, Randomness and determination, from physics and computing towards biology, 49-61 [Zbl 1206.68222]
Parkes, David C., When analysis fails: heuristic mechanism design via self-correcting procedures, 62-66 [Zbl 1206.68312]
Andova, Suzana; Georgievska, Sonja, On compositionality, efficiency, and applicability of abstraction in probabilistic systems, 67-78 [Zbl 1206.68207]
Anselmo, Marcella; Jonoska, Natasha; Madonia, Maria, Framed versus unframed two-dimensional languages, 79-92 [Zbl 1206.68166]
Aratsu, Taku; Hirata, Kouichi; Kuboyama, Tetsuji, Approximating tree edit distance through string edit distance for binary tree codes, 93-104 [Zbl 1197.68039]
Bauer, Reinhard; D’Angelo, Gianlorenzo; Delling, Daniel; Wagner, Dorothea, The shortcut problem – complexity and approximation, 105-116 [Zbl 1206.68226]
Bollig, Beate, On the OBDD complexity of threshold functions and the variable ordering problem (extended abstract), 129-140 [Zbl 1206.68100]
Chatain, Thomas; Gastin, Paul; Sznajder, Nathalie, Natural specifications yield decidability for distributed synthesis of asynchronous systems, 141-152 [Zbl 1206.68210]
Chatzikokolakis, Konstantinos; Knight, Sophia; Panangaden, Prakash, Epistemic strategies and games on concurrent processes, 153-166 [Zbl 1206.68211]
Chen, Taolue; Fokkink, Wan; van Glabbeek, Rob, On finite bases for weak semantics: failures versus impossible futures, 167-180 [Zbl 1206.68212]
Daigo, Taishin; Hirata, Kouichi, On generating all maximal acyclic subhypergraphs with polynomial delay, 181-192 [Zbl 1206.68230]
Corradini, Flavio; Di Berardini, Maria Rita; Vogler, Walter, Time and fairness in a process algebra with non-blocking reading, 193-204 [Zbl 1206.68213]
Di Giusto, Cinzia; Gabbrielli, Maurizio; Meo, Maria Chiara, Expressiveness of multiple heads in CHR, 205-216 [Zbl 1206.68078]
Dietzfelbinger, Martin; Schellbach, Ulf, Weaknesses of cuckoo hashing with a simple universal hash class: The case of large universes, 217-228 [Zbl 1206.68101]
Dosch, Walter; Stümpel, Annette, Implementing services by partial state machines, 241-254 [Zbl 1206.68086]
Cantone, Domenico; Faro, Simone, Pattern matching with swaps for short patterns in linear time, 255-266 [Zbl 1206.68376]
de Frutos Escrig, David; Gregorio Rodríguez, Carlos; Palomino, Miguel, On the unification of process semantics: observational semantics, 279-290 [Zbl 1206.68220]
Geffert, Viliam; Pardubská, Dana, Factoring and testing primes in small space, 291-302 [Zbl 1206.68144]
Gonen, Rica; Pavlov, Elan, Adaptive incentive-compatible sponsored search auction, 303-316 [Zbl 1206.68048]
Jeżabek, Jan, Increasing machine speed in on-line scheduling of weighted unit-length jobs in slotted time, 329-340 [Zbl 1206.68066]
König, Robert; Maurer, Ueli; Tessaro, Stefano, Abstract storage devices, 341-352 [Zbl 1206.68109]
Kutrib, Martin; Messerschmidt, Hartmut; Otto, Friedrich, On stateless deterministic restarting automata, 353-364 [Zbl 1206.68116]
Lüttgen, Gerald; Vogler, Walter, Safe reasoning with Logic LTS, 376-387 [Zbl 1206.68189]
Lorenz, Robert; Juhás, Gabriel; Mauser, Sebastian, Partial order semantics of types of nets, 388-400 [Zbl 1206.68216]
Moser, Hannes, A problem kernelization for graph packing, 401-412 [Zbl 1206.68239]
Thang, Nguyen Kim, \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and connection games, 413-424 [Zbl 1206.68139]
Okhotin, Alexander; Reitwießner, Christian, Conjunctive grammars with restricted disjunction, 425-436 [Zbl 1206.68161]
Peschanski, Frédéric; Bialkiewicz, Joël-Alexis, Modelling and verifying mobile systems using \(\pi \)-graphs, 437-448 [Zbl 1206.68218]
Porschen, Stefan; Schmidt, Tatjana, On some SAT-variants over linear formulas, 449-460 [Zbl 1206.68151]
Reinhardt, Klaus, The simple reachability problem in switch graphs, 461-472 [Zbl 1206.68240]
Schneider, Johannes C., Unambiguous erasing morphisms in free monoids, 473-484 [Zbl 1206.68198]
Bachmann, Jens; Riedl, Martin; Schuster, Johann; Siegle, Markus, An efficient symbolic elimination algorithm for the stochastic process algebra tool CASPA, 485-496 [Zbl 1206.68208]
Stachowiak, Grzegorz, Asynchronous deterministic rendezvous on the line, 497-508 [Zbl 1206.68242]
Tarasovs, Ruslans; Freivalds, Rūsiņš, Group input machine, 521-532 [Zbl 1206.68182]
Thiemann, René, From outermost termination to innermost termination, 533-545 [Zbl 1206.68094]
Tholey, Torsten, Improved algorithms for the 2-vertex disjoint paths problem, 546-557 [Zbl 1206.68243]
Van Tang, Nguyen; Ogawa, Mizuhito, Event-clock visibly pushdown automata, 558-569 [Zbl 1206.68183]
Vogels, Frédéric; Jacobs, Bart; Piessens, Frank, A machine checked soundness proof for an intermediate verification language, 570-581 [Zbl 1206.68193]
Wan, Min; Ciardo, Gianfranco, Symbolic state-space generation of asynchronous systems using extensible decision diagrams, 582-594 [Zbl 1206.68104]
Wan, Min; Ciardo, Gianfranco, Symbolic reachability analysis of integer timed Petri nets, 595-608 [Zbl 1206.68219]
Wunderlich, Henning, On Toda’s theorem in structural communication complexity, 609-620 [Zbl 1206.68132]
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme, The minimum reload \(s\)-\(t\) path/trail/walk problems, 621-632 [Zbl 1206.68235]
Mayordomo, Elvira; Moser, Philippe, Polylog space compression is incomparable with Lempel-Ziv and pushdown compression, 633-644 [Zbl 1206.68113]
Caron, Pascal; Champarnaud, Jean-Marc; Mignot, Ludovic, A new family of regular operators fitting with the position automaton computation, 645-655 [Zbl 1206.68169]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI