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

• On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops
  Alain Darte, Frédéric Vivien
  Lecture Notes in Computer Science 1123, 1996, pp. 379-388
• Array dataflow analysis for explicitly parallel programs
  Jean-François Collard, Martin Griebl
  Lecture Notes in Computer Science 1123, 1996, pp. 406-413
• Applications of fuzzy array dataflow analysis
  Denis Barthou, Jean-François Collard, Paul Feautrier
  Lecture Notes in Computer Science 1123, 1996, pp. 424-427
• Topographic data mapping by balanced hypersphere tesselation
  Matthias Besch, Hans Werner Pohl
  Lecture Notes in Computer Science 1123, 1996, pp. 455-458
• Implementing pipelined computation and communication in an HPF compiler
  Thomas Brandes, Frédéric Desprez
  Lecture Notes in Computer Science 1123, 1996, pp. 459-462
• Efficient mapping of interdependent scans
  Michel Barreteau, Paul Feautrier
  Lecture Notes in Computer Science 1123, 1996, pp. 463-466
• PACA: A cooperative file system cache for parallel machines
  Toni Cortes, Sergi Girona, Jesús Labarta
  Lecture Notes in Computer Science 1123, 1996, pp. 477-486
• I/O data mapping in ParFiSys: Support for high-performance I/O in parallel and distributed systems
  Jesus Carretero, Fernando Pérez, Pedro de Miguel, Felix García, Luis Alonso
  Lecture Notes in Computer Science 1123, 1996, pp. 522-525
• Correctness proof for a distributed memory system
  Vicente Cholvi-Juan, José M. Bernabéu-Aubán
  Lecture Notes in Computer Science 1123, 1996, pp. 526-531
• A framework for integrated communication and I/O placement
  Rajesh Bordawekar, Alok Choudhary, J. Ramanujam
  Lecture Notes in Computer Science 1123, 1996, pp. 541-552
• Discussing HPF design issues
  Fabien Coelho
  Lecture Notes in Computer Science 1123, 1996, pp. 571-578
• Parallelizing conditional recurrences
  Wei-Ngan Chin, John Darlington, Yike Guo
  Lecture Notes in Computer Science 1123, 1996, pp. 579-586
• Co-ordinating heterogeneous parallel computation
  Peter Au, John Darlington, Moustafa Ghanem, Yi-ke Guo, Hing Wing To, Jin Yang
  Lecture Notes in Computer Science 1123, 1996, pp. 601-614
• TPascal - A language for task parallel programming
  Ansgar Brüll, Herbert Kuchen
  Lecture Notes in Computer Science 1123, 1996, pp. 654-659
• Reusable coordinator modules for massively concurrent applications
  F. Arbab, C.L. Blom, F.J. Burger, C.T.H. Everaars
  Lecture Notes in Computer Science 1123, 1996, pp. 664-677
• Eden - The paradise of functional concurrent programming
  S. Breitinger, R. Loogen, Y. Ortega-Mallén, R. Peña-Marí
  Lecture Notes in Computer Science 1123, 1996, pp. 710-713
• Efficient parallel programming with algorithmic skeletons
  George Horatiu Botorog, Herbert Kuchen
  Lecture Notes in Computer Science 1123, 1996, pp. 718-731
• A parallel algorithm for the technology mapping of LUT-based FPGAs
  Vamsi Boppana, Prashant Saxena, Prithviraj Banerjee, W. Kent Fuchs, C.L. Liu
  Lecture Notes in Computer Science 1123, 1996, pp. 828-831
• Counting rational points on curves and Abelian varieties over finite fields
  Leonard M. Adleman, Ming-Deh A. Huang
  Lecture Notes in Computer Science 1122, 1996, pp. 1-16
• Computing cubic fields in quasi-linear time
  K. Belabas
  Lecture Notes in Computer Science 1122, 1996, pp. 17-25
• Fast ideal arithmetic via lazy localization
  Daniel J. Bernstein
  Lecture Notes in Computer Science 1122, 1996, pp. 27-34
• A comparative study of algorithms for computing continued fractions of algebraic numbers
  Richard P. Brent, Alfred J. van der Poorten, Herman J.J. te Riele
  Lecture Notes in Computer Science 1122, 1996, pp. 35-47
• Computing ray class groups, conductors and discriminants
  H. Cohen, F. Diaz y Diaz, M. Olivier
  Lecture Notes in Computer Science 1122, 1996, pp. 49-57
• Computing l-isogenies using the p-torsion
  Jean-Marc Couveignes
  Lecture Notes in Computer Science 1122, 1996, pp. 59-65
• On computing Hilbert class fields of prime degree
  M. Daberkow, M.E. Pohst
  Lecture Notes in Computer Science 1122, 1996, pp. 67-74