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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=1989

• On the complexity of approximating the independent set problem
  Piotr Berman, Georg Schnitger
  Lecture Notes in Computer Science 349, 1989, pp. 256-268
• Distributed computing on transitive networks: The torus
  Paul W. Beame, Hans L. Bodländer
  Lecture Notes in Computer Science 349, 1989, pp. 294-303
• Fault masking probabilities with single and multiple signature analysis
  Jürgen Doenhardt
  Lecture Notes in Computer Science 349, 1989, pp. 327-338
• Chain properties of rule closures
  Miki Hermann
  Lecture Notes in Computer Science 349, 1989, pp. 339-347
• The query topology in logic programming
  Aida Batarekh, V.S. Subrahmanian
  Lecture Notes in Computer Science 349, 1989, pp. 375-387
• Testing membership: Beyond permutation groups
  M. Beaudry, P. McKenzie, D. Thérien
  Lecture Notes in Computer Science 349, 1989, pp. 388-399
• Deciding bisimulation equivalences for a class of non-finite-state programs
  Bengt Jonsson, Joachim Parrow
  Lecture Notes in Computer Science 349, 1989, pp. 421-433
• Measure of parallelism of distributed computations
  Bernadette Charron-Bost
  Lecture Notes in Computer Science 349, 1989, pp. 434-445
• Decidability of weak fairness in Petri nets
  Petr Janc̑ar
  Lecture Notes in Computer Science 349, 1989, pp. 446-457
• On the equivalence problem for deterministic multitape automata and transducers
  Karel Culik II, Juhani Karhumäki
  Lecture Notes in Computer Science 349, 1989, pp. 468-479
• Rounds versus time for the two person pebble game
  Bala Kalyanasundaram, Georg Schnitger
  Lecture Notes in Computer Science 349, 1989, pp. 517-529
• NC-Algorithms for graphs with small treewidth
  H.L. Bodlaender
  Lecture Notes in Computer Science 344, 1989, pp. 1-10
• Graph-theoretic properties compatible with graph derivations
  A. Habel
  Lecture Notes in Computer Science 344, 1989, pp. 11-29
• The monadic second-order logic of graphs
  B. Courcelle
  Lecture Notes in Computer Science 344, 1989, pp. 30-53
• On systems of equations defining infinite graphs
  M. Bauderon
  Lecture Notes in Computer Science 344, 1989, pp. 54-73
• DFS tree construction
  E. Korach, Z. Ostfeld
  Lecture Notes in Computer Science 344, 1989, pp. 87-106
• Transitive closure algorithms for very large databases
  J. Biskup, H. Stiefeling
  Lecture Notes in Computer Science 344, 1989, pp. 122-147
• Linear time algorithms for testing approximate congruence in the plane
  S. Iwanowski
  Lecture Notes in Computer Science 344, 1989, pp. 213-228
• Moving regular k-gons in contact
  S. Abramowski, B. Lang, H. Müller
  Lecture Notes in Computer Science 344, 1989, pp. 229-242
• Application of graph theory to topology generation for logic gates
  H. Kaeslin
  Lecture Notes in Computer Science 344, 1989, pp. 304-316
• The average size of ordered binary subgraphs
  P.H. Hartel
  Lecture Notes in Computer Science 344, 1989, pp. 327-351
• O(n^2) algorithms for graph planarization
  R. Jayakumar, K. Thulasiraman, M.N.S. Swamy
  Lecture Notes in Computer Science 344, 1989, pp. 352-377
• On paths in search or decision trees which require almost worst-case time
  U. Huckenbeck
  Lecture Notes in Computer Science 344, 1989, pp. 406-423
• Voronoi diagrams in the Moscow metric
  R. Klein
  Lecture Notes in Computer Science 344, 1989, pp. 434-441
• A sweep algorithm and its implementation
  K. Hinrichs, J. Nievergelt, P. Schorn
  Lecture Notes in Computer Science 344, 1989, pp. 442-457