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

• Fixed points of Büchi automata
  Mads Dam
  Lecture Notes in Computer Science 652, 1992, pp. 39-50
• Improving the results of static analyses of programs by local decreasing iterations
  Philippe Granger
  Lecture Notes in Computer Science 652, 1992, pp. 68-79
• Implicit point location in arrangements of line segments, with an application to motion planning
  Pankaj K. Agarwal, Marc van Kreveld
  Lecture Notes in Computer Science 652, 1992, pp. 80-91
• Superpolynomial circuits, almost sparse oracles and the exponential hierarchy
  Harry Buhrman, Steven Homer
  Lecture Notes in Computer Science 652, 1992, pp. 116-127
• On bounded truth-table, conjunctive, and randomized reductions to sparse sets
  V. Arvind, J. Köbler, M. Mundhenk
  Lecture Notes in Computer Science 652, 1992, pp. 140-151
• One-way functions and isomorphism conjecture
  K. Ganesan
  Lecture Notes in Computer Science 652, 1992, pp. 152-163
• Solving the Lagrangian dual when the number of constraints is fixed
  Richa Agarwala, David Fernández-Baca
  Lecture Notes in Computer Science 652, 1992, pp. 164-175
• The Gallina specification language: A case study
  Gérard Huet
  Lecture Notes in Computer Science 652, 1992, pp. 229-240
• Detection of unstable predicates in distributed programs
  Vijay K. Garg, Brian Waldecker
  Lecture Notes in Computer Science 652, 1992, pp. 253-264
• Games and full completeness for multiplicative linear logic
  Samson Abramsky, Radha Jagadeesan
  Lecture Notes in Computer Science 652, 1992, pp. 291-301
• Real-time calculi and expansion theorems
  Jens C. Godskesen, Kim G. Larsen
  Lecture Notes in Computer Science 652, 1992, pp. 302-315
• Branching bisimulation for context-free processes
  Didier Caucal
  Lecture Notes in Computer Science 652, 1992, pp. 316-327
• Reasoning about safety and liveness properties for probabilistic processes
  Linda Christoff, Ivan Christoff
  Lecture Notes in Computer Science 652, 1992, pp. 342-355
• Linear time algorithms for k-cutwidth problem
  Maw-Hwa Chen, Sing-Ling Lee
  Lecture Notes in Computer Science 650, 1992, pp. 21-30
• The application of the searching over separators strategy to solve some NP-complete problems on planar graphs
  R.Z. Hwang, R.C.T. Lee
  Lecture Notes in Computer Science 650, 1992, pp. 51-60
• Parallel and on-line graph coloring algorithms
  Magnús M. Halldórsson
  Lecture Notes in Computer Science 650, 1992, pp. 61-70
• Competitive analysis of the on-line algorithms for multiple stacks systems
  Been-Chian Chien, Rong-Jaye Chen, Wei-Pang Yang
  Lecture Notes in Computer Science 650, 1992, pp. 78-87
• Algorithms for a class of min-cut and max-cut problem
  Teofilo F. Gonzalez, Toshio Murayama
  Lecture Notes in Computer Science 650, 1992, pp. 97-105
• Algorithms for rectilinear optimal multicast tree problem
  Jan-Ming Ho, M.T. Ko, Tze-Heng Ma, Ting-Yi Sung
  Lecture Notes in Computer Science 650, 1992, pp. 106-115
• Randomized range-maxima in nearly-constant parallel time
  Omer Berkman, Yossi Matias, Uzi Vishkin
  Lecture Notes in Computer Science 650, 1992, pp. 135-144
• Fault-tolerant broadcasting in binary jumping networks
  Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura
  Lecture Notes in Computer Science 650, 1992, pp. 145-154
• Relativizations of the P=?NP and other problems: Some developments in structural complexity theory
  Ronald V. Book
  Lecture Notes in Computer Science 650, 1992, pp. 175-186
• An efficient parallel algorithm for geometrically characterizing drawings of a class of 3-D objects
  Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis
  Lecture Notes in Computer Science 650, 1992, pp. 198-208
• Characterizing and recognizing visibility graphs of funnel-shaped polygons
  Seung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa
  Lecture Notes in Computer Science 650, 1992, pp. 219-228
• Lowness and the complexity of sparse and tally descriptions
  V. Arvind, J. Köbler, M. Mundhenk
  Lecture Notes in Computer Science 650, 1992, pp. 249-258