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

• Simple algorithms for a weighted interval selection problem
  Thomas Erlebach, Frits C.R. Spieksma
  Lecture Notes in Computer Science 1969, 2000, pp. 228-240
• An intuitive and effective new representation for interconnection network structures
  Jianer Chen, Lihua Liu, Weijia Jia, Songqiao Chen
  Lecture Notes in Computer Science 1969, 2000, pp. 350-361
• Deterministic broadcasting time with partial knowledge of the network
  Gianluca De Marco, Andrzej Pelc
  Lecture Notes in Computer Science 1969, 2000, pp. 374-385
• An improved algorithm for subdivision traversal without extra storage
  Prosenjit Bose, Pat Morin
  Lecture Notes in Computer Science 1969, 2000, pp. 444-455
• Optimal beam penetrations in two and three dimensions
  Danny Z. Chen, Xiaobo (Sharon) Hu, Jinhui Xu
  Lecture Notes in Computer Science 1969, 2000, pp. 491-502
• Optimal polygon cover problems and applications
  Danny Z. Chen, Xiaobo (Sharon) Hu, Xiaodong Wu
  Lecture Notes in Computer Science 1969, 2000, pp. 564-576
• Approximating call-scheduling makespan in all-optical networks
  Luca Becchetti, Miriam di Ianni, Alberto Marchetti-Spaccamela
  Lecture Notes in Computer Science 1928, 2000, pp. 13-22
• New spectral lower bounds on the bisection width of graphs
  Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
  Lecture Notes in Computer Science 1928, 2000, pp. 23-34
• Traversing directed Eulerian mazes
  Sandeep Bhatt, Shimon Even, David Greenberg, Rafi Tayar
  Lecture Notes in Computer Science 1928, 2000, pp. 35-46
• On the space and access complexity of computation DAGs
  Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto
  Lecture Notes in Computer Science 1928, 2000, pp. 47-58
• Approximating the treewidth of AT-free graphs
  Vincent Bouchitté, Ioan Todinca
  Lecture Notes in Computer Science 1928, 2000, pp. 59-70
• Split-perfect graphs: Characterizations and algorithmic use
  Andreas Brandstädt, Van Bang Le
  Lecture Notes in Computer Science 1928, 2000, pp. 71-82
• Coarse grained parallel algorithms for detecting convex bipartite graphs
  Edson Cáceres, Albert Chan, Frank Dehne, Giuseppe Prencipe
  Lecture Notes in Computer Science 1928, 2000, pp. 83-94
• Networks with small stretch number
  Serafino Cicerone, Gabriele di Stefano
  Lecture Notes in Computer Science 1928, 2000, pp. 95-106
• Efficient dispersion algorithms for geometric intersection graphs
  Peter Damaschke
  Lecture Notes in Computer Science 1928, 2000, pp. 107-115
• Optimizing cost flows by modifying arc costs and capacities
  Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
  Lecture Notes in Computer Science 1928, 2000, pp. 116-126
• Update networks and their routing strategies
  Michael J. Dinneen, Bakhadyr Khoussainov
  Lecture Notes in Computer Science 1928, 2000, pp. 127-136
• Computing input multiplicity in anonymous synchronous networks with dynamic faults
  Stefan Dobrev
  Lecture Notes in Computer Science 1928, 2000, pp. 137-148
• Diameter of the Knödel graph
  Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrt̑o
  Lecture Notes in Computer Science 1928, 2000, pp. 149-160
• E2K technology and implementation
  Boris Babayan
  Lecture Notes in Computer Science 1900, 2000, pp. 18-21
• On combining computational differentiation and toolkits for parallel scientific computing
  Christian H. Bischof, H. Martin Bücher, Paul D. Hovland
  Lecture Notes in Computer Science 1900, 2000, pp. 86-94
• Performance evaluation and prediction
  Thomas Fahringer, Wolfgang E. Nagel
  Lecture Notes in Computer Science 1900, 2000, pp. 105-107
• A callgraph-based search strategy for autmated performance diagnosis
  Harold W. Cain, Barton P. Miller, Brian J.N. Wylie
  Lecture Notes in Computer Science 1900, 2000, pp. 108-122
• Pajé: An extensible environment for visualizing multi-threaded programs executions
  Jacques Chassin de Kergommeaux, Benhur de Oliveira Stein
  Lecture Notes in Computer Science 1900, 2000, pp. 133-140
• Integrating automatic techniques in a performance analysis session
  Antonio Espinosa, Tomas Margalef, Emilio Luque
  Lecture Notes in Computer Science 1900, 2000, pp. 173-177