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 [1]	Hilfe

Suche: Series=LNCS AND Volume=172

• On probabilistic tape complexity and fast circuits for matrix inversion problems
  H. Jung
  Lecture Notes in Computer Science 172, 1984, pp. 281-291
• On three-element codes
  J. Karhumäki
  Lecture Notes in Computer Science 172, 1984, pp. 292-302
• Recursion depth analysis for special tree traversal algorithms
  P. Kirschenhofer, H. Prodinger
  Lecture Notes in Computer Science 172, 1984, pp. 303-311
• Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem
  J.C. Lagarias
  Lecture Notes in Computer Science 172, 1984, pp. 312-323
• Measures of presortedness and optimal sorting algorithms
  H. Mannila
  Lecture Notes in Computer Science 172, 1984, pp. 324-336
• Languages and inverse semigroups
  S.W. Margolis, J.E. Pin
  Lecture Notes in Computer Science 172, 1984, pp. 337-346
• Area-time optimal VLSI integer multiplier with minimum computation time
  K. Mehlhorn, F.P. Preparata
  Lecture Notes in Computer Science 172, 1984, pp. 347-357
• On the interpretation of infinite computations in logic programming
  M.A. Nait Abdallah
  Lecture Notes in Computer Science 172, 1984, pp. 358-370
• A linear time algorithm to solve the single function coarsest partition problem
  R. Paige, R.E. Tarjan
  Lecture Notes in Computer Science 172, 1984, pp. 371-379
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
  J.J. Pansiot
  Lecture Notes in Computer Science 172, 1984, pp. 380-389
• Probabilistic bidding gives optimal distributed resource allocation
  J. Reif, P. Spirakis
  Lecture Notes in Computer Science 172, 1984, pp. 391-402
• Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness
  W. Reisig
  Lecture Notes in Computer Science 172, 1984, pp. 403-413
• Cancellation, pumping and permutation in formal languages
  A. Restivo, C. Reutenauer
  Lecture Notes in Computer Science 172, 1984, pp. 414-422
• A hardware implementation of the CSP primitives and its verification
  D. Ron, F. Rosemberg, A. Pnueli
  Lecture Notes in Computer Science 172, 1984, pp. 423-435
• Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm
  A. Schönhage
  Lecture Notes in Computer Science 172, 1984, pp. 436-447
• Robust algorithms: A different approach to oracles
  U. Schöning
  Lecture Notes in Computer Science 172, 1984, pp. 448-453
• Node weighted matching
  T.H. Spencer, E.W. Mayr
  Lecture Notes in Computer Science 172, 1984, pp. 454-464
• The propositional Mu-calculus is elementary
  R.S. Streett, E.A. Emerson
  Lecture Notes in Computer Science 172, 1984, pp. 465-472
• AVL-trees for localized search
  A.K. Tsakalidis
  Lecture Notes in Computer Science 172, 1984, pp. 473-485
• The simple roots of real-time computation hierarchies
  P.M.B. Vitányi
  Lecture Notes in Computer Science 172, 1984, pp. 486-489
• Computational complexity of an optical disk interface
  J.S. Vitter
  Lecture Notes in Computer Science 172, 1984, pp. 490-502
• Encoding graphs by derivations and implications for the theory of graph grammars
  E. Welzl
  Lecture Notes in Computer Science 172, 1984, pp. 503-513
• Sampling algorithms for differential batch retrieval problems
  D.E. Willard
  Lecture Notes in Computer Science 172, 1984, pp. 514-526