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

• Markov decision processes and regular events
  Costas Courcoubetis, Mihalis Yannakakis
  Lecture Notes in Computer Science 443, 1990, pp. 336-349
• Term rewriting systems
  Jan Willem Klop
  Lecture Notes in Computer Science 443, 1990, pp. 350-369
• Nonoblivious normalization algorithms for nonlinear rewrite systems
  Rakesh M. Verma, I.V. Ramakrishnan
  Lecture Notes in Computer Science 443, 1990, pp. 370-385
• Algebraic properties of idempotent substitutions
  Catuscia Palamidessi
  Lecture Notes in Computer Science 443, 1990, pp. 386-399
• Determining the separation of preprocessed polyhedra
  David P. Dobkin, David G. Kirkpatrick
  Lecture Notes in Computer Science 443, 1990, pp. 400-413
• Randomized incremental construction of Delaunay and Voronoi diagrams
  Leonidas J. Guibas, Donald E. Knuth, Micha Sharir
  Lecture Notes in Computer Science 443, 1990, pp. 414-431
• Merging free trees in parallel for efficient Voronoi diagram construction
  Richard Cole, Michael T. Goodrich, Colm O'Dúnlaing
  Lecture Notes in Computer Science 443, 1990, pp. 432-445
• Local optimization and the traveling salesman problem
  David S. Johnson
  Lecture Notes in Computer Science 443, 1990, pp. 446-461
• Polynomial-time approximation algorithms for the Ising model
  Mark Jerrum, Alistair Sinclair
  Lecture Notes in Computer Science 443, 1990, pp. 462-475
• On parallelizing graph-partitioning heuristics
  John E. Savage, Markus G. Wloka
  Lecture Notes in Computer Science 443, 1990, pp. 476-489
• Iterated substitutions and locally catenative systems
  Christian Choffrut
  Lecture Notes in Computer Science 443, 1990, pp. 490-500
• Decomposition of partial commutations
  Mireille Clerbout, Michel Latteux, Yves Roos
  Lecture Notes in Computer Science 443, 1990, pp. 501-511
• Boolean closure and unambiguity of rational sets
  Maryse Pelletier
  Lecture Notes in Computer Science 443, 1990, pp. 512-525
• Compositionality through an operational semantics of contexts
  Kim G. Larsen, Liu Xinxin
  Lecture Notes in Computer Science 443, 1990, pp. 526-539
• Structural and behavioural equivalences of networks
  Joachim Parrow
  Lecture Notes in Computer Science 443, 1990, pp. 540-552
• Proving partial order liveness properties
  Doron Peled, Amir Pnueli
  Lecture Notes in Computer Science 443, 1990, pp. 553-571
• A proof system for the parallel object-oriented language POOL
  F.S. de Boer
  Lecture Notes in Computer Science 443, 1990, pp. 572-585
• A new approach to maximum matching in general graphs
  Norbert Blum
  Lecture Notes in Computer Science 443, 1990, pp. 586-597
• On-line graph algorithms with SPQR-trees
  Giuseppe Di Battista, Roberto Tamassia
  Lecture Notes in Computer Science 443, 1990, pp. 598-611
• On the bit-complexity of discrete solutions of PDEs
  Victor Pan, John Reif
  Lecture Notes in Computer Science 443, 1990, pp. 612-625
• An efficient algorithm for branching bisimulation an stuttering equivalence
  Jan Friso Groote, Frits Vaandrager
  Lecture Notes in Computer Science 443, 1990, pp. 626-638
• Partial evaluation, self-application and types
  Neil D. Jones
  Lecture Notes in Computer Science 443, 1990, pp. 639-659
• Provable computable functions on abstract data types
  J.V. Tucker, S.S. Wainer, J.J. Zucker
  Lecture Notes in Computer Science 443, 1990, pp. 660-673
• Equational formulas in order-sorted algebras
  Hubert Comon
  Lecture Notes in Computer Science 443, 1990, pp. 674-688
• An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal
  Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars
  Lecture Notes in Computer Science 443, 1990, pp. 689-702