Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=7966

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

Asynchronous games over tree architectures
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
Lecture Notes in Computer Science 7966, 2013, pp. 275-286
Querying the guarded fragment with transitivity
Georg Gottlob, Andreas Pieris, Lidia Tendera
Lecture Notes in Computer Science 7966, 2013, pp. 287-298
Contractive signatures with recursive types, type parameters, and abstract types
Hyeonseung Im, Keiko Nakata, Sungwoo Park
Lecture Notes in Computer Science 7966, 2013, pp. 299-311
Algebras, automata and logic for languages of labeled birooted trees
David Janin
Lecture Notes in Computer Science 7966, 2013, pp. 312-323
One-variable word equations in linear time
Artur Jeż
Lecture Notes in Computer Science 7966, 2013, pp. 324-335
The IO and OI hierarchies revisited
Gregory M. Kobele, Sylvain Salvati
Lecture Notes in Computer Science 7966, 2013, pp. 336-348
Evolving graph-structures and their implicit computational complexity
Daniel Leivant, Jean-Yves Marion
Lecture Notes in Computer Science 7966, 2013, pp. 349-360
Rational subsets and submonoids of wreath products
Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
Lecture Notes in Computer Science 7966, 2013, pp. 361-372
Fair subtyping for open session types
Luca Padovani
Lecture Notes in Computer Science 7966, 2013, pp. 373-384
Coeffects: Unified static analysis of context-dependence
Tomas Petricek, Dominic Orchard, Alan Mycroft
Lecture Notes in Computer Science 7966, 2013, pp. 385-397
Proof systems for retracts in simply typed lambda calculus
Colin Stirling
Lecture Notes in Computer Science 7966, 2013, pp. 398-409
Presburger arithmetic, rational generating functions, and quasi-polynomials
Kevin Woods
Lecture Notes in Computer Science 7966, 2013, pp. 410-421
Revisiting the equivalence problem for finite multitape automata
James Worrell
Lecture Notes in Computer Science 7966, 2013, pp. 422-433
Silent transitions in automata with storage
Georg Zetzsche
Lecture Notes in Computer Science 7966, 2013, pp. 434-445
New online algorithms for story scheduling in web advertising
Susanne Albers, Achim Passen
Lecture Notes in Computer Science 7966, 2013, pp. 446-458
Sketching for big data recommender systems using fast pseudo-random fingerprints
Yoram Bachrach, Ely Porat
Lecture Notes in Computer Science 7966, 2013, pp. 459-471
Physarum can compute shortest paths: Convergence proofs and complexity bounds
Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn
Lecture Notes in Computer Science 7966, 2013, pp. 472-483
On revenue maximization for agents with costly information acquisition
L. Elisa Celis, Dimitrios C. Gklezakos, Anna R. Karlin
Lecture Notes in Computer Science 7966, 2013, pp. 484-495
Price of stability in polynomial congestion games
George Christodoulou, Martin Gairing
Lecture Notes in Computer Science 7966, 2013, pp. 496-507
Localization for a system of colliding robots
Jurek Czyzowicz, Evangelos Kranakis, Eduardo Pacheco
Lecture Notes in Computer Science 7966, 2013, pp. 508-519
Fast collaborative graph exploration
Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Paja̧k, Przemysƚaw Uznański
Lecture Notes in Computer Science 7966, 2013, pp. 520-532
Deterministic polynomial approach in the plane
Yoann Dieudonné, Andrzej Pelc
Lecture Notes in Computer Science 7966, 2013, pp. 533-544
Outsourced pattern matching
Sebastian Faust, Carmit Hazay, Daniele Venturi
Lecture Notes in Computer Science 7966, 2013, pp. 545-556
Learning a ring cheaply and fast
Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
Lecture Notes in Computer Science 7966, 2013, pp. 557-568
Competitive auctions for markets with positive externalities
Nick Gravin, Pinyan Lu
Lecture Notes in Computer Science 7966, 2013, pp. 569-580

Seiten < 1 2 3 >