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

• On the interactive complexity of graph reliability
  Jean-Marc Couveignes, Juan Francisco Diaz-Frias, Michel de Rougemont, Miklos Santha
  Lecture Notes in Computer Science 880, 1994, pp. 12-23
• Matching upper and lower bounds for simulations of several tapes on one multidimensional tape
  Martin Dietzfelbinger, Martin Hühne
  Lecture Notes in Computer Science 880, 1994, pp. 24-35
• The complexity of computing over quasigroups
  Hervé Caussinnus, François Lemieux
  Lecture Notes in Computer Science 880, 1994, pp. 36-47
• Inductive definitions and type theory - an introduction (preliminary version)
  Thierry Coquand, Peter Dybjer
  Lecture Notes in Computer Science 880, 1994, pp. 60-76
• Interpreter verification for a functional language
  Manfred Broy, Ursula Hinkel, Tobias Nipkow, Christian Prehofer, Birgit Schieder
  Lecture Notes in Computer Science 880, 1994, pp. 77-88
• Incremental algorithms for the single-source shortest path problem
  Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
  Lecture Notes in Computer Science 880, 1994, pp. 113-124
• An O(n) algorithm for realizing degree sequences
  Srinivasa Rao Arikati, Anil Maheshwari
  Lecture Notes in Computer Science 880, 1994, pp. 125-136
• Efficient parallel and linear time sequential split decomposition
  Elias Dahlhaus
  Lecture Notes in Computer Science 880, 1994, pp. 171-180
• Algorithms for convex visibility problems
  Supriya Biswas, D. Chithra Prasad, Sudepkumar Prasant Pal
  Lecture Notes in Computer Science 880, 1994, pp. 181-192
• Localities and failures
  Roberto M. Amadio, Sanjiva Prasad
  Lecture Notes in Computer Science 880, 1994, pp. 205-216
• My favorite ten complexity theorems of the past decade
  Lance Fortnow
  Lecture Notes in Computer Science 880, 1994, pp. 256-275
• A limited-backtrack greedy schema for approximation algorithms
  Vivek Arora, Vempala Santosh, Huzur Saran, Vijay V. Vazirani
  Lecture Notes in Computer Science 880, 1994, pp. 318-329
• On approximation scheme preserving reducibility and its applications
  Pierluigi Crescenzi, Luca Trevisan
  Lecture Notes in Computer Science 880, 1994, pp. 330-341
• Proving non-reachability by modulo-place-invariants
  Jörg Desel, Micaela-Daphne Radola
  Lecture Notes in Computer Science 880, 1994, pp. 366-377
• Foundations for faster external sorting
  Vladimir Estivill-Castro, Derick Wood
  Lecture Notes in Computer Science 880, 1994, pp. 414-425
• Branching rules for satisfiability
  J.N. Hooker, V. Vinay
  Lecture Notes in Computer Science 880, 1994, pp. 426-437
• PVM implementations of advection-chemistry modules of air pollution models
  B.S. Andersen, P. Kaae, C. Keable, W. Owczarz, J. Waśniewski, Z. Zlatev
  Lecture Notes in Computer Science 879, 1994, pp. 11-16
• A parallel tree N-body code for heterogeneous clusters
  V. Antonuccio-Delogu, U. Becciani
  Lecture Notes in Computer Science 879, 1994, pp. 17-32
• Parallel computation of the eigenstructure of Toeplitz-plus-Hankel matrices on multicomputers
  José M. Badía, Antonio M. Vidal
  Lecture Notes in Computer Science 879, 1994, pp. 33-40
• Singular value decomposition on the connection machine CM-5/CM-5E
  Susanne M. Balle, Palle M. Pedersen
  Lecture Notes in Computer Science 879, 1994, pp. 41-50
• Computing eigenvalues of sparse matrices on the connection machine
  V.A. Barker, Chen Yingqun
  Lecture Notes in Computer Science 879, 1994, pp. 51-58
• Preliminary experiences with extrapolation methods for parallel solution of differential algebraic equations
  Claus Bendtsen
  Lecture Notes in Computer Science 879, 1994, pp. 59-66
• A transform approach to fast matrix multiplication
  Pavel Berkhin, John Brown
  Lecture Notes in Computer Science 879, 1994, pp. 67-79
• Quantum mechanical treatment of reactive scattering problems
  Gert D. Billing
  Lecture Notes in Computer Science 879, 1994, pp. 80-88
• Visualizing the critical dynamics of monopole current clusters - global/local programming on the connection machine CM-5
  A. Bode, N. Eicker, Th. Lippert, K. Schilling, P. Ueberholz
  Lecture Notes in Computer Science 879, 1994, pp. 89-99