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

• Weighted visibility graphs of bars and related flow problems
  David G. Kirkpatrick, Stephen K. Wismath
  Lecture Notes in Computer Science 382, 1989, pp. 325-334
• Parallel algorithms for cographs: Recognition and applications
  Gur Saran Adhar, Shietung Peng
  Lecture Notes in Computer Science 382, 1989, pp. 335-351
• Dynamic data structures for series parallel digraphs
  Giuseppe F. Italiano, Alberto Marchetti Spaccamela, Umberto Nanni
  Lecture Notes in Computer Science 382, 1989, pp. 352-372
• Improving partial rebuilding by using simple balance criteria
  Arne Andersson
  Lecture Notes in Computer Science 382, 1989, pp. 393-402
• An efficient all-parses systolic algorithm for general context-free parsing
  Oscar H. Ibarra, Michael A. Palis
  Lecture Notes in Computer Science 382, 1989, pp. 403-419
• A polynomial time algorithm for the local testability problem of deterministic finite automata
  Sam Kim, Robert McNaughton, Robert McCloskey
  Lecture Notes in Computer Science 382, 1989, pp. 420-436
• An efficient algorithm for finding all maximal square blocks in a matrix
  Heinz Breu
  Lecture Notes in Computer Science 382, 1989, pp. 460-471
• A new search time update time tradeoff for the implicit dictionary
  Philippe Derome
  Lecture Notes in Computer Science 382, 1989, pp. 541-551
• Augmentation problems on hierarchically defined graphs
  David Fernández-Baca, Mark A. Williams
  Lecture Notes in Computer Science 382, 1989, pp. 563-576
• On linear time minor tests and depth first search
  Hans L. Bodlaender
  Lecture Notes in Computer Science 382, 1989, pp. 577-590
• Combinatorial and computational results for line arrangements in space
  Herbert Edelsbrunner
  Lecture Notes in Computer Science 382, 1989, pp. 591-591
• On word equations and Makanin's algorithms
  H. Abdulrab, J.-P. Pécuchet
  Lecture Notes in Computer Science 380, 1989, pp. 1-12
• Complexity classes with complete problems between P and NP-C
  C. Àlvarez, J. Díaz, J. Torán
  Lecture Notes in Computer Science 380, 1989, pp. 13-24
• Interpretations of synchronous flowchart schemes
  M. Bartha
  Lecture Notes in Computer Science 380, 1989, pp. 25-34
• Generalized Boolean hierarchies and Boolean hierarchies over RP
  A. Bertoni, D. Bruschi, D. Joseph, M. Sitharam, P. Young
  Lecture Notes in Computer Science 380, 1989, pp. 35-46
• The equational logic of iterative processes
  S.L. Bloom
  Lecture Notes in Computer Science 380, 1989, pp. 47-57
• The distributed bit complexity of the ring: from the anonymous to the non-anonymous case
  H.L. Bodlaender, S. Moran, M.K. Warmuth
  Lecture Notes in Computer Science 380, 1989, pp. 58-67
• The jump number problem for biconvex graphs and rectangle covers of rectangular regions
  A. Brandstädt
  Lecture Notes in Computer Science 380, 1989, pp. 68-77
• Recent developments in the design of asynchronous circuits
  J.A. Brzozowski, J.C. Ebergen
  Lecture Notes in Computer Science 380, 1989, pp. 78-94
• New simulations between CRCW PRAMs
  B.S. Chlebus, K. Diks, T. Hagerup, T. Radzik
  Lecture Notes in Computer Science 380, 1989, pp. 95-105
• About connections between syntactical and computational complexity
  J.-L. Coquidé, M. Dauchet, S. Tison
  Lecture Notes in Computer Science 380, 1989, pp. 105-115
• Completeness in approximation classes
  P. Crescenzi, A. Panconesi
  Lecture Notes in Computer Science 380, 1989, pp. 116-126
• Separating completely complexity classes related to polynomial size \Omega-decision trees
  C. Damm, Ch. Meinel
  Lecture Notes in Computer Science 380, 1989, pp. 127-136
• On product hierarchies of automata
  P. Dömösi, Z. ésik, B. Imreh
  Lecture Notes in Computer Science 380, 1989, pp. 137-144
• On the communication complexity of planarity
  P. Durivs, P. Pudlák
  Lecture Notes in Computer Science 380, 1989, pp. 145-147