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

• Efficient algorithms on context-free graph languages
  C. Lautemann
  Lecture Notes in Computer Science 317, 1988, pp. 362-378
• Efficient analysis of graph properties on context-free graph languages (extended abstract)
  T. Lengauer, E. Wanke
  Lecture Notes in Computer Science 317, 1988, pp. 379-393
• A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs
  A. Lingas, M.M. Syslo
  Lecture Notes in Computer Science 317, 1988, pp. 394-409
• Constructive Hopf's theorem: or how to untangle closed planar curves
  K. Mehlhorn, C.-K. Yap
  Lecture Notes in Computer Science 317, 1988, pp. 410-423
• Maximal dense intervals of grammar forms
  V. Niemi
  Lecture Notes in Computer Science 317, 1988, pp. 424-438
• Computations, residuals, and the power of indeterminacy
  P. Panangaden, E.W. Stark
  Lecture Notes in Computer Science 317, 1988, pp. 439-454
• Nested annealing: A provable improvement to simulated annealing
  S. Rajasekaran, J.H. Reif
  Lecture Notes in Computer Science 317, 1988, pp. 455-472
• Nonlinear pattern matching in trees
  R. Ramesh, I.V. Ramakrishnan
  Lecture Notes in Computer Science 317, 1988, pp. 473-488
• Invertibility of linear finite automata over a ring
  Tao Renji
  Lecture Notes in Computer Science 317, 1988, pp. 489-501
• Moving discs between polygons
  H. Rohnert
  Lecture Notes in Computer Science 317, 1988, pp. 502-515
• Optimal circuits and transitive automorphism groups
  S. Rudich, L. Berman
  Lecture Notes in Computer Science 317, 1988, pp. 516-524
• A Kleene-Presburgerian approach to linear production systems
  J. Schäfer
  Lecture Notes in Computer Science 317, 1988, pp. 525-534
• On minimum flow and transitive reduction
  K. Simon
  Lecture Notes in Computer Science 317, 1988, pp. 535-546
• La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire
  J.C. Spehner
  Lecture Notes in Computer Science 317, 1988, pp. 547-560
• Regular languages defined with generalized quantifiers
  H. Straubing, D. Thérien, W. Thomas
  Lecture Notes in Computer Science 317, 1988, pp. 561-575
• A dynamic data structure for planar graph embedding (extended abstract)
  R. Tamassia
  Lecture Notes in Computer Science 317, 1988, pp. 576-590
• Separating polynomial-time Turing and truth-table reductions by tally sets (preliminary report)
  S. Tang, R.V. Book
  Lecture Notes in Computer Science 317, 1988, pp. 591-599
• Assertional verification of a timer-based protocol
  G. Tel
  Lecture Notes in Computer Science 317, 1988, pp. 600-614
• Type inference with partial types
  S. Thatte
  Lecture Notes in Computer Science 317, 1988, pp. 615-629
• Some behavioural aspects of net theory
  P.S. Thiagarajan
  Lecture Notes in Computer Science 317, 1988, pp. 630-653
• The equivalence of DGSM replications on Q-rational languages is decidable
  P. Turakainen
  Lecture Notes in Computer Science 317, 1988, pp. 654-666
• Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs
  V.V. Vazirani, M. Yannakakis
  Lecture Notes in Computer Science 317, 1988, pp. 667-681
• On restricting the access to an NP-oracle
  K.W. Wagner
  Lecture Notes in Computer Science 317, 1988, pp. 682-696
• On \le^p_{1-tt} sparseness and nondeterministic complexity classes (extended abstract)
  O. Watanabe
  Lecture Notes in Computer Science 317, 1988, pp. 697-709
• Semantics for logic programs without occur check
  W.P. Weijland
  Lecture Notes in Computer Science 317, 1988, pp. 710-726