Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4052

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

Identity-based encryption gone wild
Michel Abdalla, Dario Catalano, Alexander W. Dent, John Malone-Lee, Gregory Neven, Nigel P. Smart
Lecture Notes in Computer Science 4052, 2006, pp. 300-311
Deterministic priority mean-payoff games as limits of discounted games
Hugo Gimbert, Wiesƚaw Zielonka
Lecture Notes in Computer Science 4052, 2006, pp. 312-323
Recursive concurrent stochastic games
Kousha Etessami, Mihalis Yannakakis
Lecture Notes in Computer Science 4052, 2006, pp. 324-335
Half-positional determinacy of infinite games
Eryk Kopczyński
Lecture Notes in Computer Science 4052, 2006, pp. 336-347
A game-theoretic approach to deciding higher-order matching
Colin Stirling
Lecture Notes in Computer Science 4052, 2006, pp. 348-359
Descriptive and relative completeness of logics for higher-order functions
Kohei Honda, Martin Berger, Nobuko Yoshida
Lecture Notes in Computer Science 4052, 2006, pp. 360-371
Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism
Rasmus Ejlers Mgelberg
Lecture Notes in Computer Science 4052, 2006, pp. 372-383
Typed GoI for exponentials
Esfandiar Haghverdi
Lecture Notes in Computer Science 4052, 2006, pp. 384-395
Commutative locative quantifiers for multiplicative linear logic
Stefano Guerrini, Patrizia Marzuoli
Lecture Notes in Computer Science 4052, 2006, pp. 396-407
The wadge hierarchy of deterministic tree languages
Filip Murlak
Lecture Notes in Computer Science 4052, 2006, pp. 408-419
Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier
Lecture Notes in Computer Science 4052, 2006, pp. 420-431
On complexity of grammars related to the safety problem
Tomasz Jurdziński
Lecture Notes in Computer Science 4052, 2006, pp. 432-443
Jumbo \lambda-calculus
Paul Blain Levy
Lecture Notes in Computer Science 4052, 2006, pp. 444-455
\lambda-RBAC: Programming with role-based access controll
Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely
Lecture Notes in Computer Science 4052, 2006, pp. 456-467
Communication of two stacks and rewriting
Juhani Karhumäki, Michal Kunc, Alexander Okhotin
Lecture Notes in Computer Science 4052, 2006, pp. 468-479
On the axiomatizability of priority
Luca Aceto, Taolue Chen, Wan Fokkink, Anna Ingolfsdottir
Lecture Notes in Computer Science 4052, 2006, pp. 480-491
A finite equational base for CCS with left merge and communication merge
Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Bas Luttik
Lecture Notes in Computer Science 4052, 2006, pp. 492-503
Theories of HNN-extensions and amalgamated products
Markus Lohrey, Géraud Sénizergues
Lecture Notes in Computer Science 4052, 2006, pp. 504-515
On intersection problems for polynomially generated sets
Wong Karianto, Aloys Krieg, Wolfgang Thomas
Lecture Notes in Computer Science 4052, 2006, pp. 516-527
Invisible safety of distributed protocols
Ittai Balaban, Amir Pnueli, Lenore Zuck
Lecture Notes in Computer Science 4052, 2006, pp. 528-539
The complexity of enriched \mu-calculi
Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi
Lecture Notes in Computer Science 4052, 2006, pp. 540-551
Interpreting tree-to-tree queries
Michael Benedikt, Christoph Koch
Lecture Notes in Computer Science 4052, 2006, pp. 552-564
Constructing exponential-size deterministic Zielonka automata
Blaise Genest, Anca Muscholl
Lecture Notes in Computer Science 4052, 2006, pp. 565-576
Flat parametric counter automata
Marius Bozga, Radu Iosif, Yassine Lakhnech
Lecture Notes in Computer Science 4052, 2006, pp. 577-588
Lower bounds for complementation of \omega-automata via the full automata technique
Qiqi Yan
Lecture Notes in Computer Science 4052, 2006, pp. 589-600

Seiten < 1 2