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

• Approximation algorithms for graph augmentation
  Samir Khuller, Ramakrishna Thurimella
  Lecture Notes in Computer Science 623, 1992, pp. 330-341
• Fast incremental planarity testing
  Jeffrey Westbrook
  Lecture Notes in Computer Science 623, 1992, pp. 342-353
• Maintenance of triconnected components of graphs
  J.A. La Poutré
  Lecture Notes in Computer Science 623, 1992, pp. 354-365
• Suboptimal cuts: their enumeration, weight and number
  Vijay V. Vazirani, Mihalis Yannakakis
  Lecture Notes in Computer Science 623, 1992, pp. 366-377
• Gröbner bases: An introduction
  Bruno Buchberger
  Lecture Notes in Computer Science 623, 1992, pp. 378-379
• Buchberger's algorithm: The term rewriter's point of view
  Reinhard Bündgen
  Lecture Notes in Computer Science 623, 1992, pp. 380-391
• Completion of rewrite systems with membership constraints
  Hubert Comon
  Lecture Notes in Computer Science 623, 1992, pp. 392-403
• A new metric between polygons, and how to compute it
  Günter Rote
  Lecture Notes in Computer Science 623, 1992, pp. 404-415
• On nearest-neighbor graphs
  Michael S. Paterson, F. Frances Yao
  Lecture Notes in Computer Science 623, 1992, pp. 416-426
• A tail estimate for Mulmuley's segment intersection algorithm
  Jiȓí Matous̑ek, Raimund Seidel
  Lecture Notes in Computer Science 623, 1992, pp. 427-438
• Lower bounds on the complexity of simplex range reporting on a pointer machine
  Bernard Chazelle, Burton Rosenberg
  Lecture Notes in Computer Science 623, 1992, pp. 439-449
• Infinitary logic for computer science
  Phokion G. Kolaitis, Moshe Y. Vardi
  Lecture Notes in Computer Science 623, 1992, pp. 450-473
• Characterization of temporal property classes
  Edward Chang, Zohar Manna, Amir Pnueli
  Lecture Notes in Computer Science 623, 1992, pp. 474-486
• Lazy lambda calculus: Theories, models and local structure characterization
  C.-H. Luke Ong
  Lecture Notes in Computer Science 623, 1992, pp. 487-498
• Logic programming semantics made easy
  Els Laenens, Dirk Vermeir, Carlo Zaniolo
  Lecture Notes in Computer Science 623, 1992, pp. 499-508
• On the complexity of dataflow analysis of logic programs
  Saumya K. Debray
  Lecture Notes in Computer Science 623, 1992, pp. 509-520
• Comparison of abstract interpretations
  Agostino Cortesi, Gilberto Filè, William Winsborough
  Lecture Notes in Computer Science 623, 1992, pp. 521-532
• A proposed categorical semantics for pure ML
  Wesley Phoa, Michael Fourman
  Lecture Notes in Computer Science 623, 1992, pp. 533-544
• Behavioural abstraction in TCCS
  Faron Moller, Chris Tofts
  Lecture Notes in Computer Science 623, 1992, pp. 559-570
• Timing Petri nets categorically
  Carolyn Brown, Doug Gurr
  Lecture Notes in Computer Science 623, 1992, pp. 571-582
• Asynchronous cellular automata for infinite traces
  Paul Gastin, Antoine Petit
  Lecture Notes in Computer Science 623, 1992, pp. 583-594
• A trace semantics for Petri nets
  P.W. Hoogers, H.C.M. Kleijn, P.S. Thiagarajan
  Lecture Notes in Computer Science 623, 1992, pp. 595-604
• Asynchronous communication of Petri nets and the refinement of transitions
  Walter Vogler
  Lecture Notes in Computer Science 623, 1992, pp. 605-616
• A parametric approach to localities
  Ugo Montanari, Daniel Yankelevich
  Lecture Notes in Computer Science 623, 1992, pp. 617-628
• Proved trees
  Pierpaolo Degano, Corrado Priami
  Lecture Notes in Computer Science 623, 1992, pp. 629-640