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

• Hereditary history preserving bisimulation is decidable for trace-labelled systems
  Madhavan Mukund
  Lecture Notes in Computer Science 2556, 2002, pp. 289-300
• Lower bounds for embedding graphs into graphs of smaller characteristic
  K.V.M. Naidu, H. Ramesh
  Lecture Notes in Computer Science 2556, 2002, pp. 301-310
• Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
  Yogish Sabharwal, Nishant Sharma, Sandeep Sen
  Lecture Notes in Computer Science 2556, 2002, pp. 311-323
• Formal languages and algorithms for similarity based retrieval from sequence databases
  A. Prasad Sistla
  Lecture Notes in Computer Science 2556, 2002, pp. 324-335
• Decomposition in asynchronous circuit design
  Walter Vogler, Ralf Wollowski
  Lecture Notes in Computer Science 2556, 2002, pp. 336-347
• Queue layouts, tree-width, and three-dimensional graph drawing
  David R. Wood
  Lecture Notes in Computer Science 2556, 2002, pp. 348-359