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

• Fast algorithms for even/odd minimum cuts and generalizations
  András A. Benczúr, Ottilia Fülöp
  Lecture Notes in Computer Science 1879, 2000, pp. 88-99
• Efficient algorithms for centers and medians in interval and circular-arc graphs
  S. Bespamyatnikh, B. Bhattacharya, J. Mark Keil, D. Kirkpatrick, M. Segal
  Lecture Notes in Computer Science 1879, 2000, pp. 100-111
• Exact point pattern matching and the number of congruent triangles in a three-dimensional pointset
  Peter Brass
  Lecture Notes in Computer Science 1879, 2000, pp. 112-119
• Range searching over tree cross products
  Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook
  Lecture Notes in Computer Science 1879, 2000, pp. 120-131
• A 2\frac{1}{10}-approximation algorithm for a generalization of the weighted edge-dominating set problem
  Robert Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh
  Lecture Notes in Computer Science 1879, 2000, pp. 132-142
• The minimum range assignment problem on linear radio networks
  A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes, R. Silvestri
  Lecture Notes in Computer Science 1879, 2000, pp. 143-154
• Property testing in computational geometry
  Artur Czumaj, Christian Sohler, Martin Ziegler
  Lecture Notes in Computer Science 1879, 2000, pp. 155-166
• K-D trees are better when cut on the longest side
  Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
  Lecture Notes in Computer Science 1879, 2000, pp. 179-190
• Reconciling two views of cryptography (The computational soundness of formal encryption)
  Martín Abadi, Phillip Rogaway
  Lecture Notes in Computer Science 1872, 2000, pp. 3-22
• An efficient parallel algorithm for scheduling interval ordered tasks
  Yoojin Chung, Kunsoo Park, Hyuk-Chul Kwon
  Lecture Notes in Computer Science 1872, 2000, pp. 100-111
• Steganography using modern arts
  Carlo Blundo, Clemente Galdi
  Lecture Notes in Computer Science 1872, 2000, pp. 140-151
• Maximum clique and minimum clique partition in visibility graphs
  Stephan Eidenbenz, Christoph Stamm
  Lecture Notes in Computer Science 1872, 2000, pp. 200-212
• Real-time language recognition by alternating cellular automata
  Thomas Buchholz, Andreas Klein, Martin Kutrib
  Lecture Notes in Computer Science 1872, 2000, pp. 213-225
• Fully consistent extensions of partially defined Boolean functions with missing bits
  Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
  Lecture Notes in Computer Science 1872, 2000, pp. 257-272
• On the complexity of integer programming in the Blum-Shub-Smale computational model
  Valentin E. Brimkov, Stefan S. Dantchev
  Lecture Notes in Computer Science 1872, 2000, pp. 286-300
• On logarithmic simulated annealing
  Andreas Albrecht, Chak-Kuen Wong
  Lecture Notes in Computer Science 1872, 2000, pp. 301-314
• Ambient groups and mobility types
  Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon
  Lecture Notes in Computer Science 1872, 2000, pp. 333-347
• An interpretation of typed concurrent objects in the blue calculus
  Silvano Dal Zilio
  Lecture Notes in Computer Science 1872, 2000, pp. 409-424
• A higher-order specification of the \pi-calculus
  Joëlle Despeyroux
  Lecture Notes in Computer Science 1872, 2000, pp. 425-439
• Open ended systems, dynamic bisimulation and tile logic
  Roberto Bruni, Ugo Montanari, Vladimiro Sassone
  Lecture Notes in Computer Science 1872, 2000, pp. 440-456
• Reasoning about composition using property transformers and their conjugates
  Michel Charpentier, K. Mani Chandy
  Lecture Notes in Computer Science 1872, 2000, pp. 580-595
• Algorithm design challenges
  Giorgio Ausiello
  Lecture Notes in Computer Science 1872, 2000, pp. 602-603
• Recent progress and prospects for integer factorisation algorithms
  Richard P. Brent
  Lecture Notes in Computer Science 1858, 2000, pp. 3-22
• Approximating uniform triangular meshes in polygons
  Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
  Lecture Notes in Computer Science 1858, 2000, pp. 23-33
• Maximum induced matchings of random cubic graphs
  William Duckworth, Nicholas C. Wormald, Michele Zito
  Lecture Notes in Computer Science 1858, 2000, pp. 34-43