Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=7966

• Algorithms, networks, and social phenomena
  Jon Kleinberg
  Lecture Notes in Computer Science 7966, 2013, pp. 1-3
• Recent advances for a classical scheduling problem
  Susanne Albers
  Lecture Notes in Computer Science 7966, 2013, pp. 4-14
• Formalizing and reasoning about quality
  Shaull Almagor, Udi Boker, Orna Kupferman
  Lecture Notes in Computer Science 7966, 2013, pp. 15-27
• The square root phenomenon in planar graphs
  Dániel Marx
  Lecture Notes in Computer Science 7966, 2013, pp. 28-28
• A guided tour in random intersection graphs
  Paul G. Spirakis, Sotiris Nikoletseas, Christoforos Raptopoulos
  Lecture Notes in Computer Science 7966, 2013, pp. 29-35
• To be uncertain is uncomfortable, but to be certain is ridiculous
  Peter Widmayer
  Lecture Notes in Computer Science 7966, 2013, pp. 36-36
• Decision problems for additive regular functions
  Rajeev Alur, Mukund Raghothaman
  Lecture Notes in Computer Science 7966, 2013, pp. 37-48
• Beyond differential privacy: Composition theorems and relational logic for f-divergences between probabilistic programs
  Gilles Barthe, Federico Olmedo
  Lecture Notes in Computer Science 7966, 2013, pp. 49-60
• A maximal entropy stochastic process for a timed automaton
  Nicolas Basset
  Lecture Notes in Computer Science 7966, 2013, pp. 61-73
• Complexity of two-variable logic on finite trees
  Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieroński, Rastislav Lenhardt, Philip Mazowiecki, James Worell
  Lecture Notes in Computer Science 7966, 2013, pp. 74-88
• Nondeterminism in the presence of a diverse or unknown future
  Udi Boker, Denis Kuperberg, Orna Kupferman, Michaƚ Skrzypczak
  Lecture Notes in Computer Science 7966, 2013, pp. 89-100
• Coalgebraic announcement logics
  Facundo Carreiro, Daniel Gorín, Lutz Schröder
  Lecture Notes in Computer Science 7966, 2013, pp. 101-112
• Self-shuffling words
  Émilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni
  Lecture Notes in Computer Science 7966, 2013, pp. 113-124
• Block-sorted quantified conjunctive queries
  Hubie Chen, Dániel Marx
  Lecture Notes in Computer Science 7966, 2013, pp. 125-136
• From security protocols to pushdown automata
  Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
  Lecture Notes in Computer Science 7966, 2013, pp. 137-149
• Efficient separability of regular languages by subsequences and suffixes
  Wojciech Czerwiński, Wim Martens, Tomás̑ Masopust
  Lecture Notes in Computer Science 7966, 2013, pp. 150-161
• On the complexity of verifying regular properties on flat counter systems
  Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
  Lecture Notes in Computer Science 7966, 2013, pp. 162-173
• Multiparty compatibility in communicating automata: Characterisation and synthesis of global session types
  Pierre-Malo Deniélou, Nobuko Yoshida
  Lecture Notes in Computer Science 7966, 2013, pp. 174-186
• Component reconfiguration in the presence of conflicts
  Roberto Di Cosmo, Jacopo Mauro, Stefano Zacchiroli, Gianluigi Zavattaro
  Lecture Notes in Computer Science 7966, 2013, pp. 187-198
• Stochastic context-free grammars, regular languages, and Newton's method
  Kousha Etessami, Alistair Stewart, Mihalis Yannakakis
  Lecture Notes in Computer Science 7966, 2013, pp. 199-211
• Reachability in two-clock timed automata is PSPACE-complete
  John Fearnley, Marcin Jurdziński
  Lecture Notes in Computer Science 7966, 2013, pp. 212-223
• Ramsey goes visibly pushdown
  Oliver Friedmann, Felix Klaedtke, Martin Lange
  Lecture Notes in Computer Science 7966, 2013, pp. 224-237
• Checking equality and regularity for normed BPA with silent moves
  Yuxi Fu
  Lecture Notes in Computer Science 7966, 2013, pp. 238-249
• Fo model checking of interval graphs
  Robert Ganian, Petr Hlinȇný, Daniel Král', Jan Obdrz̑álek, Jarett Schwartz, Jakub Teska
  Lecture Notes in Computer Science 7966, 2013, pp. 250-262
• Strategy composition in compositional games
  Marcus Gelderie
  Lecture Notes in Computer Science 7966, 2013, pp. 263-274