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

• Locally commutative categories
  Arkadev Chattopadhyay, Denis Thérien
  Lecture Notes in Computer Science 2719, 2003, pp. 984-995
• Semi-pullbacks and bisimulations in categories of stochastic relations
  Ernst-Erich Doberkat
  Lecture Notes in Computer Science 2719, 2003, pp. 996-1007
• Quantitative analysis of probabilistic lossy channel systems
  Alexander Rabinovich
  Lecture Notes in Computer Science 2719, 2003, pp. 1008-1021
• Discounting the future in systems theory
  Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar
  Lecture Notes in Computer Science 2719, 2003, pp. 1022-1037
• Information flow in concurrent games
  Luca de Alfaro, Marco Faella
  Lecture Notes in Computer Science 2719, 2003, pp. 1038-1053
• Impact of local topological information on random walks on finite graphs
  Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita
  Lecture Notes in Computer Science 2719, 2003, pp. 1054-1067
• Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces
  Jens Jägersküpper
  Lecture Notes in Computer Science 2719, 2003, pp. 1068-1079
• Optimal coding and sampling of triangulations
  Dominique Poulalhon, Gilles Schaeffer
  Lecture Notes in Computer Science 2719, 2003, pp. 1080-1094
• Generating labeled planar graphs uniformly at random
  Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
  Lecture Notes in Computer Science 2719, 2003, pp. 1095-1107
• Online load balancing made simple: Greedy strikes back
  Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
  Lecture Notes in Computer Science 2719, 2003, pp. 1108-1122
• Real-time scheduling with a budget
  Joseph (Seffi) Naor, Hadas Shachnai, Tami Tamir
  Lecture Notes in Computer Science 2719, 2003, pp. 1123-1137
• Improved approximation algorithms for minimum-space advertisement scheduling
  Brian C. Dean, Michel X. Goemans
  Lecture Notes in Computer Science 2719, 2003, pp. 1138-1152
• Anycasting in adversarial systems: Routing and admission control
  Baruch Awerbuch, André Brinkmann, Christian Scheideler
  Lecture Notes in Computer Science 2719, 2003, pp. 1153-1168
• Dynamic algorithms for approximating interdistances
  Sergei Bespamyatnikh, Michael Segal
  Lecture Notes in Computer Science 2719, 2003, pp. 1169-1180
• Solving the robots gathering problem
  Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
  Lecture Notes in Computer Science 2719, 2003, pp. 1181-1196