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=1995

• On termination of constraint logic programs
  Livio Colussi, Elena Marchiori, Massimo Marchiori
  Lecture Notes in Computer Science 976, 1995, pp. 431-448
• What is symbolic computation?
  Bruno Buchberger
  Lecture Notes in Computer Science 976, 1995, pp. 563-563
• Automatic generation of invariants and intermediate assertions
  Nikolaj Bjorner, Anca Browne, Zohar Manna
  Lecture Notes in Computer Science 976, 1995, pp. 589-623
• The OTI constraint solver: A constraint library for constructing interactive graphical user interfaces
  Alan Borning, Bjorn N. Freeman-Benson
  Lecture Notes in Computer Science 976, 1995, pp. 624-628
• The inherent cost of strong-partial view-synchronous communication
  Özalp Babaoğlu, Renzo Davoli, Luigi Giachini, Paolo Sabattini
  Lecture Notes in Computer Science 972, 1995, pp. 72-86
• Optimal broadcast with partial knowledge
  Baruch Awerbuch, Shay Kutten, Yishay Mansour, David Peleg
  Lecture Notes in Computer Science 972, 1995, pp. 116-130
• Universal constructions for large objects
  James H. Anderson, Mark Moir
  Lecture Notes in Computer Science 972, 1995, pp. 168-182
• Load balancing: An exercise in constrained convergence
  Anish Arora, Mohamed G. Gouda
  Lecture Notes in Computer Science 972, 1995, pp. 183-197
• Broadcasting in hypercubes with randomly distributed Byzantine faults
  Feng Bao, Yoshihide Igarashi, Keiko Katano
  Lecture Notes in Computer Science 972, 1995, pp. 215-229
• On the number of authenticated rounds in Byzantine agreement
  Malte Borcherding
  Lecture Notes in Computer Science 972, 1995, pp. 230-241
• A uniform self-stabilizing minimum diameter spanning tree algorithm
  Franck Butelle, Christian Lavault, Marc Bui
  Lecture Notes in Computer Science 972, 1995, pp. 257-272
• Efficient detection of restricted classes of global predicates
  Craig M. Chase, Vijay K. Garg
  Lecture Notes in Computer Science 972, 1995, pp. 303-317
• Scheduling parallel communication: The h-relation problem
  Micah Adler, John W. Byers, Richard M. Karp
  Lecture Notes in Computer Science 969, 1995, pp. 1-20
• Decomposable structures, Boolean function representations, and optimization
  Stefan Arnborg
  Lecture Notes in Computer Science 969, 1995, pp. 21-36
• Measure on P: Robustness of the notion
  Eric Allender, Martin Strauss
  Lecture Notes in Computer Science 969, 1995, pp. 129-138
• Comparing counting classes for logspace, one-way logspace, and first-order
  Hans-Jörg Burtschick
  Lecture Notes in Computer Science 969, 1995, pp. 139-148
• On the complexity of finite memory policies for Markov decision processes
  Danièle Beauquier, Dima Burago, Anatol Slissenko
  Lecture Notes in Computer Science 969, 1995, pp. 191-200
• Multiple product modulo arbitrary numbers
  Claudia Bertram-Kretzberg, Thomas Hofmeister
  Lecture Notes in Computer Science 969, 1995, pp. 288-298
• Strong optimal lower bounds for Turing machines that accept nonregular languages
  Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
  Lecture Notes in Computer Science 969, 1995, pp. 309-318
• Deterministic parsing for augmented context-free grammars
  Luca Breveglieri, Alessandra Cherubini, Stefano Crespi Reghizzi
  Lecture Notes in Computer Science 969, 1995, pp. 326-336
• An elementary bisimulation decision procedure for arbitrary context-free processes
  Olaf Burkart, Didier Caucal, Bernhard Steffen
  Lecture Notes in Computer Science 969, 1995, pp. 423-433
• On congruences and partial orders
  Serge Bauget, Paul Gastin
  Lecture Notes in Computer Science 969, 1995, pp. 434-443
• Performance preorder: Ordering processes with respect to speed
  Flavio Corradini, Roberto Gorrieri, Marco Roccetti
  Lecture Notes in Computer Science 969, 1995, pp. 444-453
• An abstract account of composition
  Martín Abadi, Stephan Merz
  Lecture Notes in Computer Science 969, 1995, pp. 499-508
• Execution of distributed reactive systems
  Paul Caspi, Alain Girault
  Lecture Notes in Computer Science 966, 1995, pp. 15-26