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

• Maintaining biconnected components of dynamic planar graphs
  Z. Galil, G.F. Italiano
  Lecture Notes in Computer Science 510, 1991, pp. 339-350
• Efficient maximal cubic graph cuts
  M. Loebl
  Lecture Notes in Computer Science 510, 1991, pp. 351-362
• Structural parallel algorithmics
  U. Vishkin
  Lecture Notes in Computer Science 510, 1991, pp. 363-380
• Improving known solutions is hard
  D. Ranjan, S. Chari, P. Rohatgi
  Lecture Notes in Computer Science 510, 1991, pp. 381-392
• 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
• On logics, tilings, and automata
  W. Thomas
  Lecture Notes in Computer Science 510, 1991, pp. 441-454
• 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
• Deciding history preserving bisimilarity
  W. Vogler
  Lecture Notes in Computer Science 510, 1991, pp. 495-505
• 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
• Finding minimal forbidden minors using a finite congruence
  J. Lagergren, S. Arnborg
  Lecture Notes in Computer Science 510, 1991, pp. 532-543
• 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
• An EILENBERG theorem for \infty-languages
  T. Wilke
  Lecture Notes in Computer Science 510, 1991, pp. 588-599
• Balancing order and chaos in image generation
  K. Culik II, S. Dube
  Lecture Notes in Computer Science 510, 1991, pp. 600-614
• Average case complexity
  Y. Gurevich
  Lecture Notes in Computer Science 510, 1991, pp. 615-628
• Minimal NFA problems are hard
  Tao Jiang, B. Ravikumar
  Lecture Notes in Computer Science 510, 1991, pp. 629-640
• Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language
  K. Hashiguchi
  Lecture Notes in Computer Science 510, 1991, pp. 641-648