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

• Executing transactions in zero-safe nets
  Roberto Bruni, Ugo Montanari
  Lecture Notes in Computer Science 1825, 2000, pp. 83-102
• Efficient symbolic state-space construction for asynchronous systems
  Gianfranco Ciardo, Gerald Lüttgen, Radu Siminiceanu
  Lecture Notes in Computer Science 1825, 2000, pp. 103-122
• Designing a LTL model-checker based on unfolding graphs
  Jean-Michel Couvreur, Sébastien Grivet, Denis Poitrenaud
  Lecture Notes in Computer Science 1825, 2000, pp. 123-145
• Process semantics of Petri nets over partial algebra
  Jörg Desel, Gabriel Juhás, Robert Lorenz
  Lecture Notes in Computer Science 1825, 2000, pp. 146-165
• User interface prototyping based on UML scenarios and high-level Petri nets
  Mohammed Elkoutbi, Rudolf K. Keller
  Lecture Notes in Computer Science 1825, 2000, pp. 166-186
• CASCADE: A tool kernel supporting a comprehensive design method for asynchronous controllers
  Jochen Beister, Gernot Eckstein, Ralf Wollowski
  Lecture Notes in Computer Science 1825, 2000, pp. 445-454
• Graph transformation modules and their composition
  Frank Drewes, Peter Knirsch, Hans-Jörg Kreowski, Sabine Kuske
  Lecture Notes in Computer Science 1779, 2000, pp. 15-30
• On a uniform representation of transformation systems
  Paolo Bottoni, Francesco Parisi-Presicce, Marta Simeoni
  Lecture Notes in Computer Science 1779, 2000, pp. 63-78
• Graph-based reverse engineering and reengineering
  Katja Cremer
  Lecture Notes in Computer Science 1779, 2000, pp. 95-109
• A formal definition of structured analysis with programmable graph grammars
  Luciano Baresi, Mauro Pezzé
  Lecture Notes in Computer Science 1779, 2000, pp. 193-208
• Defining the syntax and semantics of natural visual languages
  Dorothea Blostein
  Lecture Notes in Computer Science 1779, 2000, pp. 225-232
• GenGEd- A development environment for visual languages
  Roswitha Bardohl, Magnus Niemann, Manuel Schwarze
  Lecture Notes in Computer Science 1779, 2000, pp. 233-240
• Image structure from monotonic dual graph contraction
  Roman Englert, Walter Kropatsch
  Lecture Notes in Computer Science 1779, 2000, pp. 297-308
• TREEBAG - A short presentation
  Frank Drewes, Peter Knirsch
  Lecture Notes in Computer Science 1779, 2000, pp. 411-417
• On the many faces of block codes
  Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
  Lecture Notes in Computer Science 1770, 2000, pp. 53-64
• The complexity of planarity testing
  Eric Allender, Meena Mahajan
  Lecture Notes in Computer Science 1770, 2000, pp. 87-98
• Average-case quantum query complexity
  Andris Ambainis, Ronald de Wolf
  Lecture Notes in Computer Science 1770, 2000, pp. 133-144
• Binary exponential backoff is stable for high arrival rates
  Hesham Al-Ammal, Leslie Ann Goldberg, Phil Mackenzie
  Lecture Notes in Computer Science 1770, 2000, pp. 169-180
• On the performance of WEAK-HEAPSORT
  Stefan Edelkamp, Ingo Wegener
  Lecture Notes in Computer Science 1770, 2000, pp. 254-266
• On the two-variable fragment of the equational theory of the Max-Sum algebra of the natural numbers
  Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
  Lecture Notes in Computer Science 1770, 2000, pp. 267-278
• Real-time automata and the Kleene algebra of sets of real numbers
  Cătalin Dima
  Lecture Notes in Computer Science 1770, 2000, pp. 279-289
• Nondeterministic instance complexity and hard-to-prove tautologies
  Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
  Lecture Notes in Computer Science 1770, 2000, pp. 314-323
• Decidability of reachability problems for classes of two counters automata
  Alain Finkel, Grégoire Sutre
  Lecture Notes in Computer Science 1770, 2000, pp. 346-357
• The hardness of approximating spanner problems
  Michael Elkin, David Peleg
  Lecture Notes in Computer Science 1770, 2000, pp. 370-381
• An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality
  Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Ralf Klasing, Sebastian Seibert, Walter Unger
  Lecture Notes in Computer Science 1770, 2000, pp. 382-394