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

• Program checkers for probability generation
  S. Kannan, A. Yao
  Lecture Notes in Computer Science 510, 1991, pp. 163-173
• Running time to recognize nonregular languages by 2-way probabilistic automata
  J. Kaneps, R. Freivalds
  Lecture Notes in Computer Science 510, 1991, pp. 174-185
• Statistics on random trees
  R. Casas, J. Díaz, C. Martínez
  Lecture Notes in Computer Science 510, 1991, pp. 186-203
• On confluent semi-commutations-decidability and complexity results
  V. Diekert, E. Ochmanski, K. Reinhardt
  Lecture Notes in Computer Science 510, 1991, pp. 229-241
• Lazard's factorizations of free partially commutative monoids
  G. Duchamp, D. Krob
  Lecture Notes in Computer Science 510, 1991, pp. 242-253
• A Kleene theorem for infinite trace languages
  P. Gastin, A. Petit, W. Zielonka
  Lecture Notes in Computer Science 510, 1991, pp. 254-266
• Canonical sets of Horn clauses
  N. Dershowitz
  Lecture Notes in Computer Science 510, 1991, pp. 267-278
• A confluent reduction for the \lambda-calculus with surjective pairing and terminal object
  P.-L. Curien, R. Di Cosmo
  Lecture Notes in Computer Science 510, 1991, pp. 291-302
• Provably recursive programs and program extraction
  T. Fernando
  Lecture Notes in Computer Science 510, 1991, pp. 303-313
• Computing shortest paths and distances in planar graphs
  H.N. Djidjev, G.E. Pantziou, C.D. Zaroliagis
  Lecture Notes in Computer Science 510, 1991, pp. 327-338
• Maintaining biconnected components of dynamic planar graphs
  Z. Galil, G.F. Italiano
  Lecture Notes in Computer Science 510, 1991, pp. 339-350
• Collapsing degrees via strong computation
  L.A. Hemachandra, A. Hoene
  Lecture Notes in Computer Science 510, 1991, pp. 393-404
• Fast parallel generation of random permutations
  T. Hagerup
  Lecture Notes in Computer Science 510, 1991, pp. 405-416
• A parallel algorithm for two processors precedence constraint scheduling
  H. Jung, M. Serna, P. Spirakis
  Lecture Notes in Computer Science 510, 1991, pp. 417-428
• An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs
  M. Fürer, B. Raghavachari
  Lecture Notes in Computer Science 510, 1991, pp. 429-440
• Satisfiability of systems of ordinal notations with the subterm property is decidable
  J.-P. Jouannaud, M. Okada
  Lecture Notes in Computer Science 510, 1991, pp. 455-468
• Complete axiomatizations of some quotient term algebras
  H. Comon
  Lecture Notes in Computer Science 510, 1991, pp. 469-480
• The meaning of negative premises in transition system specifications
  R. Bol, J.F. Groote
  Lecture Notes in Computer Science 510, 1991, pp. 481-494
• Adding action refinement to a finite process algebra
  L. Aceto, M. Hennessy
  Lecture Notes in Computer Science 510, 1991, pp. 506-519
• Improved parallel computations with matrices and polynomials
  D. Bini, L. Gemignani, V. Pan
  Lecture Notes in Computer Science 510, 1991, pp. 520-531
• Better algorithms for the pathwidth and treewidth of graphs
  H.L. Bodlaender, T. Kloks
  Lecture Notes in Computer Science 510, 1991, pp. 544-555
• Two P-complete problems in the theory of the reals
  F. Cucker, A. Torrecillas
  Lecture Notes in Computer Science 510, 1991, pp. 556-565
• L morphisms: Bounded delay and regularity of ambiguity
  J. Honkala, A. Salomaa
  Lecture Notes in Computer Science 510, 1991, pp. 566-574
• Degree and decomposability of variable-length codes
  V. Bruyere, C. De Felice
  Lecture Notes in Computer Science 510, 1991, pp. 575-587
• Balancing order and chaos in image generation
  K. Culik II, S. Dube
  Lecture Notes in Computer Science 510, 1991, pp. 600-614