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

• Quadtree decomposition, Steiner triangulation, and ray shooting
  Siu-Wing Cheng, Kam-Hing Lee
  Lecture Notes in Computer Science 1533, 1998, pp. 367-376
• The inapproximability on non NP-hard optimization problems
  Liming Cai, David Juedes, Iyad Kanj
  Lecture Notes in Computer Science 1533, 1998, pp. 437-446
• A parallel algorithm for sampling matchings from an almost uniform distribution
  J. Diaz, J. Petit, P. Psycharis, M. Serna
  Lecture Notes in Computer Science 1533, 1998, pp. 457-466
• Testing theories for asynchronous languages
  Ilaria Castellani, Matthew Hennessy
  Lecture Notes in Computer Science 1530, 1998, pp. 90-101
• The power of reachability testing for timed automata
  Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim G. Larsen
  Lecture Notes in Computer Science 1530, 1998, pp. 245-256
• Efficient formal verification of hierarchical descriptions
  Rajeev Alur
  Lecture Notes in Computer Science 1530, 1998, pp. 269-269
• First-order-CTL model checking
  Jürgen Bohn, Werner Damm, Orna Grumberg, Hardi Hungar, Karen Laster
  Lecture Notes in Computer Science 1530, 1998, pp. 283-294
• A string-rewriting characterization of Muller and Schupp's context-free graphs
  Hugues Calbrix, Teodor Knapik
  Lecture Notes in Computer Science 1530, 1998, pp. 331-342
• A derandomization using min-wise independent permutations
  Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
  Lecture Notes in Computer Science 1518, 1998, pp. 15-24
• On the derandomization of space-bounded computations
  Roy Armoni
  Lecture Notes in Computer Science 1518, 1998, pp. 47-59
• On-line bin-stretching
  Yossi Azar, Oded Regev
  Lecture Notes in Computer Science 1518, 1998, pp. 71-81
• Fringe analysis of synchronized parallel algorithms on 2-3 trees
  Ricardo Baeza-Yates, Joaquim Gabarró, Xavier Messeguer
  Lecture Notes in Computer Science 1518, 1998, pp. 131-144
• On balls and bins with deletions
  Richard Cole, Alan Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh Sitaraman, Eli Upfal
  Lecture Notes in Computer Science 1518, 1998, pp. 145-158
• Using approximation hardness to achieve dependable computation
  Mike Burmester, Yvo Desmedt, Yongge Wang
  Lecture Notes in Computer Science 1518, 1998, pp. 172-186
• Parallel random search and tabu search for the minimal consistent subset selection problem
  Vicente Cerverón, Ariadna Fuertes
  Lecture Notes in Computer Science 1518, 1998, pp. 248-259
• Random geometric problems on [0,1]^2
  Josep Díaz, Jordi Petit, Maria Serna
  Lecture Notes in Computer Science 1518, 1998, pp. 294-306
• Constructive bounds and exact expectations for the random assignment problem
  Don Coppersmith, Gregory B. Sorkin
  Lecture Notes in Computer Science 1518, 1998, pp. 319-330
• Sampling methods applied to dense instances of non-Boolean optimization problems
  Gunnar Andersson, Lars Engebretsen
  Lecture Notes in Computer Science 1518, 1998, pp. 357-368
• Linear time solvable optimization problems on graphs of bounded clique width
  B. Courcelle, J.A. Makowsky, U. Rotics
  Lecture Notes in Computer Science 1517, 1998, pp. 1-16
• Minus domination in small-degree graphs
  Peter Damaschke
  Lecture Notes in Computer Science 1517, 1998, pp. 17-25
• Communication in the two-way listen-in vertex-disjoint paths mode
  Hans-Joachim Böckenhauer
  Lecture Notes in Computer Science 1517, 1998, pp. 38-49
• Broadcasting on anonymous unoriented tori
  Stefan Dobrev, Peter Ruz̑ic̑ka
  Lecture Notes in Computer Science 1517, 1998, pp. 50-62
• A generalization of AT-free graphs and a generic algortihm for solving treewidth, minimum fill-in and vertex ranking
  Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
  Lecture Notes in Computer Science 1517, 1998, pp. 88-99
• Drawing planar partitions II: HH-drawings
  Therese Biedl, Michael Kaufmann, Petra Mutzel
  Lecture Notes in Computer Science 1517, 1998, pp. 124-136
• Graphs with bounded induced distance
  Serafino Cicerone, Gabriele di Stefano
  Lecture Notes in Computer Science 1517, 1998, pp. 177-191