Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=5126

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Composable formal security analysis: Juggling soundness, simplicity and efficiency
Ran Canetti
Lecture Notes in Computer Science 5126, 2008, pp. 1-13
Newton's method for \omega-continuous semirings
Javier Esparza, Stefan Kiefer, Michael Luttenberger
Lecture Notes in Computer Science 5126, 2008, pp. 14-26
The tractability frontier for NFA minimization
Henrik Björklund, Wim Martens
Lecture Notes in Computer Science 5126, 2008, pp. 27-38
Finite automata, digraph connectivity, and regular expression size
Hermann Gruber, Markus Holzer
Lecture Notes in Computer Science 5126, 2008, pp. 39-50
Leftist grammars are non-primitive recursive
Tomasz Jurdziński
Lecture Notes in Computer Science 5126, 2008, pp. 51-62
On the computational completeness of equations over sets of natural numbers
Artur Jeż, Alexander Okhotin
Lecture Notes in Computer Science 5126, 2008, pp. 63-74
Placement inference for a client-server calculus
Matthias Neubauer, Peter Thiemann
Lecture Notes in Computer Science 5126, 2008, pp. 75-86
Extended pi-calculi
Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson
Lecture Notes in Computer Science 5126, 2008, pp. 87-98
Completeness and logical full abstraction in modal logics for typed mobile processes
Martin Berger, Kohei Honda, Nobuko Yoshida
Lecture Notes in Computer Science 5126, 2008, pp. 99-111
On the sets of real numbers recognized by finite automata in multiple bases
Bernard Boigelot, Julien Brusten, Véronique Bruyère
Lecture Notes in Computer Science 5126, 2008, pp. 112-123
On expressiveness and complexity in real-time model checking
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell
Lecture Notes in Computer Science 5126, 2008, pp. 124-135
STORMED hybrid systems
Vladimeros Vladimerou, Pavithra Prabhakar, Mahesh Viswanathan, Geir Dullerud
Lecture Notes in Computer Science 5126, 2008, pp. 136-147
Controller synthesis and verification for Markov decision processes with qualitative branching time objectives
Tomás̑ Brázdil, Vojtȇch Forejt, Antonín Kuc̑era
Lecture Notes in Computer Science 5126, 2008, pp. 148-159
On Datalog vs. LFP
Anuj Dawar, Stephan Kreutzer
Lecture Notes in Computer Science 5126, 2008, pp. 160-171
Directed st-connectivity is not expressible in symmetric Datalog
László Egri, Benoît Larose, Pascal Tesson
Lecture Notes in Computer Science 5126, 2008, pp. 172-183
Non-dichotomies in constraint satisfaction complexity
Manuel Bodirsky, Martin Grohe
Lecture Notes in Computer Science 5126, 2008, pp. 184-196
Quantified constraint satisfaction and the polynomially generated powers property
Hubie Chen
Lecture Notes in Computer Science 5126, 2008, pp. 197-208
When does partial commutative closure preserve regularity?
Antonio Cano Gómez, Giovanna Guaiana, Jean-Éric Pin
Lecture Notes in Computer Science 5126, 2008, pp. 209-220
Weighted logics for nested words and algebraic formal power series
Christian Mathissen
Lecture Notes in Computer Science 5126, 2008, pp. 221-232
Tree languages defined in first-order logic with one quantifier alternation
Mikoƚaj Bojańczyk, Luc Segoufin
Lecture Notes in Computer Science 5126, 2008, pp. 233-245
Duality and equational theory of regular languages
Mai Gehrke, Serge Grigorieff, Jean-Éric Pin
Lecture Notes in Computer Science 5126, 2008, pp. 246-257
Reversible flowchart languages and the structured reversible program theorem
Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück
Lecture Notes in Computer Science 5126, 2008, pp. 258-270
Attribute grammars and categorical semantics
Shin-ya Katsumata
Lecture Notes in Computer Science 5126, 2008, pp. 271-282
A domain theoretic model of qubit channels
Keye Martin
Lecture Notes in Computer Science 5126, 2008, pp. 283-297
Interacting quantum observables
Bob Coecke, Ross Duncan
Lecture Notes in Computer Science 5126, 2008, pp. 298-310

Seiten 1 2 3 >