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

• Parallel time O(\log n) recognition of unambiguous CFLs
  W. Rytter
  Lecture Notes in Computer Science 199, 1985, pp. 380-389
• On colour critical graphs
  H. Sachs
  Lecture Notes in Computer Science 199, 1985, pp. 390-401
• Generalized Thue-Morse sequences
  P. Séébold
  Lecture Notes in Computer Science 199, 1985, pp. 402-411
• Tree-partite graphs and the complexity of algorithms
  D. Seese
  Lecture Notes in Computer Science 199, 1985, pp. 412-421
• A quadratic regularity test for non-deleting macro s grammars
  H. Seidl
  Lecture Notes in Computer Science 199, 1985, pp. 422-430
• Continuous abstract data types: Basic machinery and results
  A. Tarlecki, M. Wirsing
  Lecture Notes in Computer Science 199, 1985, pp. 431-441
• On the length of single dynamic tests for monotone Boolean functions
  V.A. Vardanian
  Lecture Notes in Computer Science 199, 1985, pp. 442-449
• Enumerative combinatorics and algebraic languages
  G. Viennot
  Lecture Notes in Computer Science 199, 1985, pp. 450-464
• On several kinds of space-bounded on-line multicounter automata
  L. Voelkel
  Lecture Notes in Computer Science 199, 1985, pp. 465-473
• Iterated linear control and iterated one-turn pushdowns
  H. Vogler
  Lecture Notes in Computer Science 199, 1985, pp. 474-484
• On the Boolean closure of NP
  G. Wechsung
  Lecture Notes in Computer Science 199, 1985, pp. 485-493
• The critical complexity of all (monotone) Boolean functions and montone graph properties
  I. Wegener
  Lecture Notes in Computer Science 199, 1985, pp. 494-502
• Degeneration of Shimura surfaces and a problem in coding theory
  Th. Zink
  Lecture Notes in Computer Science 199, 1985, pp. 503-511
• Quantifiers in combinatory PDL: Completeness, definability, incompleteness
  S. Passy, T. Tinchev
  Lecture Notes in Computer Science 199, 1985, pp. 512-519
• Partial ordering derivations for CCS
  P. Degano, R. de Nicola, U. Montanari
  Lecture Notes in Computer Science 199, 1985, pp. 520-533
• Intersecting two polyhedra one of which is convex
  K. Mehlhorn, K. Simon
  Lecture Notes in Computer Science 199, 1985, pp. 534-542
• Vertex packing algorithms
  L. Lovász
  Lecture Notes in Computer Science 194, 1985, pp. 1-14
• Linear and branching structures in the semantics and logics of reactive systems
  A. Pnueli
  Lecture Notes in Computer Science 194, 1985, pp. 15-32
• About rational sets of factors of a bi-infinite word
  D. Beauquier, M. Nivat
  Lecture Notes in Computer Science 194, 1985, pp. 33-42
• A fair protocol for signing contracts
  M. Ben-Or, O. Goldreich, S. Micali, R.L. Rivest
  Lecture Notes in Computer Science 194, 1985, pp. 43-52
• The influence of key length on the area-time complexity of sorting
  G. Bilardi, F.P. Preparata
  Lecture Notes in Computer Science 194, 1985, pp. 53-62
• Repeated synchronous snapshots and their implementation in CSP
  L. Bougé
  Lecture Notes in Computer Science 194, 1985, pp. 63-70
• On total regulators generated by derivation relations
  W. Bucher, A. Ehrenfeucht, D. Haussler
  Lecture Notes in Computer Science 194, 1985, pp. 71-79
• Optimal solutions for a class of point retrieval problems
  B. Chazelle, H. Edelsbrunner
  Lecture Notes in Computer Science 194, 1985, pp. 80-89
• Fractional cascading: A data structuring technique with geometric applications
  B. Chazelle, L.J. Guibas
  Lecture Notes in Computer Science 194, 1985, pp. 90-100