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

• Key-problems and key-methods in computational geometry
  H. Edelsbrunner
  Lecture Notes in Computer Science 166, 1984, pp. 1-13
• Some recent results on squarefree words
  J. Berstel
  Lecture Notes in Computer Science 166, 1984, pp. 14-25
• Transformations realizing fairness assumptions for parallel programs
  E.R. Olderog, K.R. Apt
  Lecture Notes in Computer Science 166, 1984, pp. 26-42
• Computing the largest empty rectangle
  B. Chazelle, R.L. Drysdale, D.T. Lee
  Lecture Notes in Computer Science 166, 1984, pp. 43-54
• Approximation schemes for covering and packing problems in robotics and VLSI
  D.S. Hochbaum, W. Maass
  Lecture Notes in Computer Science 166, 1984, pp. 55-62
• Covering polygons with minimum number of rectangles
  C. Levcopoulos, A. Lingas
  Lecture Notes in Computer Science 166, 1984, pp. 63-72
• On expressive interpretation of a Hoare-logic for Clarke's language L4
  B. Josko
  Lecture Notes in Computer Science 166, 1984, pp. 73-84
• Towards executable specifications using conditional axioms
  K. Drosten
  Lecture Notes in Computer Science 166, 1984, pp. 85-96
• Propriétés Church-Rosser de syst mes de réécriture équationnels ayant la propriété de terminaison faible
  H. Perdrix
  Lecture Notes in Computer Science 166, 1984, pp. 97-108
• On a general weight of trees
  R. Kemp
  Lecture Notes in Computer Science 166, 1984, pp. 109-120
• From expanders to better superconcentrators without cascading
  E. Shamir
  Lecture Notes in Computer Science 166, 1984, pp. 121-128
• Locally synchronous complexity in the light of the trans-box method
  E.G. Belaga
  Lecture Notes in Computer Science 166, 1984, pp. 129-139
• A new definition of morphism on Petri nets
  G. Winskel
  Lecture Notes in Computer Science 166, 1984, pp. 140-150
• Blocage et vivacité dans les réseaux à pile-file
  A. Finkel
  Lecture Notes in Computer Science 166, 1984, pp. 151-162
• Denotational semantics of concurrent programs with shared memory
  M. Broy
  Lecture Notes in Computer Science 166, 1984, pp. 163-173
• Higher order data structures - Cartesian closure versus \lambda-calculus
  A. Poigne
  Lecture Notes in Computer Science 166, 1984, pp. 174-185
• Computability in higher types and the universal domain P_{\omega}
  G. Longo, S. Martini
  Lecture Notes in Computer Science 166, 1984, pp. 186-197
• On the structure of polynomial time degrees
  K. Ambos-Spies
  Lecture Notes in Computer Science 166, 1984, pp. 198-208
• Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region
  O. Sýkora, I. Vrt̑o
  Lecture Notes in Computer Science 166, 1984, pp. 209-217
• Efficient simulations among several models of parallel computers
  F. Meyer
  Lecture Notes in Computer Science 166, 1984, pp. 218-229
• Bornes inférieures sur la complexité des facteurs des mots infinis engendrés par morphismes itérés
  J.J. Pansiot
  Lecture Notes in Computer Science 166, 1984, pp. 230-240
• Adherence equivalence is decidable for DOL languages
  T. Head
  Lecture Notes in Computer Science 166, 1984, pp. 241-249
• Automates à pile sur des alphabets infinis
  J. Idt
  Lecture Notes in Computer Science 166, 1984, pp. 260-273
• Logic programs and many-valued logic
  A. Mycroft
  Lecture Notes in Computer Science 166, 1984, pp. 274-286
• Algèbre de machines et logique temporelle
  M. Michel
  Lecture Notes in Computer Science 166, 1984, pp. 287-298