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 YEAR=2013

• Lift-and-project methods for set cover and knapsack
  Eden Chlamtác̑, Zachary Friggstad, Konstantinos Georgiou
  Lecture Notes in Computer Science 8037, 2013, pp. 256-267
• Optimal time-convex hull under the L_p metrics
  Bang-Sin Dai, Mong-Jen Kao, D.T. Lee
  Lecture Notes in Computer Science 8037, 2013, pp. 268-279
• Blame trees
  Erik D. Demaine, Pavel Panchekha, David A. Wilson, Edward Z. Yang
  Lecture Notes in Computer Science 8037, 2013, pp. 280-290
• Neighborhood-preserving mapping between trees
  Jan Baumbach, Jiong Guo, Rashid Ibragimov
  Lecture Notes in Computer Science 8037, 2013, pp. 427-438
• 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
• 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
• 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