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=2010

• Stability of \epsilon-kernels
  Pankaj K. Agarwal, Jeff M. Phillips, Hai Yu
  Lecture Notes in Computer Science 6346, 2010, pp. 487-499
• The geodesic diameter of polygonal domains
  Sang Won Bae, Matias Korman, Yoshio Okamoto
  Lecture Notes in Computer Science 6346, 2010, pp. 500-511
• New developments in quantum algorithms
  Andris Ambainis
  Lecture Notes in Computer Science 6281, 2010, pp. 1-11
• Persistent homology under non-uniform error
  Paul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit Patel
  Lecture Notes in Computer Science 6281, 2010, pp. 12-23
• Balanced queries: Divide and conquer
  Dmitri Akatov, Georg Gottlob
  Lecture Notes in Computer Science 6281, 2010, pp. 42-54
• Slowly synchronizing automata and digraphs
  Dmitry Ananichev, Vladimir Gusev, Mikhail Volkov
  Lecture Notes in Computer Science 6281, 2010, pp. 55-65
• Weights of exact threshold functions
  László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun
  Lecture Notes in Computer Science 6281, 2010, pp. 66-77
• Proof systems and transformation games
  Yoram Bachrach, Michael Zuckerman, Michael Wooldridge, Jeffrey S. Rosenschein
  Lecture Notes in Computer Science 6281, 2010, pp. 78-89
• Scheduling real-time mixed-criticality jobs
  Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie
  Lecture Notes in Computer Science 6281, 2010, pp. 90-101
• A dexptime-complete Dolev-Yao theory with distributive encryption
  A. Baskar, R. Ramanujam, S.P. Suresh
  Lecture Notes in Computer Science 6281, 2010, pp. 102-113
• On problem kernels for possible winner determination under the k-approval protocol
  Nadja Betzler
  Lecture Notes in Computer Science 6281, 2010, pp. 114-125
• Counting minimum (s, t)-cuts in weighted planar graphs in polynomial time
  Ivona Bezáková, Adam J. Friedlander
  Lecture Notes in Computer Science 6281, 2010, pp. 126-137
• Finding best swap edges minimizing the routing cost of a spanning tree
  Davide Bilò, Luciano Gualà, Guido Proietti
  Lecture Notes in Computer Science 6281, 2010, pp. 138-149
• Improved approximability and non-approximability results for graph diameter decreasing problems
  Davide Bilò, Luciano Gualà, Guido Proietti
  Lecture Notes in Computer Science 6281, 2010, pp. 150-161
• Distance constraint satisfaction problems
  Manuel Bodirsky, Victor Dalmau, Barnaby Martin, Michael Pinsker
  Lecture Notes in Computer Science 6281, 2010, pp. 162-173
• Faster algorithms on branch and clique decompositions
  Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M.M. van Rooij, Martin Vatshelle
  Lecture Notes in Computer Science 6281, 2010, pp. 174-185
• Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks
  Beate Bollig
  Lecture Notes in Computer Science 6281, 2010, pp. 186-197
• Robust computations with dynamical systems
  Olivier Bournez, Daniel S. Graça, Emmanuel Hainry
  Lecture Notes in Computer Science 6281, 2010, pp. 198-208
• On factor universality in symbolic spaces
  Laurent Boyer, Guillaume Theyssier
  Lecture Notes in Computer Science 6281, 2010, pp. 209-220
• Toward a deterministic polynomial time algorithm with optimal additive query complexity
  Nader H. Bshouty, Hanna Mazzawi
  Lecture Notes in Computer Science 6281, 2010, pp. 221-232
• Resource combinatory algebras
  Alberto Carraro, Thomas Ehrhard, Antonino Salibra
  Lecture Notes in Computer Science 6281, 2010, pp. 233-245
• Randomness for free
  Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger
  Lecture Notes in Computer Science 6281, 2010, pp. 246-257
• Qualitative analysis of partially-observable Markov decision processes
  Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
  Lecture Notes in Computer Science 6281, 2010, pp. 258-269
• All symmetric predicates in NSPACE(n^2) are stably computable by the mediated population protocol model
  Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis
  Lecture Notes in Computer Science 6281, 2010, pp. 270-281
• Online clustering with variable sized clusters
  János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
  Lecture Notes in Computer Science 6281, 2010, pp. 282-293