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

• Erratum to ''Measuring the expressive power of dynamic logics: An application of abstract model theory''
  J.A. Makowsky
  Lecture Notes in Computer Science 115, 1981, pp. 551-551
• Robust balancing in B-trees
  S. Huddleston, K. Mehlhorn
  Lecture Notes in Computer Science 104, 1981, pp. 234-244
• The post-office problem and related questions
  H. Maurer
  Lecture Notes in Computer Science 100, 1981, pp. 1-19
• Series of graphs generated by rational machines
  Hidenosuke Nishio
  Lecture Notes in Computer Science 100, 1981, pp. 20-31
• On linearizing graphs
  Kurt-Ulrich Witt
  Lecture Notes in Computer Science 100, 1981, pp. 32-41
• Set-theoretic concepts in programming languages and their implementation
  Hans Jürgen Schneider
  Lecture Notes in Computer Science 100, 1981, pp. 42-54
• Graph rewriting and automatic, machine-independent program optimization
  M. Nagl
  Lecture Notes in Computer Science 100, 1981, pp. 55-69
• Properties of ordered graph grammars
  Helmut J. Ludwigs
  Lecture Notes in Computer Science 100, 1981, pp. 70-79
• The power of a one-dimensional vector of processors
  Jon Louis Bentley, Thomas Ottmann
  Lecture Notes in Computer Science 100, 1981, pp. 80-89
• A new data structure for representing sorted lists
  Kurt Mehlhorn
  Lecture Notes in Computer Science 100, 1981, pp. 90-112
• On the use of some almost sure graph properties
  Gottfried Tinhofer
  Lecture Notes in Computer Science 100, 1981, pp. 113-126
• On a generalization of heaps
  Hartmut Noltemeier
  Lecture Notes in Computer Science 100, 1981, pp. 127-136
• Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs
  M. Schnitzler
  Lecture Notes in Computer Science 100, 1981, pp. 137-149
• Issues in the study of graph embeddings
  Arnold L. Rosenberg
  Lecture Notes in Computer Science 100, 1981, pp. 150-176
• Schema hypergraphs: A formalism to investigate logical data base design
  Carlo Batini, Alessandro D'Atri
  Lecture Notes in Computer Science 100, 1981, pp. 177-194
• The use of transitively irreducible kernels of full families of functional dependencies in logical data base design
  Peter Kandzia, Margret Mangelmann
  Lecture Notes in Computer Science 100, 1981, pp. 195-211
• Graph algorithms for the synthesis and manipulation of data base schemes
  G. Ausiello, A. D'Atri, D. Saccà
  Lecture Notes in Computer Science 100, 1981, pp. 212-233
• The analysis of search trees: A survey
  Th. Ottmann, H. Six, D. Wood
  Lecture Notes in Computer Science 100, 1981, pp. 234-249
• A framework for data structures
  H.-W Six
  Lecture Notes in Computer Science 100, 1981, pp. 250-267
• Investigating programs in terms of partial graphs
  Gunther Schmidt
  Lecture Notes in Computer Science 100, 1981, pp. 268-269
• An observation concerning the complexity of problems with few solutions and its application to cryptography
  Shimon Even, Yacov Yacobi
  Lecture Notes in Computer Science 100, 1981, pp. 270-278
• Bounding the bandwidth of NP-complete problems
  Burkhard Monien, Ivan Hal Sudborough
  Lecture Notes in Computer Science 100, 1981, pp. 279-292
• The complexity of path problems in graphs and path systems of bounded bandwidth
  I.H. Sudborough
  Lecture Notes in Computer Science 100, 1981, pp. 293-305
• A comparison between Petri-nets and graph grammars
  Hans-Jörg Kreowski
  Lecture Notes in Computer Science 100, 1981, pp. 306-317
• A graph grammar representation of nonsequential processes
  Wolfgang Reisig
  Lecture Notes in Computer Science 100, 1981, pp. 318-325