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

• Inclusion is undecidable for pattern languages
  Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
  Lecture Notes in Computer Science 700, 1993, pp. 301-312
• New decidability results concerning two-way counter machines and applications
  Oscar H. Ibarra, Tao Jiang, Nicholas Tran, Hui Wang
  Lecture Notes in Computer Science 700, 1993, pp. 313-324
• Logical definability on infinite traces
  Werner Ebinger, Anca Muscholl
  Lecture Notes in Computer Science 700, 1993, pp. 335-346
• Finite automata as characterizations of minor closed tree families
  Arvind Gupta
  Lecture Notes in Computer Science 700, 1993, pp. 359-370
• On distributed algorithms in a broadcast domain
  Danny Dolev, Dalia Malki
  Lecture Notes in Computer Science 700, 1993, pp. 371-387
• Sparse networks supporting efficient reliable broadcasting
  Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
  Lecture Notes in Computer Science 700, 1993, pp. 388-397
• Fast parallel constraint satisfaction
  Lefteris M. Kirousis
  Lecture Notes in Computer Science 700, 1993, pp. 418-429
• Algebraic aspects of B-regular series
  Ph. Dumas
  Lecture Notes in Computer Science 700, 1993, pp. 457-468
• Products of finite state machines with full coverage
  David M. Cohen, Michael L. Fredman
  Lecture Notes in Computer Science 700, 1993, pp. 469-477
• On the power of periodic iteration of morphisms
  Arto Lepistö
  Lecture Notes in Computer Science 700, 1993, pp. 496-506
• Deciding true concurrency equivalences on finite safe nets
  Lalita Jategaonkar, Albert R. Meyer
  Lecture Notes in Computer Science 700, 1993, pp. 519-531
• The fork calculus
  Klaus Havelung, Kim G. Larsen
  Lecture Notes in Computer Science 700, 1993, pp. 544-557
• Extended transition systems for parametric bisimulation
  Paolo Inverardi, Corrado Priami, Daniel Yankelevich
  Lecture Notes in Computer Science 700, 1993, pp. 558-569
• Temporal logic and categories of Petri nets
  Carolyn Brown, Doug Gurr
  Lecture Notes in Computer Science 700, 1993, pp. 570-581
• Local model checking for context-free processes
  Hardi Hungar, Bernhard Steffen
  Lecture Notes in Computer Science 700, 1993, pp. 593-605
• Computing on structures
  Serge Abiteboul, Victor Vianu
  Lecture Notes in Computer Science 700, 1993, pp. 606-620
• A partial solution for D-unification based on a reduction to AC1-unification
  Evelyne Contejean
  Lecture Notes in Computer Science 700, 1993, pp. 621-632
• Efficient analysis of concurrent constraint logic programs
  Michael Codish, Moreno Falaschi, Kim Marriott, William Winsborough
  Lecture Notes in Computer Science 700, 1993, pp. 633-644
• Modularity of termination and confluence in combinations of rewrite systems with \lambda_{\omega}
  Franco Barbanera, Maribel Fernández
  Lecture Notes in Computer Science 700, 1993, pp. 657-668
• From domains to automata with concurrency
  Felipe Bracho, Manfred Droste
  Lecture Notes in Computer Science 700, 1993, pp. 669-681
• Simulation-based comparison of hash functions for emulated shared memory
  Curd Engelmann, Jörg Keller
  Lecture Notes in Computer Science 694, 1993, pp. 1-11
• Task management, virtual shared memory, and multithreading in a distributed memory implementation of Sisal
  Matthew Haines, Wim Böhm
  Lecture Notes in Computer Science 694, 1993, pp. 12-23
• Simulating the data diffusion machine
  Erik Hagersten, Mats Grindal, Anders Landin, Ashley Saulsbury, Bengt Werner, Seif Haridi
  Lecture Notes in Computer Science 694, 1993, pp. 24-41
• 2DT-FP: An FP based programming language for efficient parallel programming of multiprocessor networks
  Yosi Ben-Asher, Gudula Rünger, Assaf Schuster, Reinhard Wilhelm
  Lecture Notes in Computer Science 694, 1993, pp. 42-55
• The data-parallel categorical abstract machine
  Gaétan Hains, Christian Foisy
  Lecture Notes in Computer Science 694, 1993, pp. 56-67