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

• Program result checking: A new approach to making programs more reliable
  Manuel Blum
  Lecture Notes in Computer Science 700, 1993, pp. 1-14
• Dynamic interpolation search in o(\log\log n) time
  Arne Andersson, Christer Mattsson
  Lecture Notes in Computer Science 700, 1993, pp. 15-27
• Searching among intervals and compact routing tables
  Greg N. Frederickson
  Lecture Notes in Computer Science 700, 1993, pp. 28-39
• The approximation of maximum subgraph problems
  Carsten Lund, Mihalis Yannakakis
  Lecture Notes in Computer Science 700, 1993, pp. 40-51
• Polynomially bounded minimization problems which are hard to approximate
  Viggo Kann
  Lecture Notes in Computer Science 700, 1993, pp. 52-63
• Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
  Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
  Lecture Notes in Computer Science 700, 1993, pp. 64-75
• The complexity of approximating PSPACE-complete problems for hierarchical specifications
  M.V. Marathe, H.B. Hunt III, S.S. Ravi
  Lecture Notes in Computer Science 700, 1993, pp. 76-87
• Problems on pairs of trees and the four colour problem of planar graphs
  Artur Czumaj, Alan Gibbons
  Lecture Notes in Computer Science 700, 1993, pp. 88-101
• Constructing competitive tours from local information
  Bala Kalyanasundaram, Kirk R. Pruhs
  Lecture Notes in Computer Science 700, 1993, pp. 102-113
• Treewidth and pathwidth of permutation graphs
  Hans Bodlaender, Ton Kloks, Dieter Kratsch
  Lecture Notes in Computer Science 700, 1993, pp. 114-125
• A theory of even functionals and their algorithmic applications
  Jerzy W. Jaromczyk, Grzegorz Świa̧tek
  Lecture Notes in Computer Science 700, 1993, pp. 126-136
• Exact asymptotics of divide-and-conquer recurrences
  Philippe Flajolet, Mordecai Golin
  Lecture Notes in Computer Science 700, 1993, pp. 137-149
• Optimal bounds for the change-making problem
  Dexter Kozen, Shmuel Zaks
  Lecture Notes in Computer Science 700, 1993, pp. 150-161
• The complexity of N-body simulation
  John H. Reif, Stephen R. Tate
  Lecture Notes in Computer Science 700, 1993, pp. 162-176
• A simple method for resolving degeneracies in Delaunay triangulations
  Michael B. Dillencourt, Warren D. Smith
  Lecture Notes in Computer Science 700, 1993, pp. 177-188
• Fault-tolerance and complexity
  Lane A. Hemachandra
  Lecture Notes in Computer Science 700, 1993, pp. 189-202
• Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines
  Hiroaki Yamamoto
  Lecture Notes in Computer Science 700, 1993, pp. 203-214
• On the computational power of discrete Hopfield nets
  Pekka Orponen
  Lecture Notes in Computer Science 700, 1993, pp. 215-226
• On randomized versus deterministic computation
  Marek Karpinski, Rutger Verbeek
  Lecture Notes in Computer Science 700, 1993, pp. 227-240
• Lower bounds for one-way probabilistic communication complexity
  Farid Ablayev
  Lecture Notes in Computer Science 700, 1993, pp. 241-252
• Maintaining discrete probability distributions optimally
  Torben Hagerup, Kurt Mehlhorn, J. Ian Munro
  Lecture Notes in Computer Science 700, 1993, pp. 253-264
• Secure and efficient off-line digital money
  Matthew Franklin, Moti Yung
  Lecture Notes in Computer Science 700, 1993, pp. 265-276
• Computational depth and reducibility
  David W. Juedes, James I. Lathrop, Jack H. Lutz
  Lecture Notes in Computer Science 700, 1993, pp. 277-288
• Learnability: Admissible, co-finite and hypersimple languages
  Ganesh Baliga, John Case
  Lecture Notes in Computer Science 700, 1993, pp. 289-300
• Inclusion is undecidable for pattern languages
  Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
  Lecture Notes in Computer Science 700, 1993, pp. 301-312