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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=1997

• Using queue time predictions for processor allocation
  Allen B. Downey
  Lecture Notes in Computer Science 1291, 1997, pp. 35-57
• An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors
  Timothy B. Brecht
  Lecture Notes in Computer Science 1291, 1997, pp. 139-165
• Scheduling independent multiprocessor tasks
  A.K. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis
  Lecture Notes in Computer Science 1284, 1997, pp. 1-12
• On local search for weighted k-set packing
  Esther M. Arkin, Refael Hassin
  Lecture Notes in Computer Science 1284, 1997, pp. 13-22
• On-line machine covering
  Yossi Azar, Leah Epstein
  Lecture Notes in Computer Science 1284, 1997, pp. 23-36
• Area-efficient static and incremental graph drawings
  Therese C. Biedl, Michael Kaufmann
  Lecture Notes in Computer Science 1284, 1997, pp. 37-52
• Denesting by bounded degree radicals
  Johannes Blömer
  Lecture Notes in Computer Science 1284, 1997, pp. 53-63
• A linear time algorithm for the arc disjoint Menger problem in planar directed graphs
  Ulrik Brandes, Dorothea Wagner
  Lecture Notes in Computer Science 1284, 1997, pp. 64-77
• Distance approximating trees for chordal and dually chordal graphs
  Andreas Brandstädt, Victor Chepoi, Feodor Dragan
  Lecture Notes in Computer Science 1284, 1997, pp. 78-91
• Decomposition of integer programs and of generating sets
  G. Cornuejols, R. Urbaniak, R. Weismantel, L. Wolsey
  Lecture Notes in Computer Science 1284, 1997, pp. 92-103
• Bounded degree spanning trees
  Artur Czumaj, Willy-B. Strothmann
  Lecture Notes in Computer Science 1284, 1997, pp. 104-117
• Optimal adaptive broadcasting with a bounded fraction of faulty nodes
  Krzysztof Diks, Andrzej Pelc
  Lecture Notes in Computer Science 1284, 1997, pp. 118-129
• Weighted graph separators and their applications
  Hristo N. Djidjev
  Lecture Notes in Computer Science 1284, 1997, pp. 130-143
• k-k-sorting on the multi-mesh
  Alfons Avermiddig, Manfred Kunde, Andre Osterloh
  Lecture Notes in Computer Science 1279, 1997, pp. 93-104
• Refinement of coloured Petri nets
  Eike Best, Thomas Thielke
  Lecture Notes in Computer Science 1279, 1997, pp. 105-116
• Stratified Petri nets
  Eric Badouel, Philippe Darondeau
  Lecture Notes in Computer Science 1279, 1997, pp. 117-128
• Distributed acyclic orientation of asynchronous anonymous networks
  Antonio Calabrese
  Lecture Notes in Computer Science 1279, 1997, pp. 129-137
• Generalized rational relations and their logical difinability
  Christian Choffrut, Leucio Guerra
  Lecture Notes in Computer Science 1279, 1997, pp. 138-149
• A note on broadcasting with linearly bounded transmission faults in constant degree networks
  Krzysztof Ciebiera, Adam Malinowski
  Lecture Notes in Computer Science 1279, 1997, pp. 150-156
• Logics which capture complexity classes over the reals
  Felipe Cucker, Klaus Meer
  Lecture Notes in Computer Science 1279, 1997, pp. 157-167
• Criteria to disprove context-freeness of collage languages
  Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
  Lecture Notes in Computer Science 1279, 1997, pp. 169-178
• Conflict-free access to templates of trees and hypercubes in parallel memory systems
  Sajal K. Das, M. Cristina Pinotti
  Lecture Notes in Computer Science 1276, 1997, pp. 1-10
• A multi-tree generating routing scheme acyclic orientations
  Fred S. Annexstein, Kenneth A. Berman, Ram Swaminathan
  Lecture Notes in Computer Science 1276, 1997, pp. 18-22
• An algorithm for Heilbronn's problem
  Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
  Lecture Notes in Computer Science 1276, 1997, pp. 23-31
• Optimal multiresolution polygonal approximation
  K.W. Chan, Francis Y.L. Chin
  Lecture Notes in Computer Science 1276, 1997, pp. 32-41