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

• Algorithms and data structures for control dependence and related compiler problems
  Gianfranco Bilardi
  Lecture Notes in Computer Science 1203, 1997, pp. 1-2
• Algorithms and data structures for control dependence and related compiler problems
  Gianfranco Bilardi
  Lecture Notes in Computer Science 1203, 1997, pp. 1-2
• Embedding interconnection networks in grids via the layered cross product
  Guy Even, Shimon Even
  Lecture Notes in Computer Science 1203, 1997, pp. 3-12
• Embedding interconnection networks in grids via the layered cross product
  Guy Even, Shimon Even
  Lecture Notes in Computer Science 1203, 1997, pp. 3-12
• Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k = 3,4,5
  Yefim Dinitz, Zeev Nutov
  Lecture Notes in Computer Science 1203, 1997, pp. 13-24
• Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k = 3,4,5
  Yefim Dinitz, Zeev Nutov
  Lecture Notes in Computer Science 1203, 1997, pp. 13-24
• The optimum cost chromatic partition problem
  Klaus Jansen
  Lecture Notes in Computer Science 1203, 1997, pp. 25-36
• The optimum cost chromatic partition problem
  Klaus Jansen
  Lecture Notes in Computer Science 1203, 1997, pp. 25-36
• Fault tolerant K-center problems
  Samir Khuller, Robert Pless, Yoram J. Sussmann
  Lecture Notes in Computer Science 1203, 1997, pp. 37-48
• Fault tolerant K-center problems
  Samir Khuller, Robert Pless, Yoram J. Sussmann
  Lecture Notes in Computer Science 1203, 1997, pp. 37-48
• R^{SN}_{1-tt}(NP) distinguishes robust many-one and Turing completeness
  Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
  Lecture Notes in Computer Science 1203, 1997, pp. 49-60
• R^{SN}_{1-tt}(NP) distinguishes robust many-one and Turing completeness
  Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
  Lecture Notes in Computer Science 1203, 1997, pp. 49-60
• Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
  Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
  Lecture Notes in Computer Science 1203, 1997, pp. 61-73
• Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
  Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
  Lecture Notes in Computer Science 1203, 1997, pp. 61-73
• On the drift of short schedules
  Uriel Feige, Giora Rayzman
  Lecture Notes in Computer Science 1203, 1997, pp. 74-85
• On the drift of short schedules
  Uriel Feige, Giora Rayzman
  Lecture Notes in Computer Science 1203, 1997, pp. 74-85
• On removing non-degeneracy assumptions in computational geometry
  Francisco Gómez, Suneeta Ramaswami, Godfried Toussaint
  Lecture Notes in Computer Science 1203, 1997, pp. 86-99
• On removing non-degeneracy assumptions in computational geometry
  Francisco Gómez, Suneeta Ramaswami, Godfried Toussaint
  Lecture Notes in Computer Science 1203, 1997, pp. 86-99
• Maintaining maxima under boundary updates
  Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo
  Lecture Notes in Computer Science 1203, 1997, pp. 100-109
• Maintaining maxima under boundary updates
  Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo
  Lecture Notes in Computer Science 1203, 1997, pp. 100-109
• An optimal algorithm for one-separation of a set of isothetic polygons
  Amitava Datta, Kamala Krithivasan, Thomas Ottmann
  Lecture Notes in Computer Science 1203, 1997, pp. 110-121
• An optimal algorithm for one-separation of a set of isothetic polygons
  Amitava Datta, Kamala Krithivasan, Thomas Ottmann
  Lecture Notes in Computer Science 1203, 1997, pp. 110-121
• Nice drawings for planar bipartite graphs
  Ulrich Föss̈meier, Michael Kaufmann
  Lecture Notes in Computer Science 1203, 1997, pp. 122-134
• Nice drawings for planar bipartite graphs
  Ulrich Föss̈meier, Michael Kaufmann
  Lecture Notes in Computer Science 1203, 1997, pp. 122-134
• Area requirement of Gabriel drawings
  G. Liotta, R. Tamassia, I.G. Tollis, P. Vocca
  Lecture Notes in Computer Science 1203, 1997, pp. 135-146