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 Volume=1853

• 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
• Approximating the independence number and the chromatic number in expected polynomial time
  Michael Krivelevich, Van H. Vu
  Lecture Notes in Computer Science 1853, 2000, pp. 13-24
• 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
• A statically allocated parallel functional language
  Alan Mycroft, Richard Sharp
  Lecture Notes in Computer Science 1853, 2000, pp. 37-48
• An optimal minimum spanning tree algorithm
  Seth Pettie, Vijaya Ramachandran
  Lecture Notes in Computer Science 1853, 2000, pp. 49-60
• Improved shortest paths on the word RAM
  Torben Hagerup
  Lecture Notes in Computer Science 1853, 2000, pp. 61-72
• Improved algorithms for finding level ancestors in dynamic trees
  Stephen Alstrup, Jacob Holm
  Lecture Notes in Computer Science 1853, 2000, pp. 73-84
• Lax logical relations
  Gordon Plotkin, John Power, Donald Sannella, Robert Tennent
  Lecture Notes in Computer Science 1853, 2000, pp. 85-102
• Reasoning about idealized Algol
  Dan R. Ghica, Guy McCusker
  Lecture Notes in Computer Science 1853, 2000, pp. 103-115
• The measurement process in domain theory
  Martin Keye
  Lecture Notes in Computer Science 1853, 2000, pp. 116-126
• 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
• Fully-abstract statecharts semantics via intuitionistic Kripke models
  Gerald Lüttgen, Michael Mendler
  Lecture Notes in Computer Science 1853, 2000, pp. 163-174
• 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
• Measures of nondeterminism in finite automata
  Juraj Hromkoviç, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
  Lecture Notes in Computer Science 1853, 2000, pp. 199-210
• LTL is expressively complete for Mazurkiewicz traces
  Volker Diekert, Paul Gastin
  Lecture Notes in Computer Science 1853, 2000, pp. 211-222
• An automata-theoretic completeness proof for interval temporal logic
  Ben C. Moszkowski
  Lecture Notes in Computer Science 1853, 2000, pp. 223-234
• Which NP-hard optimization problems admit non-trivial efficient approximation algorithms?
  J. Håstad
  Lecture Notes in Computer Science 1853, 2000, pp. 235-235
• 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
• Variable independence, quantifier elimination, and constraint representations
  Leonid Libkin
  Lecture Notes in Computer Science 1853, 2000, pp. 260-271
• Constraint satisfaction problems and finite algebras
  Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons
  Lecture Notes in Computer Science 1853, 2000, pp. 272-282
• An optimal online algorithm for bounded space variable-sized bin packing
  Steven S. Seiden
  Lecture Notes in Computer Science 1853, 2000, pp. 283-295