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

• On the approximation of largest common subtrees and largest common point sets
  Tatsuya Akutsu, Magnús M. Halldórsson
  Lecture Notes in Computer Science 834, 1994, pp. 405-413
• The generating algorithm for quasi-full Steiner trees
  Jiyu Ding
  Lecture Notes in Computer Science 834, 1994, pp. 428-432
• Analysing deletions in competitive self-adjusting linear list algorithms
  Lucas Chi Kwong Hui, Charles U. Martel
  Lecture Notes in Computer Science 834, 1994, pp. 433-441
• Are Fibonacci heaps optimal?
  Diab Abuaiadh, Jeffrey H. Kingston
  Lecture Notes in Computer Science 834, 1994, pp. 442-450
• An efficient parallel strategy for recognizing series-parallel graphs
  Sun-Yuan Hsieh, Chin-Wen Ho
  Lecture Notes in Computer Science 834, 1994, pp. 496-504
• On greedy tetrahedralization of points in 3d
  Francis Y. Chin, Cao An Wang
  Lecture Notes in Computer Science 834, 1994, pp. 532-540
• The totally-perfect bipartite graph and its construction
  Kunihiro Fujiyoshi, Yoji Kajitani, Hiroshi Niitsu
  Lecture Notes in Computer Science 834, 1994, pp. 541-549
• Revisiting circular arc graphs
  Lin Chen
  Lecture Notes in Computer Science 834, 1994, pp. 559-566
• On the size of ordered binary decision diagrams representing threshold functions
  Kazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima
  Lecture Notes in Computer Science 834, 1994, pp. 584-592
• Definition and existence of super complexity cores
  Ingrid Biehl
  Lecture Notes in Computer Science 834, 1994, pp. 600-606
• A convex hull algorithm on coarse-grained multiprocessors
  Xiaotie Deng
  Lecture Notes in Computer Science 834, 1994, pp. 634-642
• Reporting and counting intersections of lines within a polygon
  Tetsuo Asano
  Lecture Notes in Computer Science 834, 1994, pp. 652-659
• A new problem in string searching
  George Havas, Jin Xian Lian
  Lecture Notes in Computer Science 834, 1994, pp. 660-668
• A randomized algorithm to Finite Automata Public Key Cryptosystem
  Feng Bao, Yoshihide Igarashi
  Lecture Notes in Computer Science 834, 1994, pp. 678-686
• Petri nets and the equivalence problem
  Yoram Hirshfeld
  Lecture Notes in Computer Science 832, 1994, pp. 165-174
• Bit-vector encoding for partially ordered sets
  Michel Habib, Lhouari Nourine
  Lecture Notes in Computer Science 831, 1994, pp. 1-12
• Intervals and orders: What comes after interval orders?
  Kenneth P. Bogart
  Lecture Notes in Computer Science 831, 1994, pp. 13-32
• Upward drawings to fit surfaces
  S. Mehdi Hashemi, Ivan Rival
  Lecture Notes in Computer Science 831, 1994, pp. 53-58
• A characterization of graphs with vertex cover up to five
  Kevin Cattel, Michael J. Dinneen
  Lecture Notes in Computer Science 831, 1994, pp. 86-99
• Testing hereditary properties efficiently on average
  Jens Gustedt, Angelika Steger
  Lecture Notes in Computer Science 831, 1994, pp. 100-116
• Orders, k-sets and fast halfplane search on paged memory
  Paolo G. Franciosa, Maurizio Talamo
  Lecture Notes in Computer Science 831, 1994, pp. 117-127
• Representation of an order as union of interval orders
  Christian Capelle
  Lecture Notes in Computer Science 831, 1994, pp. 143-161
• The computation of the jump number of convex graphs
  Elias Dahlhaus
  Lecture Notes in Computer Science 831, 1994, pp. 176-185
• Valuations and unambiguity of languages, with applications to fractal geometry
  Henning Fernau, Ludwig Staiger
  Lecture Notes in Computer Science 820, 1994, pp. 11-22
• Deciding properties of integral relational automata
  Kārlis C̑erāns
  Lecture Notes in Computer Science 820, 1994, pp. 35-46