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

• An adaptive distributed fault-tolerant routing algorithm for the star graph
  Leqiang Bai, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda
  Lecture Notes in Computer Science 1350, 1997, pp. 62-71
• Decremental maintenance of reachability in hypergraphs and minimum models of Horn formulae
  Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
  Lecture Notes in Computer Science 1350, 1997, pp. 122-131
• A theoretical framework of hybrid approaches to MAX SAT
  Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata
  Lecture Notes in Computer Science 1350, 1997, pp. 153-162
• On-line versus off-line in money-making strategies with BROKERAGE
  Eisuke Dannoura, Kouichi Sakurai
  Lecture Notes in Computer Science 1350, 1997, pp. 173-182
• Decision-making by hierarchies of discordant agents
  Xiaotie Deng, Christos Papadimitriou
  Lecture Notes in Computer Science 1350, 1997, pp. 183-192
• Approximating unweighted connectivity problems in parallel
  Zhi-Zhong Chen
  Lecture Notes in Computer Science 1350, 1997, pp. 202-211
• Efficient parallel algorithms for planar st-graphs
  Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu
  Lecture Notes in Computer Science 1350, 1997, pp. 223-232
• A faster one-dimensional topological compaction algorithm
  Hsiao-Feng Chen, D.T. Lee
  Lecture Notes in Computer Science 1350, 1997, pp. 303-313
• Algorithms for finding optimal disjoint paths around a rectangle
  Wun-Tat Chan, Francis Y.L. Chin
  Lecture Notes in Computer Science 1350, 1997, pp. 314-323
• Dynamic programming on distance-hereditary graphs
  Maw-Shang Chang, Sun-yuan Hsieh, Gen-Huey Chen
  Lecture Notes in Computer Science 1350, 1997, pp. 344-353
• On the equivalence in complexity among basic problems on bipartite and parity graphs
  Serafino Cicerone, Gabriele di Stefano
  Lecture Notes in Computer Science 1350, 1997, pp. 354-363
• Approximating geometric domains through topological triangulations
  Tamal K. Dey, Arunabha Roy, Nimish R. Shah
  Lecture Notes in Computer Science 1346, 1997, pp. 6-21
• Graph editing to bipartite interval graphs: Exact and asymptotic bounds
  K. Cirino, S. Muthukrishnan, N.S. Narayanaswamy, H. Ramesh
  Lecture Notes in Computer Science 1346, 1997, pp. 37-53
• Model checking
  Edmund M. Clarke
  Lecture Notes in Computer Science 1346, 1997, pp. 54-56
• On resource-bounded measure and pseudorandomness
  V. Arvind, J. Köbler
  Lecture Notes in Computer Science 1346, 1997, pp. 235-249
• General refinement for high level Petri nets
  Raymond Devillers, Hanna Klaudel, Robert-C. Riemann
  Lecture Notes in Computer Science 1346, 1997, pp. 297-311
• The might of formulas and their limits
  F.L. Bauer
  Lecture Notes in Computer Science 1337, 1997, pp. 1-8
• Defining discipline
  Wolfgang Coy
  Lecture Notes in Computer Science 1337, 1997, pp. 21-35
• On aperiodic sets of Wang tiles
  Karel Culik, Jarkko Kari
  Lecture Notes in Computer Science 1337, 1997, pp. 153-162
• A remark on trace equations
  Volker Diekert
  Lecture Notes in Computer Science 1337, 1997, pp. 251-260
• Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositonality and all that
  Manfred Broy
  Lecture Notes in Computer Science 1337, 1997, pp. 279-286
• Discrete time analysis of a state dependent tandem with different customer types
  Hans Daduna
  Lecture Notes in Computer Science 1337, 1997, pp. 287-296
• How distributed algorithms play the token game
  Jörg Desel
  Lecture Notes in Computer Science 1337, 1997, pp. 297-306
• A relational-functional integration for declarative programming
  Harold Boley
  Lecture Notes in Computer Science 1337, 1997, pp. 351-358
• The composition heuristic
  Kurt Ammon
  Lecture Notes in Computer Science 1337, 1997, pp. 437-444