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

• A duality between small-face problems in arrangements of lines and Heilbronn-type problems
  Gill Barequet
  Lecture Notes in Computer Science 1858, 2000, pp. 44-53
• Embedding problems for paths with direction constrained edges
  Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
  Lecture Notes in Computer Science 1858, 2000, pp. 64-73
• Approximation algorithms for independent sets in map graphs
  Zhi-Zhong Chen
  Lecture Notes in Computer Science 1858, 2000, pp. 105-114
• Hierarchical topological inference on planar disc maps
  Zhi-Zhong Chen, Xin He
  Lecture Notes in Computer Science 1858, 2000, pp. 115-125
• Optimal coding with one asymmetric error: Below the sphere packing bound
  Ferdinando Cicalese, Daniele Mundici
  Lecture Notes in Computer Science 1858, 2000, pp. 159-169
• A characterization of graphs with vertex cover six
  Michael J. Dinneen, Liu Xiong
  Lecture Notes in Computer Science 1858, 2000, pp. 180-192
• Better bounds on the accommodating ratio for the seat reservation problem
  Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin
  Lecture Notes in Computer Science 1858, 2000, pp. 221-231
• On computation of arbitrage for markets with friction
  Xiaotie Deng, Zhongfei Li, Shouyang Wang
  Lecture Notes in Computer Science 1858, 2000, pp. 310-319
• Mappings for conflict-free access of paths in elementary data structures
  Alan A. Bertossi, M. Cristina Pinotti
  Lecture Notes in Computer Science 1858, 2000, pp. 351-361
• Learning from approximate data
  Shirley Cheung H.C.
  Lecture Notes in Computer Science 1858, 2000, pp. 407-415
• Removing complexity assumptions from concurrent zero-knowledge proofs
  Giovanni Di Crescenzo
  Lecture Notes in Computer Science 1858, 2000, pp. 426-435
• Game semantics: Achievements and prospects
  Samson Abramsky
  Lecture Notes in Computer Science 1853, 2000, pp. 1-1
• Clique is hard to approximate within n^{1-o(1)}
  Lars Engebretsen, Jonas Holmerin
  Lecture Notes in Computer Science 1853, 2000, pp. 2-12
• Closed types as a simple approach to safe imperative multi-stage programming
  Cristiano Calcagno, Eugenio Moggi, Walid Taha
  Lecture Notes in Computer Science 1853, 2000, pp. 25-36
• Improved algorithms for finding level ancestors in dynamic trees
  Stephen Alstrup, Jacob Holm
  Lecture Notes in Computer Science 1853, 2000, pp. 73-84
• Graph transformation as a conceptual and formal framework for system modeling and model evolution
  Gregor Engels, Reiko Heckel
  Lecture Notes in Computer Science 1853, 2000, pp. 127-150
• Monotone proofs of the pigeon hole principle
  Albert Atserias, Nicola Galesi, Ricard Gavaldà
  Lecture Notes in Computer Science 1853, 2000, pp. 151-162
• Algebraic models for contextual nets
  Roberto Bruni, Vladimiro Sassone
  Lecture Notes in Computer Science 1853, 2000, pp. 175-186
• Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
  Beate Bollig, Ingo Wegener
  Lecture Notes in Computer Science 1853, 2000, pp. 187-198
• LTL is expressively complete for Mazurkiewicz traces
  Volker Diekert, Paul Gastin
  Lecture Notes in Computer Science 1853, 2000, pp. 211-222
• Deterministic algorithms for k-SAT based on covering codes and local search
  Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
  Lecture Notes in Computer Science 1853, 2000, pp. 236-247
• Closest vectors, successive minima, and dual HKZ-bases of lattices
  Johannes Blömer
  Lecture Notes in Computer Science 1853, 2000, pp. 248-259
• Constraint satisfaction problems and finite algebras
  Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons
  Lecture Notes in Computer Science 1853, 2000, pp. 272-282
• Resource augmentation for online bounded space bin packing
  János Csirik, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1853, 2000, pp. 296-304
• Optimal projective algorithms for the list update problem
  Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
  Lecture Notes in Computer Science 1853, 2000, pp. 305-316