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

• Geometry of numbers and integer programming
  C.P. Schnorr
  Lecture Notes in Computer Science 294, 1988, pp. 1-7
• Getting back to the past in the union-find problem
  G. Gambosi, G.F. Italiano, M. Talamo
  Lecture Notes in Computer Science 294, 1988, pp. 8-17
• On the construction of optimal time adders
  B. Becker, R. Kolla
  Lecture Notes in Computer Science 294, 1988, pp. 18-28
• On computations with integer division
  B. Just, F. Meyer auf der Heide, A. Wigderson
  Lecture Notes in Computer Science 294, 1988, pp. 29-37
• Maintaining range trees in secondary memory
  M.H. Overmars, M.H.M. Smid
  Lecture Notes in Computer Science 294, 1988, pp. 38-51
• Solving parametric problems on trees
  D. Fernández-Baca, G. Slutzki
  Lecture Notes in Computer Science 294, 1988, pp. 52-60
• On the k-colouring of circle-graphs
  W. Unger
  Lecture Notes in Computer Science 294, 1988, pp. 61-72
• Functional equations for data structures
  F. Bergeron, G. Labelle, P. Leroux
  Lecture Notes in Computer Science 294, 1988, pp. 73-80
• The power of polynomial size \Omega-branching programs
  Ch. Meinel
  Lecture Notes in Computer Science 294, 1988, pp. 81-90
• Collapsing oracle hierarchies, census functions and logarithmically many queries
  U. Schöning, K.W. Wagner
  Lecture Notes in Computer Science 294, 1988, pp. 91-97
• Domino games with an application to the complexity of Boolean algebras with bounded quantifier alternations
  E. Grädel
  Lecture Notes in Computer Science 294, 1988, pp. 98-107
• An automatic speed-up random access machines with powerful arithmetic instructions
  I. Wald
  Lecture Notes in Computer Science 294, 1988, pp. 108-117
• Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata
  B. Jenner, B. Kirsig
  Lecture Notes in Computer Science 294, 1988, pp. 118-125
• Hotz-isomorphism theorems in formal language theory
  V. Diekert, A. Möbus
  Lecture Notes in Computer Science 294, 1988, pp. 126-135
• First-order properties of trees, star-free expressions and aperiodicity
  U. Heuter
  Lecture Notes in Computer Science 294, 1988, pp. 136-148
• Cyclic ratonial transductions and polynomials of rational functions
  A. Terlutte
  Lecture Notes in Computer Science 294, 1988, pp. 149-158
• Constructions of a family of finite maximal codes
  C. De Felice
  Lecture Notes in Computer Science 294, 1988, pp. 159-169
• Fonctions génératrices transcendantes à coefficients engendrés par automates
  J.-P. Allouche, B. Rande, L. Thimonier
  Lecture Notes in Computer Science 294, 1988, pp. 170-183
• The relation of two patterns with comparable languages
  G. Filé
  Lecture Notes in Computer Science 294, 1988, pp. 184-192
• Hierarchical contextual rewriting with several levels
  W. Bousdira, J.-L. Rémy
  Lecture Notes in Computer Science 294, 1988, pp. 193-206
• Generalized bisimulation in relational specifications
  E. Astesiano, A. Giovini, G. Reggio
  Lecture Notes in Computer Science 294, 1988, pp. 207-226
• On polynomial time graphs grammars
  F.J. Brandenburg
  Lecture Notes in Computer Science 294, 1988, pp. 227-236
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
  B. Courcelle
  Lecture Notes in Computer Science 294, 1988, pp. 237-247
• Efficient distributed algorithms by using the Archimedean time assumption
  P. Spirakis, B. Tampakas
  Lecture Notes in Computer Science 294, 1988, pp. 248-263
• A simple protocol for secure circuit evaluation
  M. Abadi, J. Feigenbaum
  Lecture Notes in Computer Science 294, 1988, pp. 264-272