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

• On the cost of recomputing: Tight bounds on pebbling with faults
  Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
  Lecture Notes in Computer Science 820, 1994, pp. 47-58
• On some relations between dynamical systems and transition systems
  Eugene Asarin, Oded Maler
  Lecture Notes in Computer Science 820, 1994, pp. 59-72
• Complexity results for multi-pebble automata and their logics
  Noa Globerman, David Harel
  Lecture Notes in Computer Science 820, 1994, pp. 73-82
• Expressiveness of efficient semi-deterministic choice constructs
  Marc Gyssens, Jan Van den Bussche, Dirk van Gucht
  Lecture Notes in Computer Science 820, 1994, pp. 106-117
• Tailoring recursion for complexity
  Erich Grädel, Yuri Gurevich
  Lecture Notes in Computer Science 820, 1994, pp. 118-129
• Distribution and locality of concurrent systems
  Flavio Corradini, Rocco de Nicola
  Lecture Notes in Computer Science 820, 1994, pp. 154-165
• Liveness in timed and untimed systems
  Rainer Gawlick, Roberto Segala, Jorgen Sgaard-Andersen, Nancy Lynch
  Lecture Notes in Computer Science 820, 1994, pp. 166-177
• Optimal parallel algorithms for prefix matching
  Ramesh Hariharan, S. Muthukrishnan
  Lecture Notes in Computer Science 820, 1994, pp. 203-214
• Optimal two-dimensional compressed matching
  Amihood Amir, Gary Benson, Martin Farach
  Lecture Notes in Computer Science 820, 1994, pp. 215-226
• Simple fast parallel hashing
  Joseph Gil, Yossi Matias
  Lecture Notes in Computer Science 820, 1994, pp. 239-250
• On the cutting edge of relativization: The resource bounded injury method
  Harry Buhrman, Leen Torenvliet
  Lecture Notes in Computer Science 820, 1994, pp. 263-273
• PSPACE-completeness of certain algorithmic problems on the subgroups of free groups
  J.-C. Birget, S. Margolis, J. Meakin, P. Weil
  Lecture Notes in Computer Science 820, 1994, pp. 274-285
• Higher-order processes and their models
  M. Hennessy
  Lecture Notes in Computer Science 820, 1994, pp. 286-303
• Undecidable verification problems for programs with unreliable channels
  Parosh Aziz Abdulla, Bengt Jonsson
  Lecture Notes in Computer Science 820, 1994, pp. 316-327
• Reasoning about programs by exploiting the environment
  Limor Fix, Fred B. Schneider
  Lecture Notes in Computer Science 820, 1994, pp. 328-339
• A model of intuitionistic affine logic from stable domain theory
  Torben Bräuner
  Lecture Notes in Computer Science 820, 1994, pp. 340-351
• Equivalences for fair Kripke structures
  Adnan Aziz, Vigyan Singhal, Felice Balarin, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli
  Lecture Notes in Computer Science 820, 1994, pp. 364-375
• A Kleene theorem for recognizable languages over concurrency monoids
  Manfred Droste
  Lecture Notes in Computer Science 820, 1994, pp. 388-399
• Fast uniform analysis of coupled-context-free languages
  Günter Hotz, Gisela Pitsch
  Lecture Notes in Computer Science 820, 1994, pp. 412-423
• Pumping, cleaning and symbolic constraints solving
  Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
  Lecture Notes in Computer Science 820, 1994, pp. 436-449
• Dynamically-typed computations for order-sorted equational presentations
  Claus Hintermeier, Claude Kirchner, Hélène Kirchner
  Lecture Notes in Computer Science 820, 1994, pp. 450-461
• Multiway cuts in directed and node weighted graphs
  Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
  Lecture Notes in Computer Science 820, 1994, pp. 487-498
• A fast randomized LOGSPACE algorithm for graph connectivity
  Uriel Feige
  Lecture Notes in Computer Science 820, 1994, pp. 499-507
• Polynomial time analysis of toroidal periodic graphs
  F. Höfting, E. Wanke
  Lecture Notes in Computer Science 820, 1994, pp. 544-555
• A tight lower bound for primitivity in k-structures
  P. Bonizzoni
  Lecture Notes in Computer Science 820, 1994, pp. 556-567