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

Suche: Series=LNCS AND YEAR=2000

• Model checking: Theory into practice
  E. Allen Emerson
  Lecture Notes in Computer Science 1974, 2000, pp. 1-10
• An algebra for XML query
  Mary Fernandez, Jerome Simeon, Philip Wadler
  Lecture Notes in Computer Science 1974, 2000, pp. 11-45
• Irregularities of distribution, derandomization, and complexity theory
  Bernard Chazelle
  Lecture Notes in Computer Science 1974, 2000, pp. 46-54
• Rewriting logic as a metalogical framework
  David Basin, Manuel Clavel, José Meseguer
  Lecture Notes in Computer Science 1974, 2000, pp. 55-80
• Data provenance: Some basic issues
  Peter Buneman, Sanjeev Khanna, Wang-Chiew Tan
  Lecture Notes in Computer Science 1974, 2000, pp. 87-93
• Combining semantics with non-standard interpreter hierarchies
  Sergei Abramov, Robert Glück
  Lecture Notes in Computer Science 1974, 2000, pp. 201-213
• Dynamically ordered probabilistic choice logic programming
  Marina De Vos, Dirk Vermeir
  Lecture Notes in Computer Science 1974, 2000, pp. 227-239
• Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems
  Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege
  Lecture Notes in Computer Science 1974, 2000, pp. 240-251
• Planar graph blocking for external searching
  Surender Baswana, Sandeep Sen
  Lecture Notes in Computer Science 1974, 2000, pp. 252-263
• Text sparsification via local maxima
  Pilu Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
  Lecture Notes in Computer Science 1974, 2000, pp. 290-301
• Approximate swapped matching
  Amihood Amir, Moshe Lewenstein, Ely Porat
  Lecture Notes in Computer Science 1974, 2000, pp. 302-311
• A semantic theory for heterogeneous system design
  Rance Cleaveland, Gerald Lüttgen
  Lecture Notes in Computer Science 1974, 2000, pp. 312-324
• The fine structure of game lambda models
  Pietro Di Gianantonio, Gianluca Franco
  Lecture Notes in Computer Science 1974, 2000, pp. 429-441
• Scheduling to minimize the average completion time of dedicated tasks
  Foto Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon
  Lecture Notes in Computer Science 1974, 2000, pp. 454-464
• Keeping track of the latest gossip in shared memory systems
  Bharat Adsul, Aranyak Mehta, Milind Sohoni
  Lecture Notes in Computer Science 1974, 2000, pp. 477-488
• Voronoi-based systems of coordinates and surface reconstruction
  Jean-Daniel Boissonnat
  Lecture Notes in Computer Science 1969, 2000, pp. 1-1
• Essentially every unimodular matrix defines an expander
  Jin-Yi Cai
  Lecture Notes in Computer Science 1969, 2000, pp. 2-22
• Strategies for hotlink assignments
  Prosenjit Bose, Jurek Czyzowicz, Leszek Ga̧sieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Miguel Vargas Martin
  Lecture Notes in Computer Science 1969, 2000, pp. 23-34
• Online routing in convex subdivisions
  Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro
  Lecture Notes in Computer Science 1969, 2000, pp. 47-59
• Optimal bid sequences for multiple-object auctions with unequal budgets
  Yuyu Chen, Ming-Yang Kao, Hsueh-I. Lu
  Lecture Notes in Computer Science 1969, 2000, pp. 84-95
• Coping with delays and time-outs in binary search procedures
  Ferdinando Cicalese, Ugo Vaccaro
  Lecture Notes in Computer Science 1969, 2000, pp. 96-107
• Some formal analysis of Rocchio's similarity-based relevance feedback algorithm
  Zhixiang Chen, Binhai Zhu
  Lecture Notes in Computer Science 1969, 2000, pp. 108-119
• On approximating minimum vertex cover for graphs with perfect matching
  Jianer Chen, Iyad A. Kanj
  Lecture Notes in Computer Science 1969, 2000, pp. 132-143
• A 2-approximation algorithm for path coloring on trees of rings
  Xiaotie Deng, Guojun Li, Wenan Zang, Yi Zhou
  Lecture Notes in Computer Science 1969, 2000, pp. 144-155
• Approximation algorithms for the maximum power consumption problem on combinatorial circuits
  Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda
  Lecture Notes in Computer Science 1969, 2000, pp. 204-215